DMCA
Time-Varying Fair Queueing Scheduling for Multicode CDMA Based on Dynamic Programming (2004)
Cached
Download Links
| Venue: | IEEE Tran. on Wireless Communications |
| Citations: | 8 - 0 self |
BibTeX
@ARTICLE{Stamoulis04time-varyingfair,
author = {Anastasios Stamoulis and Nicholas D. Sidiropoulos and Senior Member and Georgios B. Giannakis},
title = {Time-Varying Fair Queueing Scheduling for Multicode CDMA Based on Dynamic Programming},
journal = {IEEE Tran. on Wireless Communications},
year = {2004},
volume = {3},
pages = {512--523}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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) constraints 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.
Keyphrases
dynamic programming time-varying fair queueing scheduling multicode cdma mobile user qos requirement wireline wireless networking multicode cdma-based physical layer service rate time-varying weight assignment wireless data network positive weight queueing delay optimal service rate underlying channel quality underlying physical layer efficient algorithm fundamental idea network performance
