Time-Varying Fair Queueing Scheduling for Multicode CDMA Based on Dynamic Programming

Anastasios Stamoulis, Nicholas D. Sidiropoulos, Georgios B. Giannakis

Research output: Contribution to journalArticle

24 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)512-523
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume3
Issue number2
DOIs
StatePublished - Mar 1 2004

Keywords

  • Code-division multiple access (CDMA)
  • Dynamic programming
  • Fair queueing
  • Quality of service
  • Scheduling

Fingerprint Dive into the research topics of 'Time-Varying Fair Queueing Scheduling for Multicode CDMA Based on Dynamic Programming'. Together they form a unique fingerprint.

  • Cite this