Low-complexity scheduling algorithms for multi-channel downlink wireless networks

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

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

28 Citations (Scopus)

Abstract

This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) that is shown to be throughput optimal for a general class of arrival/channel processes, and also rate-function optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF however has higher complexity than MaxWeight (n4 vs. n2 respectively). To overcome this issue, we propose a new algorithm called SSG (Server-Side Greedy). We show that SSG is throughput optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n2) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.

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 algorithms
Wireless networks
Throughput
Orthogonal frequency division multiplexing
Computational complexity
Servers

Keywords

  • Large deviations
  • Low complexity
  • Scheduling algorithms
  • Small buffer

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Bodas, S., Shakkottai, S., Ying, L., & Srikant, R. (2010). Low-complexity scheduling algorithms for multi-channel downlink wireless networks. In Proceedings - IEEE INFOCOM [5462047] https://doi.org/10.1109/INFCOM.2010.5462047

Low-complexity scheduling algorithms for multi-channel downlink wireless networks. / Bodas, Shreeshankar; Shakkottai, Sanjay; Ying, Lei; Srikant, R.

Proceedings - IEEE INFOCOM. 2010. 5462047.

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

Bodas, S, Shakkottai, S, Ying, L & Srikant, R 2010, Low-complexity scheduling algorithms for multi-channel downlink wireless networks. in Proceedings - IEEE INFOCOM., 5462047, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5462047
Bodas, Shreeshankar ; Shakkottai, Sanjay ; Ying, Lei ; Srikant, R. / Low-complexity scheduling algorithms for multi-channel downlink wireless networks. Proceedings - IEEE INFOCOM. 2010.
@inproceedings{2ccfa2aa43684afeb7f75b32b12f6586,
title = "Low-complexity scheduling algorithms for multi-channel downlink wireless networks",
abstract = "This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) that is shown to be throughput optimal for a general class of arrival/channel processes, and also rate-function optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF however has higher complexity than MaxWeight (n4 vs. n2 respectively). To overcome this issue, we propose a new algorithm called SSG (Server-Side Greedy). We show that SSG is throughput optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n2) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.",
keywords = "Large deviations, Low complexity, Scheduling algorithms, Small buffer",
author = "Shreeshankar Bodas and Sanjay Shakkottai and Lei Ying and R. Srikant",
year = "2010",
doi = "10.1109/INFCOM.2010.5462047",
language = "English (US)",
isbn = "9781424458363",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Low-complexity scheduling algorithms for multi-channel downlink wireless networks

AU - Bodas, Shreeshankar

AU - Shakkottai, Sanjay

AU - Ying, Lei

AU - Srikant, R.

PY - 2010

Y1 - 2010

N2 - This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) that is shown to be throughput optimal for a general class of arrival/channel processes, and also rate-function optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF however has higher complexity than MaxWeight (n4 vs. n2 respectively). To overcome this issue, we propose a new algorithm called SSG (Server-Side Greedy). We show that SSG is throughput optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n2) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.

AB - This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) that is shown to be throughput optimal for a general class of arrival/channel processes, and also rate-function optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF however has higher complexity than MaxWeight (n4 vs. n2 respectively). To overcome this issue, we propose a new algorithm called SSG (Server-Side Greedy). We show that SSG is throughput optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n2) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.

KW - Large deviations

KW - Low complexity

KW - Scheduling algorithms

KW - Small buffer

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

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

U2 - 10.1109/INFCOM.2010.5462047

DO - 10.1109/INFCOM.2010.5462047

M3 - Conference contribution

SN - 9781424458363

BT - Proceedings - IEEE INFOCOM

ER -