Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics

Shihuan Liu, Lei Ying, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to achieve the maximum throughput in the presence of flow-level dynamics. In this paper, we propose a new algorithm, called workload-based scheduling with learning, which is provably throughput-optimal, requires no prior knowledge of channels and user demands, and performs significantly better than previously suggested algorithms.

Original languageEnglish (US)
Title of host publication2010 Proceedings IEEE INFOCOM
DOIs
StatePublished - Jun 15 2010
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2010
CountryUnited States
CitySan Diego, CA
Period3/14/103/19/10

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics'. Together they form a unique fingerprint.

  • Cite this

    Liu, S., Ying, L., & Srikant, R. (2010). Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics. In 2010 Proceedings IEEE INFOCOM [5462121] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2010.5462121