On distributed scheduling with heterogeneously delayed network-state information

Akula Aneesh Reddy, Siddhartha Banerjee, Aditya Gopalan, Sanjay Shakkottai, Lei Ying

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

We study the problem of distributed scheduling in wireless networks, where each node makes individual scheduling decisions based on heterogeneously delayed network state information (NSI). This leads to inconsistency in the views of the network across nodes, which, coupled with interference, makes it challenging to schedule for high throughputs. We characterize the network throughput region for this setup, and develop optimal scheduling policies to achieve the same. Our scheduling policies have a threshold-based structure and, moreover, require the nodes to use only the "smallest critical subset" of the available delayed NSI to make decisions. In addition, using Markov chain mixing techniques, we quantify the impact of delayed NSI on the throughput region. This not only highlights the value of extra NSI for scheduling, but also characterizes the loss in throughput incurred by lower complexity scheduling policies which use homogeneously delayed NSI.

Original languageEnglish (US)
Pages (from-to)193-218
Number of pages26
JournalQueueing Systems
Volume72
Issue number3-4
DOIs
StatePublished - Oct 2012
Externally publishedYes

Fingerprint

Scheduling
Throughput
Markov processes
Wireless networks
Node

Keywords

  • Delayed information
  • Scheduling algorithms
  • Wireless networks

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Management Science and Operations Research

Cite this

On distributed scheduling with heterogeneously delayed network-state information. / Reddy, Akula Aneesh; Banerjee, Siddhartha; Gopalan, Aditya; Shakkottai, Sanjay; Ying, Lei.

In: Queueing Systems, Vol. 72, No. 3-4, 10.2012, p. 193-218.

Research output: Contribution to journalArticle

Reddy, Akula Aneesh ; Banerjee, Siddhartha ; Gopalan, Aditya ; Shakkottai, Sanjay ; Ying, Lei. / On distributed scheduling with heterogeneously delayed network-state information. In: Queueing Systems. 2012 ; Vol. 72, No. 3-4. pp. 193-218.
@article{170811548efa44799562ee39162dc351,
title = "On distributed scheduling with heterogeneously delayed network-state information",
abstract = "We study the problem of distributed scheduling in wireless networks, where each node makes individual scheduling decisions based on heterogeneously delayed network state information (NSI). This leads to inconsistency in the views of the network across nodes, which, coupled with interference, makes it challenging to schedule for high throughputs. We characterize the network throughput region for this setup, and develop optimal scheduling policies to achieve the same. Our scheduling policies have a threshold-based structure and, moreover, require the nodes to use only the {"}smallest critical subset{"} of the available delayed NSI to make decisions. In addition, using Markov chain mixing techniques, we quantify the impact of delayed NSI on the throughput region. This not only highlights the value of extra NSI for scheduling, but also characterizes the loss in throughput incurred by lower complexity scheduling policies which use homogeneously delayed NSI.",
keywords = "Delayed information, Scheduling algorithms, Wireless networks",
author = "Reddy, {Akula Aneesh} and Siddhartha Banerjee and Aditya Gopalan and Sanjay Shakkottai and Lei Ying",
year = "2012",
month = "10",
doi = "10.1007/s11134-012-9312-z",
language = "English (US)",
volume = "72",
pages = "193--218",
journal = "Queueing Systems",
issn = "0257-0130",
publisher = "Springer Netherlands",
number = "3-4",

}

TY - JOUR

T1 - On distributed scheduling with heterogeneously delayed network-state information

AU - Reddy, Akula Aneesh

AU - Banerjee, Siddhartha

AU - Gopalan, Aditya

AU - Shakkottai, Sanjay

AU - Ying, Lei

PY - 2012/10

Y1 - 2012/10

N2 - We study the problem of distributed scheduling in wireless networks, where each node makes individual scheduling decisions based on heterogeneously delayed network state information (NSI). This leads to inconsistency in the views of the network across nodes, which, coupled with interference, makes it challenging to schedule for high throughputs. We characterize the network throughput region for this setup, and develop optimal scheduling policies to achieve the same. Our scheduling policies have a threshold-based structure and, moreover, require the nodes to use only the "smallest critical subset" of the available delayed NSI to make decisions. In addition, using Markov chain mixing techniques, we quantify the impact of delayed NSI on the throughput region. This not only highlights the value of extra NSI for scheduling, but also characterizes the loss in throughput incurred by lower complexity scheduling policies which use homogeneously delayed NSI.

AB - We study the problem of distributed scheduling in wireless networks, where each node makes individual scheduling decisions based on heterogeneously delayed network state information (NSI). This leads to inconsistency in the views of the network across nodes, which, coupled with interference, makes it challenging to schedule for high throughputs. We characterize the network throughput region for this setup, and develop optimal scheduling policies to achieve the same. Our scheduling policies have a threshold-based structure and, moreover, require the nodes to use only the "smallest critical subset" of the available delayed NSI to make decisions. In addition, using Markov chain mixing techniques, we quantify the impact of delayed NSI on the throughput region. This not only highlights the value of extra NSI for scheduling, but also characterizes the loss in throughput incurred by lower complexity scheduling policies which use homogeneously delayed NSI.

KW - Delayed information

KW - Scheduling algorithms

KW - Wireless networks

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

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

U2 - 10.1007/s11134-012-9312-z

DO - 10.1007/s11134-012-9312-z

M3 - Article

VL - 72

SP - 193

EP - 218

JO - Queueing Systems

JF - Queueing Systems

SN - 0257-0130

IS - 3-4

ER -