Delay-optimal rate allocation in multiaccess communications: a cross-layer view

E. Yeh
{"title":"Delay-optimal rate allocation in multiaccess communications: a cross-layer view","authors":"E. Yeh","doi":"10.1109/MMSP.2002.1203331","DOIUrl":null,"url":null,"abstract":"The literature on multiaccess communications has traditionally treated \"network-layer\" issues such as source burstiness, network delay, and buffer overflow, apart from \"physical-layer\" issues such as channel modeling, coding, and detection. The recent work of Telatar and Gallager [I. E. Telatar and R. Gallager, Combining Queueing Theory with Information Theory for Multiaccess, August 1995] [I.E. Telatar, Multiple Access Information Theory and Job Scheduling, 1995] have sought to bridge this unfortunate division. We extend this line of inquiry by examining a multiaccess communication scenario where users' packets arrive randomly into separate queues and transmission rates are allocated from the information-theoretic multiaccess capacity region based on the respective users' queue states. In the symmetric case, a longer-queue-higher rate (LQHR) allocation strategy is shown to minimize the average system delay of packets. Such a policy can be interpreted in the coding context as adaptive successive decoding. The delay performance of the LQHR policy provides a fundamental lower bound to the performance for multiaccess coding schemes which seek to meet any given level of decoding error probability.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE Workshop on Multimedia Signal Processing.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2002.1203331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

Abstract

The literature on multiaccess communications has traditionally treated "network-layer" issues such as source burstiness, network delay, and buffer overflow, apart from "physical-layer" issues such as channel modeling, coding, and detection. The recent work of Telatar and Gallager [I. E. Telatar and R. Gallager, Combining Queueing Theory with Information Theory for Multiaccess, August 1995] [I.E. Telatar, Multiple Access Information Theory and Job Scheduling, 1995] have sought to bridge this unfortunate division. We extend this line of inquiry by examining a multiaccess communication scenario where users' packets arrive randomly into separate queues and transmission rates are allocated from the information-theoretic multiaccess capacity region based on the respective users' queue states. In the symmetric case, a longer-queue-higher rate (LQHR) allocation strategy is shown to minimize the average system delay of packets. Such a policy can be interpreted in the coding context as adaptive successive decoding. The delay performance of the LQHR policy provides a fundamental lower bound to the performance for multiaccess coding schemes which seek to meet any given level of decoding error probability.
多址通信中延迟最优速率分配:一个跨层视图
关于多址通信的文献传统上除了处理信道建模、编码和检测等“物理层”问题外,还处理诸如源突发、网络延迟和缓冲区溢出等“网络层”问题。Telatar和Gallager最近的研究[I]。E. Telatar和R. Gallager,《多址信息理论与信息论的结合》,1995年8月[即:Telatar,多址信息理论与作业调度,1995]试图解决这一不幸的分歧。我们通过研究一个多址通信场景来扩展这条研究线,其中用户的数据包随机到达单独的队列,并且根据各自用户的队列状态从信息论的多址容量区域分配传输速率。在对称情况下,展示了一种更长的队列更高速率(LQHR)分配策略,以最小化数据包的平均系统延迟。这种策略可以在编码上下文中解释为自适应连续解码。LQHR策略的延迟性能为寻求满足任何给定解码错误概率的多址编码方案的性能提供了一个基本的下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信