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

Shihuan Liu; R. Srikant

doi:10.1109/TNET.2010.2100826

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

Shihuan Liu
, R. Srikant

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

20 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 of 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 language	English (US)
Article number	5696792
Pages (from-to)	1057-1070
Number of pages	14
Journal	IEEE/ACM Transactions on Networking
Volume	19
Issue number	4
DOIs	https://doi.org/10.1109/TNET.2010.2100826
State	Published - Aug 2011
Externally published	Yes

Keywords

Flow-level dynamics
throughput-optimal scheduling
wireless cellular networks

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/TNET.2010.2100826

Cite this

@article{5f3908ad0d70433cba24866c0235b26a,

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 of 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.",

keywords = "Flow-level dynamics, throughput-optimal scheduling, wireless cellular networks",

author = "Shihuan Liu and R. Srikant",

note = "Funding Information: Manuscript received December 18, 2009; revised August 14, 2010; accepted November 12, 2010; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor A. Proutiere. Date of publication January 20, 2011; date of current version August 17, 2011. This work was supported by the National Science Foundation (NSF) under Grants 07-21286 and 08-31756, Army Research Office Multidisciplinary University Research Initiative (ARO MURI) subcontracts, and the Defense Threat Reduction Agency (DTRA) under Grants HDTRA1-08-1-0016 and HDTRA1-09-1-0055. A shorter version of this paper appears in the Proceedings of the IEEE International Conference on Computer Communications (INFOCOM) 2010.",

year = "2011",

month = aug,

doi = "10.1109/TNET.2010.2100826",

language = "English (US)",

volume = "19",

pages = "1057--1070",

journal = "IEEE/ACM Transactions on Networking",

issn = "1063-6692",

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

number = "4",

}

TY - JOUR

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

AU - Liu, Shihuan

AU - Srikant, R.

N1 - Funding Information: Manuscript received December 18, 2009; revised August 14, 2010; accepted November 12, 2010; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor A. Proutiere. Date of publication January 20, 2011; date of current version August 17, 2011. This work was supported by the National Science Foundation (NSF) under Grants 07-21286 and 08-31756, Army Research Office Multidisciplinary University Research Initiative (ARO MURI) subcontracts, and the Defense Threat Reduction Agency (DTRA) under Grants HDTRA1-08-1-0016 and HDTRA1-09-1-0055. A shorter version of this paper appears in the Proceedings of the IEEE International Conference on Computer Communications (INFOCOM) 2010.

PY - 2011/8

Y1 - 2011/8

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

KW - Flow-level dynamics

KW - throughput-optimal scheduling

KW - wireless cellular networks

UR - https://www.scopus.com/pages/publications/80051801968

UR - https://www.scopus.com/pages/publications/80051801968#tab=citedBy

U2 - 10.1109/TNET.2010.2100826

DO - 10.1109/TNET.2010.2100826

M3 - Article

SN - 1063-6692

VL - 19

SP - 1057

EP - 1070

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 4

M1 - 5696792

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this