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 Citations (Scopus)

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 publicationProceedings - IEEE INFOCOM
DOIs
StatePublished - 2010
Externally publishedYes
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Other

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

Fingerprint

Scheduling
Throughput
Wireless networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics. / Liu, Shihuan; Ying, Lei; Srikant, R.

Proceedings - IEEE INFOCOM. 2010. 5462121.

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

Liu, S, Ying, L & Srikant, R 2010, Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics. in Proceedings - IEEE INFOCOM., 5462121, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5462121
Liu, Shihuan ; Ying, Lei ; Srikant, R. / Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics. Proceedings - IEEE INFOCOM. 2010.
@inproceedings{29f051557b634e1782833fc532ea14c4,
title = "Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics",
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.",
author = "Shihuan Liu and Lei Ying and R. Srikant",
year = "2010",
doi = "10.1109/INFCOM.2010.5462121",
language = "English (US)",
isbn = "9781424458363",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

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

AU - Liu, Shihuan

AU - Ying, Lei

AU - Srikant, R.

PY - 2010

Y1 - 2010

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

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

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

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

U2 - 10.1109/INFCOM.2010.5462121

DO - 10.1109/INFCOM.2010.5462121

M3 - Conference contribution

SN - 9781424458363

BT - Proceedings - IEEE INFOCOM

ER -