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

A. Stamoulis, Nikolaos Sidiropoulos, G. B. Giannakis

Research output: Contribution to conferencePaper

5 Scopus citations

Abstract

Fair Queuing (FQ) algorithms, which have been proposed for QoS wireline-wireless networking, rely on the fundamental idea that the service rate allocated to user m is proportional to a positive weight φm. Targeting wireless data networks with a multicode CDMA-based physical layer, we develop FQ with time-varying weight assignments in order to minimize the queuing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying i) constraints imposed by the underlying physical layer, and ii) QoS requirements. Simulations illustrate the merits of our designs.

Original languageEnglish (US)
Pages3504-3508
Number of pages5
StatePublished - Dec 1 2001
EventIEEE Global Telecommunications Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunications Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

Fingerprint Dive into the research topics of 'Time-varying fair queuing scheduling for multicode CDMA based on dynamic programming'. Together they form a unique fingerprint.

  • Cite this

    Stamoulis, A., Sidiropoulos, N., & Giannakis, G. B. (2001). Time-varying fair queuing scheduling for multicode CDMA based on dynamic programming. 3504-3508. Paper presented at IEEE Global Telecommunications Conference GLOBECOM'01, San Antonio, TX, United States.