Time-varying fair queueing scheduling for multicode CDMA based on dynamic programming

Authors:
A. Stamoulis;N. D. Sidiropoulos;G. B. Giannakis
Affiliations:
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA;-;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2004

Citing 0
Cited 5

A Generalized Analytical Framework for SMPT in a Multicode CDMA Wireless System

Wireless Personal Communications: An International Journal
Adaptive rate-scheduling with reactive delay control for next generation CDMA wireless mobile systems

EURASIP Journal on Wireless Communications and Networking
Cross-layer resource scheduling for video traffic in the downlink of OFDMA-based wireless 4G networks

EURASIP Journal on Wireless Communications and Networking - Special issue on fairness in radio resource management for wireless networks
Performance measurement and queueing analysis at medium-high blocking probability of parallel connection servers with identical service rates

WSEAS TRANSACTIONS on COMMUNICATIONS
Multi-rate control policies for elastic traffic in CDMA networks

Performance Evaluation

Quantified Score

Hi-index	0.01

Visualization

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.