On throughput optimality with delayed network-state information

Lei Ying, Sanjay Shakkottai

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

23 Citations (Scopus)

Abstract

We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.

Original languageEnglish (US)
Title of host publication2008 Information Theory and Applications Workshop - Conference Proceedings, ITA
Pages339-344
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 Information Theory and Applications Workshop - ITA - San Diego, CA, United States
Duration: Jan 27 2008Feb 1 2008

Other

Other2008 Information Theory and Applications Workshop - ITA
CountryUnited States
CitySan Diego, CA
Period1/27/082/1/08

Fingerprint

Scheduling
Throughput
Controllers
Routing algorithms
Scheduling algorithms
Wireless networks
Topology

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Ying, L., & Shakkottai, S. (2008). On throughput optimality with delayed network-state information. In 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA (pp. 339-344). [4601070] https://doi.org/10.1109/ITA.2008.4601070

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

2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. 2008. p. 339-344 4601070.

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

Ying, L & Shakkottai, S 2008, On throughput optimality with delayed network-state information. in 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA., 4601070, pp. 339-344, 2008 Information Theory and Applications Workshop - ITA, San Diego, CA, United States, 1/27/08. https://doi.org/10.1109/ITA.2008.4601070
Ying L, Shakkottai S. On throughput optimality with delayed network-state information. In 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. 2008. p. 339-344. 4601070 https://doi.org/10.1109/ITA.2008.4601070
Ying, Lei ; Shakkottai, Sanjay. / On throughput optimality with delayed network-state information. 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. 2008. pp. 339-344
@inproceedings{2dc7aaa85292430fb92f44994a3b467e,
title = "On throughput optimality with delayed network-state information",
abstract = "We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.",
author = "Lei Ying and Sanjay Shakkottai",
year = "2008",
doi = "10.1109/ITA.2008.4601070",
language = "English (US)",
isbn = "1424426707",
pages = "339--344",
booktitle = "2008 Information Theory and Applications Workshop - Conference Proceedings, ITA",

}

TY - GEN

T1 - On throughput optimality with delayed network-state information

AU - Ying, Lei

AU - Shakkottai, Sanjay

PY - 2008

Y1 - 2008

N2 - We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.

AB - We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.

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

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

U2 - 10.1109/ITA.2008.4601070

DO - 10.1109/ITA.2008.4601070

M3 - Conference contribution

AN - SCOPUS:52949129138

SN - 1424426707

SN - 9781424426706

SP - 339

EP - 344

BT - 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA

ER -