Delay and effective throughput of wireless scheduling in heavy traffic regimes

Vacation model for complexity

Yung Yi, Junshan Zhang, Mung Chiang

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

6 Citations (Scopus)

Abstract

Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spectrum, ranging from no message passing to constant/polynomial time complexity, or even exponential complexity. However, by and large it remains open to quantify the impact of message passing complexity on throughput and delay. In this paper, we study the effective throughput and delay performance in wireless scheduling by explicitly considering complexity through a vacation model, where signaling complexity is treated as "vacations" and data transmissions as "ser-vices,"with a focus on delay analysis in heavy traffic regimes. We analyze delay performance in two regimes of vacation models, depending on the relative lengths of data transmission and vacation periods. State space collapse properties proved here enable a significant dimensionality reduction in the challenging problem of delay characterization. We then explore engineering implications and quantify intuitions based on the heavy traffic analysis.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Pages55-64
Number of pages10
DOIs
StatePublished - 2009
Event10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'09 - New Orleans, LA, United States
Duration: May 18 2009May 21 2009

Other

Other10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'09
CountryUnited States
CityNew Orleans, LA
Period5/18/095/21/09

Fingerprint

Message passing
Telecommunication traffic
Data communication systems
Scheduling
Throughput
Wireless ad hoc networks
Scheduling algorithms
Parallel algorithms
Polynomials

Keywords

  • Complexity
  • Heavy-traffic
  • Scheduling
  • Wireless networks

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Yi, Y., Zhang, J., & Chiang, M. (2009). Delay and effective throughput of wireless scheduling in heavy traffic regimes: Vacation model for complexity. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (pp. 55-64) https://doi.org/10.1145/1530748.1530757

Delay and effective throughput of wireless scheduling in heavy traffic regimes : Vacation model for complexity. / Yi, Yung; Zhang, Junshan; Chiang, Mung.

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2009. p. 55-64.

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

Yi, Y, Zhang, J & Chiang, M 2009, Delay and effective throughput of wireless scheduling in heavy traffic regimes: Vacation model for complexity. in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). pp. 55-64, 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'09, New Orleans, LA, United States, 5/18/09. https://doi.org/10.1145/1530748.1530757
Yi Y, Zhang J, Chiang M. Delay and effective throughput of wireless scheduling in heavy traffic regimes: Vacation model for complexity. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2009. p. 55-64 https://doi.org/10.1145/1530748.1530757
Yi, Yung ; Zhang, Junshan ; Chiang, Mung. / Delay and effective throughput of wireless scheduling in heavy traffic regimes : Vacation model for complexity. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2009. pp. 55-64
@inproceedings{3195f261ac674aec841ec5c8045697d6,
title = "Delay and effective throughput of wireless scheduling in heavy traffic regimes: Vacation model for complexity",
abstract = "Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spectrum, ranging from no message passing to constant/polynomial time complexity, or even exponential complexity. However, by and large it remains open to quantify the impact of message passing complexity on throughput and delay. In this paper, we study the effective throughput and delay performance in wireless scheduling by explicitly considering complexity through a vacation model, where signaling complexity is treated as {"}vacations{"} and data transmissions as {"}ser-vices,{"}with a focus on delay analysis in heavy traffic regimes. We analyze delay performance in two regimes of vacation models, depending on the relative lengths of data transmission and vacation periods. State space collapse properties proved here enable a significant dimensionality reduction in the challenging problem of delay characterization. We then explore engineering implications and quantify intuitions based on the heavy traffic analysis.",
keywords = "Complexity, Heavy-traffic, Scheduling, Wireless networks",
author = "Yung Yi and Junshan Zhang and Mung Chiang",
year = "2009",
doi = "10.1145/1530748.1530757",
language = "English (US)",
isbn = "9781605585314",
pages = "55--64",
booktitle = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",

}

TY - GEN

T1 - Delay and effective throughput of wireless scheduling in heavy traffic regimes

T2 - Vacation model for complexity

AU - Yi, Yung

AU - Zhang, Junshan

AU - Chiang, Mung

PY - 2009

Y1 - 2009

N2 - Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spectrum, ranging from no message passing to constant/polynomial time complexity, or even exponential complexity. However, by and large it remains open to quantify the impact of message passing complexity on throughput and delay. In this paper, we study the effective throughput and delay performance in wireless scheduling by explicitly considering complexity through a vacation model, where signaling complexity is treated as "vacations" and data transmissions as "ser-vices,"with a focus on delay analysis in heavy traffic regimes. We analyze delay performance in two regimes of vacation models, depending on the relative lengths of data transmission and vacation periods. State space collapse properties proved here enable a significant dimensionality reduction in the challenging problem of delay characterization. We then explore engineering implications and quantify intuitions based on the heavy traffic analysis.

AB - Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spectrum, ranging from no message passing to constant/polynomial time complexity, or even exponential complexity. However, by and large it remains open to quantify the impact of message passing complexity on throughput and delay. In this paper, we study the effective throughput and delay performance in wireless scheduling by explicitly considering complexity through a vacation model, where signaling complexity is treated as "vacations" and data transmissions as "ser-vices,"with a focus on delay analysis in heavy traffic regimes. We analyze delay performance in two regimes of vacation models, depending on the relative lengths of data transmission and vacation periods. State space collapse properties proved here enable a significant dimensionality reduction in the challenging problem of delay characterization. We then explore engineering implications and quantify intuitions based on the heavy traffic analysis.

KW - Complexity

KW - Heavy-traffic

KW - Scheduling

KW - Wireless networks

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

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

U2 - 10.1145/1530748.1530757

DO - 10.1145/1530748.1530757

M3 - Conference contribution

SN - 9781605585314

SP - 55

EP - 64

BT - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

ER -