Stable scheduling policies for broadcast channels

Atilla Eryilmaz; R. Srikant; James R. Perkins

doi:10.1109/ISIT.2002.1023654

Stable scheduling policies for broadcast channels

Atilla Eryilmaz, R. Srikant, James R. Perkins

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

Abstract

The stable scheduling policies for an N-user broadcast channel were presented. It was shown that this system is stable in the mean through the use of a Lyapunov argument. A scheduling policy is an allocation of service rates to the various queues by the transmitter, under the constraint that, at each time instant, the set of allocated rates lies within S (region). A scheduling strategy which stabilizes the system using just queue length information was also presented.

Original language	English (US)
Article number	382
Pages (from-to)	382
Number of pages	1
Journal	IEEE International Symposium on Information Theory-Proceedings
DOIs	https://doi.org/10.1109/ISIT.2002.1023654
State	Published - 2002

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Online availability

10.1109/ISIT.2002.1023654

Library availability

Discover UIUC Full Text

Cite this

@article{fedd3cac51434657bea09f3bd3f41db6,

title = "Stable scheduling policies for broadcast channels",

abstract = "The stable scheduling policies for an N-user broadcast channel were presented. It was shown that this system is stable in the mean through the use of a Lyapunov argument. A scheduling policy is an allocation of service rates to the various queues by the transmitter, under the constraint that, at each time instant, the set of allocated rates lies within S (region). A scheduling strategy which stabilizes the system using just queue length information was also presented.",

author = "Atilla Eryilmaz and R. Srikant and Perkins, {James R.}",

year = "2002",

doi = "10.1109/ISIT.2002.1023654",

language = "English (US)",

pages = "382",

journal = "IEEE International Symposium on Information Theory-Proceedings",

issn = "2157-8095",

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

}

TY - JOUR

T1 - Stable scheduling policies for broadcast channels

AU - Eryilmaz, Atilla

AU - Srikant, R.

AU - Perkins, James R.

PY - 2002

Y1 - 2002

N2 - The stable scheduling policies for an N-user broadcast channel were presented. It was shown that this system is stable in the mean through the use of a Lyapunov argument. A scheduling policy is an allocation of service rates to the various queues by the transmitter, under the constraint that, at each time instant, the set of allocated rates lies within S (region). A scheduling strategy which stabilizes the system using just queue length information was also presented.

AB - The stable scheduling policies for an N-user broadcast channel were presented. It was shown that this system is stable in the mean through the use of a Lyapunov argument. A scheduling policy is an allocation of service rates to the various queues by the transmitter, under the constraint that, at each time instant, the set of allocated rates lies within S (region). A scheduling strategy which stabilizes the system using just queue length information was also presented.

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

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

U2 - 10.1109/ISIT.2002.1023654

DO - 10.1109/ISIT.2002.1023654

M3 - Article

AN - SCOPUS:0036351648

SN - 2157-8095

SP - 382

JO - IEEE International Symposium on Information Theory-Proceedings

JF - IEEE International Symposium on Information Theory-Proceedings

M1 - 382

ER -

Stable scheduling policies for broadcast channels

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this