Stable scheduling policies for broadcast channels

Atilla Eryilmaz, R. Srikant, James R. Perkins

Research output: Contribution to journalArticlepeer-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 languageEnglish (US)
Article number382
Number of pages1
JournalIEEE International Symposium on Information Theory-Proceedings
DOIs
StatePublished - Jan 1 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Stable scheduling policies for broadcast channels'. Together they form a unique fingerprint.

Cite this