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

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

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


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
Issue number2
StatePublished - Mar 2004

Bibliographical note

Funding Information:
Manuscript received February 20, 2002; revised July 29, 2002 and November 9, 2002; accepted November 13, 2002. The editor coordinating the review of this paper and approving it for publication is M. Zorzi. The work of N. Sidiropoulos was supported by NSF/Wireless CCR-9979295. This work was presented in part at the IEEE Globecom, San Antonio, TX, November 2001.


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


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