QoS support by using CDF-based wireless packet scheduling in fading channels

Daeyoung Park; Byeong Gi Lee

doi:10.1109/TCOMM.2006.884847

QoS support by using CDF-based wireless packet scheduling in fading channels

Daeyoung Park, Byeong Gi Lee

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

29 Scopus citations

Abstract

In this paper, we provide an efficient quality-of-service (QoS)-guarantee scheme using the cumulative-distribution-function-based scheduling (CS) algorithm in wireless fading channels. We first extend the CS algorithm such that it can encompass the practical environment with discrete user transmission rates. The extended CS algorithm can allocate the time fractions to users in arbitrary manner, and render an exact estimation of user average throughputs, through which it can provide differentiated QoS to each user. We also introduce the effective-capacity concept to describe the delay-constrained capacity of the CS algorithm, both in time-independent and time-correlated channels. In contrast to other existing scheduling algorithms, the CS algorithm enables calculating the effective capacity analytically, rather than estimating it by measurement on the queueing behavior. Using the effective capacity, we can check the feasibility of the user-specified QoS effectively in wireless time-varying channels.

Original language	English
Pages (from-to)	2051-2061
Number of pages	11
Journal	IEEE Transactions on Communications
Volume	54
Issue number	11
DOIs	https://doi.org/10.1109/TCOMM.2006.884847
State	Published - Nov 2006
Externally published	Yes

Bibliographical note

Funding Information:
Paper approved by T.-S. P. Yum, the Editor for Packet Access and Switching of the IEEE Communications Society. Manuscript received April 20, 2004; revised January 2, 2005 and May 23, 2005. This work was supported in part by the Samsung Advanced Institute of Technology, in part by the Brain Korea 21 Project, and in part by the University IT Research Center Project.

Keywords

Effective capacity
Multiuser diversity
Quality-of-service (QoS)
Resource allocation
Wireless packet scheduling

Access to Document

10.1109/TCOMM.2006.884847

Cite this

@article{e6d2ef1d276d44d6ada8a7fbaa1ee29c,

title = "QoS support by using CDF-based wireless packet scheduling in fading channels",

abstract = "In this paper, we provide an efficient quality-of-service (QoS)-guarantee scheme using the cumulative-distribution-function-based scheduling (CS) algorithm in wireless fading channels. We first extend the CS algorithm such that it can encompass the practical environment with discrete user transmission rates. The extended CS algorithm can allocate the time fractions to users in arbitrary manner, and render an exact estimation of user average throughputs, through which it can provide differentiated QoS to each user. We also introduce the effective-capacity concept to describe the delay-constrained capacity of the CS algorithm, both in time-independent and time-correlated channels. In contrast to other existing scheduling algorithms, the CS algorithm enables calculating the effective capacity analytically, rather than estimating it by measurement on the queueing behavior. Using the effective capacity, we can check the feasibility of the user-specified QoS effectively in wireless time-varying channels.",

keywords = "Effective capacity, Multiuser diversity, Quality-of-service (QoS), Resource allocation, Wireless packet scheduling",

author = "Daeyoung Park and Lee, {Byeong Gi}",

note = "Funding Information: Paper approved by T.-S. P. Yum, the Editor for Packet Access and Switching of the IEEE Communications Society. Manuscript received April 20, 2004; revised January 2, 2005 and May 23, 2005. This work was supported in part by the Samsung Advanced Institute of Technology, in part by the Brain Korea 21 Project, and in part by the University IT Research Center Project.",

year = "2006",

month = nov,

doi = "10.1109/TCOMM.2006.884847",

language = "English",

volume = "54",

pages = "2051--2061",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

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

number = "11",

}

TY - JOUR

T1 - QoS support by using CDF-based wireless packet scheduling in fading channels

AU - Park, Daeyoung

AU - Lee, Byeong Gi

N1 - Funding Information: Paper approved by T.-S. P. Yum, the Editor for Packet Access and Switching of the IEEE Communications Society. Manuscript received April 20, 2004; revised January 2, 2005 and May 23, 2005. This work was supported in part by the Samsung Advanced Institute of Technology, in part by the Brain Korea 21 Project, and in part by the University IT Research Center Project.

PY - 2006/11

Y1 - 2006/11

N2 - In this paper, we provide an efficient quality-of-service (QoS)-guarantee scheme using the cumulative-distribution-function-based scheduling (CS) algorithm in wireless fading channels. We first extend the CS algorithm such that it can encompass the practical environment with discrete user transmission rates. The extended CS algorithm can allocate the time fractions to users in arbitrary manner, and render an exact estimation of user average throughputs, through which it can provide differentiated QoS to each user. We also introduce the effective-capacity concept to describe the delay-constrained capacity of the CS algorithm, both in time-independent and time-correlated channels. In contrast to other existing scheduling algorithms, the CS algorithm enables calculating the effective capacity analytically, rather than estimating it by measurement on the queueing behavior. Using the effective capacity, we can check the feasibility of the user-specified QoS effectively in wireless time-varying channels.

AB - In this paper, we provide an efficient quality-of-service (QoS)-guarantee scheme using the cumulative-distribution-function-based scheduling (CS) algorithm in wireless fading channels. We first extend the CS algorithm such that it can encompass the practical environment with discrete user transmission rates. The extended CS algorithm can allocate the time fractions to users in arbitrary manner, and render an exact estimation of user average throughputs, through which it can provide differentiated QoS to each user. We also introduce the effective-capacity concept to describe the delay-constrained capacity of the CS algorithm, both in time-independent and time-correlated channels. In contrast to other existing scheduling algorithms, the CS algorithm enables calculating the effective capacity analytically, rather than estimating it by measurement on the queueing behavior. Using the effective capacity, we can check the feasibility of the user-specified QoS effectively in wireless time-varying channels.

KW - Effective capacity

KW - Multiuser diversity

KW - Quality-of-service (QoS)

KW - Resource allocation

KW - Wireless packet scheduling

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

U2 - 10.1109/TCOMM.2006.884847

DO - 10.1109/TCOMM.2006.884847

M3 - Article

AN - SCOPUS:37849189268

SN - 0090-6778

VL - 54

SP - 2051

EP - 2061

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 11

ER -

QoS support by using CDF-based wireless packet scheduling in fading channels

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this