.png){kind=icon}
返回
Time-varying fair queueing scheduling for multicode CDMA based on dynamic programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2003.821151.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fair queueing (FQ) algorithms, which have been proposed for quality of service (QoS) wireline/wireless networking, rely on the fundamental idea that the service rate allocated to each user is proportional to a positive weight. Targeting wireless data networks with a multicode CDMA-based physical layer, we develop, FQ with time-varying weight assignment in order to minimize the queueing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying 1) constrairits imposed by the underlying physical layer and 2) QoS requirements. Furthermore, we study how information about the underlying channel quality can be incorporated into the scheduler to improve network performance. Simulations illustrate the merits of our designs.
Keyword:
code-division multiple access (CDMA)
dynamic programming
fair queueing
quality of service
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
Non-invasive monitoring of diabetes through analysis of the exhaled breath condensate (aerosol)
PREAI
分享收藏
查看更多内容