Stability of the multiple-access channel under maximum broadcast loads

Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki

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

Abstract

We investigate deterministic broadcasting on multiple-access channels in the framework of adversarial queuing. A protocol is stable when the number of packets stays bounded, and it is fair when each packet is eventually broadcast. We address the question if stability and fairness can be achieved against the maximum injection rate of one packet per round. We study three natural classes of protocols: acknowledgment based, full sensing and fully adaptive. We show that no adaptive protocol can be both stable and fair for the system of at least two stations against leaky-bucket adversaries, while this is achievable against window adversaries. We study in detail small systems of exactly two and three stations attached to the channel. For two stations, we show that bounded latency can be achieved by a full-sensing protocol, while there is no stable acknowledgment-based protocol. For three stations, we show that bounded latency can be achieved by an adaptive protocol, while there is no stable full-sensing protocol. We develop an adaptive protocol that is stable for any number of stations against leaky-bucket adversaries. The protocol has Ο(n 2) packets queued simultaneously, which is proved to be best possible as an upper bound. We show that protocols that do not use queue sizes at stations in an effective way or are greedy by having stations with nonempty queues withhold the channel cannot be stable in systems of at least four stations.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings
Pages124-138
Number of pages15
StatePublished - Dec 1 2007
Externally publishedYes
Event9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2007 - Paris, France
Duration: Nov 14 2007Nov 16 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4838 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2007
CountryFrance
CityParis
Period11/14/0711/16/07

Fingerprint

Multiple Access Channel
Broadcasting
Broadcast
Sensing
Queue
Latency
Queuing
Fairness
Injection
Upper bound

Keywords

  • Adversarial queuing
  • Deterministic broadcast
  • Fairness
  • Latency
  • Multiple-access channel
  • Stability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2007). Stability of the multiple-access channel under maximum broadcast loads. In Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings (pp. 124-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4838 LNCS).

Stability of the multiple-access channel under maximum broadcast loads. / Chlebus, Bogdan S.; Kowalski, Dariusz R.; Rokicki, Mariusz A.

Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings. 2007. p. 124-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4838 LNCS).

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

Chlebus, BS, Kowalski, DR & Rokicki, MA 2007, Stability of the multiple-access channel under maximum broadcast loads. in Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4838 LNCS, pp. 124-138, 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2007, Paris, France, 11/14/07.
Chlebus BS, Kowalski DR, Rokicki MA. Stability of the multiple-access channel under maximum broadcast loads. In Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings. 2007. p. 124-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chlebus, Bogdan S. ; Kowalski, Dariusz R. ; Rokicki, Mariusz A. / Stability of the multiple-access channel under maximum broadcast loads. Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings. 2007. pp. 124-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bf8b7f107c6345cbbdba41d5fcc0b901,
title = "Stability of the multiple-access channel under maximum broadcast loads",
abstract = "We investigate deterministic broadcasting on multiple-access channels in the framework of adversarial queuing. A protocol is stable when the number of packets stays bounded, and it is fair when each packet is eventually broadcast. We address the question if stability and fairness can be achieved against the maximum injection rate of one packet per round. We study three natural classes of protocols: acknowledgment based, full sensing and fully adaptive. We show that no adaptive protocol can be both stable and fair for the system of at least two stations against leaky-bucket adversaries, while this is achievable against window adversaries. We study in detail small systems of exactly two and three stations attached to the channel. For two stations, we show that bounded latency can be achieved by a full-sensing protocol, while there is no stable acknowledgment-based protocol. For three stations, we show that bounded latency can be achieved by an adaptive protocol, while there is no stable full-sensing protocol. We develop an adaptive protocol that is stable for any number of stations against leaky-bucket adversaries. The protocol has Ο(n 2) packets queued simultaneously, which is proved to be best possible as an upper bound. We show that protocols that do not use queue sizes at stations in an effective way or are greedy by having stations with nonempty queues withhold the channel cannot be stable in systems of at least four stations.",
keywords = "Adversarial queuing, Deterministic broadcast, Fairness, Latency, Multiple-access channel, Stability",
author = "Chlebus, {Bogdan S.} and Kowalski, {Dariusz R.} and Rokicki, {Mariusz A.}",
year = "2007",
month = "12",
day = "1",
language = "English (US)",
isbn = "9783540766261",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "124--138",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings",

}

TY - GEN

T1 - Stability of the multiple-access channel under maximum broadcast loads

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

AU - Rokicki, Mariusz A.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We investigate deterministic broadcasting on multiple-access channels in the framework of adversarial queuing. A protocol is stable when the number of packets stays bounded, and it is fair when each packet is eventually broadcast. We address the question if stability and fairness can be achieved against the maximum injection rate of one packet per round. We study three natural classes of protocols: acknowledgment based, full sensing and fully adaptive. We show that no adaptive protocol can be both stable and fair for the system of at least two stations against leaky-bucket adversaries, while this is achievable against window adversaries. We study in detail small systems of exactly two and three stations attached to the channel. For two stations, we show that bounded latency can be achieved by a full-sensing protocol, while there is no stable acknowledgment-based protocol. For three stations, we show that bounded latency can be achieved by an adaptive protocol, while there is no stable full-sensing protocol. We develop an adaptive protocol that is stable for any number of stations against leaky-bucket adversaries. The protocol has Ο(n 2) packets queued simultaneously, which is proved to be best possible as an upper bound. We show that protocols that do not use queue sizes at stations in an effective way or are greedy by having stations with nonempty queues withhold the channel cannot be stable in systems of at least four stations.

AB - We investigate deterministic broadcasting on multiple-access channels in the framework of adversarial queuing. A protocol is stable when the number of packets stays bounded, and it is fair when each packet is eventually broadcast. We address the question if stability and fairness can be achieved against the maximum injection rate of one packet per round. We study three natural classes of protocols: acknowledgment based, full sensing and fully adaptive. We show that no adaptive protocol can be both stable and fair for the system of at least two stations against leaky-bucket adversaries, while this is achievable against window adversaries. We study in detail small systems of exactly two and three stations attached to the channel. For two stations, we show that bounded latency can be achieved by a full-sensing protocol, while there is no stable acknowledgment-based protocol. For three stations, we show that bounded latency can be achieved by an adaptive protocol, while there is no stable full-sensing protocol. We develop an adaptive protocol that is stable for any number of stations against leaky-bucket adversaries. The protocol has Ο(n 2) packets queued simultaneously, which is proved to be best possible as an upper bound. We show that protocols that do not use queue sizes at stations in an effective way or are greedy by having stations with nonempty queues withhold the channel cannot be stable in systems of at least four stations.

KW - Adversarial queuing

KW - Deterministic broadcast

KW - Fairness

KW - Latency

KW - Multiple-access channel

KW - Stability

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

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

M3 - Conference contribution

AN - SCOPUS:38349010901

SN - 9783540766261

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 124

EP - 138

BT - Stabilization, Safety, and Security of Distributed Systems - 9th International Symposium, SSS 2007, Proceedings

ER -