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

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

doi:10.1109/TWC.2003.821151

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

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

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	512-523
Number of pages	12
Journal	IEEE Transactions on Wireless Communications
Volume	3
Issue number	2
DOIs	https://doi.org/10.1109/TWC.2003.821151
State	Published - 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.

Keywords

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

Access

10.1109/TWC.2003.821151

Cite this

@article{63d71072761e4e6db01d652f86f70dd2,

title = "Time-Varying Fair Queueing Scheduling for Multicode CDMA Based on Dynamic Programming",

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.",

keywords = "Code-division multiple access (CDMA), Dynamic programming, Fair queueing, Quality of service, Scheduling",

author = "Anastasios Stamoulis and Sidiropoulos, {Nicholas D.} and Giannakis, {Georgios B.}",

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.",

year = "2004",

month = mar,

doi = "10.1109/TWC.2003.821151",

language = "English (US)",

volume = "3",

pages = "512--523",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

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

AU - Stamoulis, Anastasios

AU - Sidiropoulos, Nicholas D.

AU - Giannakis, Georgios B.

N1 - 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.

PY - 2004/3

Y1 - 2004/3

N2 - 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.

AB - 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.

KW - Code-division multiple access (CDMA)

KW - Dynamic programming

KW - Fair queueing

KW - Quality of service

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=2342581461&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2342581461&partnerID=8YFLogxK

U2 - 10.1109/TWC.2003.821151

DO - 10.1109/TWC.2003.821151

M3 - Article

AN - SCOPUS:2342581461

VL - 3

SP - 512

EP - 523

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 2

ER -

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

Abstract

Bibliographical note

Keywords

Access

Other files and links

Fingerprint

Cite this