Scheduling in multi-channel wireless networks

Rate function optimality in the small-buffer regime

Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R. Srikant

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

34 Citations (Scopus)

Abstract

We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels, each of which can be allocated to a possibly different user in each time slot. We prove that a class of algorithms called Iterated Longest Queues First (iLQF) algorithms achieves the smallest buffer overflow probability in an appropriate large deviations sense. The class of iLQF algorithms is quite different from the class of max-weight policies which have been studied extensively in the literature, and it achieves much better performance in the regimes studied in this paper.

Original languageEnglish (US)
Title of host publicationSIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems
Pages121-132
Number of pages12
Volume37
Edition1
DOIs
StatePublished - 2009
Externally publishedYes
Event11th International Joint Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance'09 - Seattle, WA, United States
Duration: Jun 15 2009Jun 19 2009

Other

Other11th International Joint Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance'09
CountryUnited States
CitySeattle, WA
Period6/15/096/19/09

Fingerprint

Wireless networks
Scheduling
Scheduling algorithms
Bandwidth

Keywords

  • Delay optimality
  • Large deviations
  • Scheduling algorithm

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Bodas, S., Shakkottai, S., Ying, L., & Srikant, R. (2009). Scheduling in multi-channel wireless networks: Rate function optimality in the small-buffer regime. In SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems (1 ed., Vol. 37, pp. 121-132). [1555364] https://doi.org/10.1145/1555349.1555364

Scheduling in multi-channel wireless networks : Rate function optimality in the small-buffer regime. / Bodas, Shreeshankar; Shakkottai, Sanjay; Ying, Lei; Srikant, R.

SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems. Vol. 37 1. ed. 2009. p. 121-132 1555364.

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

Bodas, S, Shakkottai, S, Ying, L & Srikant, R 2009, Scheduling in multi-channel wireless networks: Rate function optimality in the small-buffer regime. in SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems. 1 edn, vol. 37, 1555364, pp. 121-132, 11th International Joint Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance'09, Seattle, WA, United States, 6/15/09. https://doi.org/10.1145/1555349.1555364
Bodas S, Shakkottai S, Ying L, Srikant R. Scheduling in multi-channel wireless networks: Rate function optimality in the small-buffer regime. In SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems. 1 ed. Vol. 37. 2009. p. 121-132. 1555364 https://doi.org/10.1145/1555349.1555364
Bodas, Shreeshankar ; Shakkottai, Sanjay ; Ying, Lei ; Srikant, R. / Scheduling in multi-channel wireless networks : Rate function optimality in the small-buffer regime. SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems. Vol. 37 1. ed. 2009. pp. 121-132
@inproceedings{df73d3c12169438f8cd6d05c1bfd10a7,
title = "Scheduling in multi-channel wireless networks: Rate function optimality in the small-buffer regime",
abstract = "We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels, each of which can be allocated to a possibly different user in each time slot. We prove that a class of algorithms called Iterated Longest Queues First (iLQF) algorithms achieves the smallest buffer overflow probability in an appropriate large deviations sense. The class of iLQF algorithms is quite different from the class of max-weight policies which have been studied extensively in the literature, and it achieves much better performance in the regimes studied in this paper.",
keywords = "Delay optimality, Large deviations, Scheduling algorithm",
author = "Shreeshankar Bodas and Sanjay Shakkottai and Lei Ying and R. Srikant",
year = "2009",
doi = "10.1145/1555349.1555364",
language = "English (US)",
isbn = "9781605585116",
volume = "37",
pages = "121--132",
booktitle = "SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems",
edition = "1",

}

TY - GEN

T1 - Scheduling in multi-channel wireless networks

T2 - Rate function optimality in the small-buffer regime

AU - Bodas, Shreeshankar

AU - Shakkottai, Sanjay

AU - Ying, Lei

AU - Srikant, R.

PY - 2009

Y1 - 2009

N2 - We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels, each of which can be allocated to a possibly different user in each time slot. We prove that a class of algorithms called Iterated Longest Queues First (iLQF) algorithms achieves the smallest buffer overflow probability in an appropriate large deviations sense. The class of iLQF algorithms is quite different from the class of max-weight policies which have been studied extensively in the literature, and it achieves much better performance in the regimes studied in this paper.

AB - We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels, each of which can be allocated to a possibly different user in each time slot. We prove that a class of algorithms called Iterated Longest Queues First (iLQF) algorithms achieves the smallest buffer overflow probability in an appropriate large deviations sense. The class of iLQF algorithms is quite different from the class of max-weight policies which have been studied extensively in the literature, and it achieves much better performance in the regimes studied in this paper.

KW - Delay optimality

KW - Large deviations

KW - Scheduling algorithm

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

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

U2 - 10.1145/1555349.1555364

DO - 10.1145/1555349.1555364

M3 - Conference contribution

SN - 9781605585116

VL - 37

SP - 121

EP - 132

BT - SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems

ER -