On throughput optimality with delayed network-state information

Lei Ying, Sanjay Shakkottai

Research output: Contribution to journalArticle

32 Citations (Scopus)

Abstract

The problem of routing/scheduling in a wireless network with partial/delayed network (channel and queue) state information (NSI) is studied in this paper. Two cases are considered: (i) centralized routing/scheduling, where a central controller obtains heterogeneously delayed information from each of the nodes (thus, the controller has NSI with different delays from different nodes), and makes routing/scheduling decisions; (ii) decentralized routing/scheduling, where each node makes a decision based on its current channel and queue states along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), the optimal network throughput regions are characterized under the above described NSI models and it is shown that the throughput regions shrinks with the increase of delay. Further, channel and queue length based routing/scheduling algorithms that achieve the above throughput regions are proposed in this paper.

Original languageEnglish (US)
Article number5961800
Pages (from-to)5116-5132
Number of pages17
JournalIEEE Transactions on Information Theory
Volume57
Issue number8
DOIs
StatePublished - Aug 2011
Externally publishedYes

Fingerprint

scheduling
Scheduling
Throughput
Controllers
Routing algorithms
Scheduling algorithms
Wireless networks

Keywords

  • Delayed network state information (NSI)
  • routing
  • scheduling
  • throughput optimality
  • wireless networks

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On throughput optimality with delayed network-state information. / Ying, Lei; Shakkottai, Sanjay.

In: IEEE Transactions on Information Theory, Vol. 57, No. 8, 5961800, 08.2011, p. 5116-5132.

Research output: Contribution to journalArticle

@article{498976dffa4a478db88de12771122ba9,
title = "On throughput optimality with delayed network-state information",
abstract = "The problem of routing/scheduling in a wireless network with partial/delayed network (channel and queue) state information (NSI) is studied in this paper. Two cases are considered: (i) centralized routing/scheduling, where a central controller obtains heterogeneously delayed information from each of the nodes (thus, the controller has NSI with different delays from different nodes), and makes routing/scheduling decisions; (ii) decentralized routing/scheduling, where each node makes a decision based on its current channel and queue states along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), the optimal network throughput regions are characterized under the above described NSI models and it is shown that the throughput regions shrinks with the increase of delay. Further, channel and queue length based routing/scheduling algorithms that achieve the above throughput regions are proposed in this paper.",
keywords = "Delayed network state information (NSI), routing, scheduling, throughput optimality, wireless networks",
author = "Lei Ying and Sanjay Shakkottai",
year = "2011",
month = "8",
doi = "10.1109/TIT.2011.2158879",
language = "English (US)",
volume = "57",
pages = "5116--5132",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - On throughput optimality with delayed network-state information

AU - Ying, Lei

AU - Shakkottai, Sanjay

PY - 2011/8

Y1 - 2011/8

N2 - The problem of routing/scheduling in a wireless network with partial/delayed network (channel and queue) state information (NSI) is studied in this paper. Two cases are considered: (i) centralized routing/scheduling, where a central controller obtains heterogeneously delayed information from each of the nodes (thus, the controller has NSI with different delays from different nodes), and makes routing/scheduling decisions; (ii) decentralized routing/scheduling, where each node makes a decision based on its current channel and queue states along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), the optimal network throughput regions are characterized under the above described NSI models and it is shown that the throughput regions shrinks with the increase of delay. Further, channel and queue length based routing/scheduling algorithms that achieve the above throughput regions are proposed in this paper.

AB - The problem of routing/scheduling in a wireless network with partial/delayed network (channel and queue) state information (NSI) is studied in this paper. Two cases are considered: (i) centralized routing/scheduling, where a central controller obtains heterogeneously delayed information from each of the nodes (thus, the controller has NSI with different delays from different nodes), and makes routing/scheduling decisions; (ii) decentralized routing/scheduling, where each node makes a decision based on its current channel and queue states along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), the optimal network throughput regions are characterized under the above described NSI models and it is shown that the throughput regions shrinks with the increase of delay. Further, channel and queue length based routing/scheduling algorithms that achieve the above throughput regions are proposed in this paper.

KW - Delayed network state information (NSI)

KW - routing

KW - scheduling

KW - throughput optimality

KW - wireless networks

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

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

U2 - 10.1109/TIT.2011.2158879

DO - 10.1109/TIT.2011.2158879

M3 - Article

VL - 57

SP - 5116

EP - 5132

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 8

M1 - 5961800

ER -