Adversarial multiple access channel with individual injection rates

Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki

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

Abstract

We study deterministic distributed broadcasting on a synchronous multiple-access channel. Packets are injected into stations by a window-type adversary that is constrained by an individual injection rate of each station and a window w. We investigate what queue sizes and packet latency can be achieved with the maximum throughput of one packet per round. A protocol knows the number n of all the stations but does not know the window nor the individual rates of stations. We study the power of full sensing and acknowledgment based protocols as compared to general adaptive ones. We show that individual injection rates make it possible to achieve bounded packet latency by full sensing protocols, what is in contrast with the model of global injection rates for which stability and finite waiting times are not achievable together by general protocols. We show that packet latency is Ω(w log n/log w) when w ≤ n and it is Ω(w) when w > n. We give a full sensing protocol for channels with collision detection and an adaptive one for channels without collision detection that achieve packet latency. We develop a full sensing protocol for a channel without collision detection that achieves O(n + w) queues and O(nw) packet latency.

Original languageEnglish (US)
Title of host publicationPrinciples of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings
PublisherSpringer Verlag
Pages174-188
Number of pages15
ISBN (Print)3642108768, 9783642108761
DOIs
StatePublished - Jan 1 2009
Externally publishedYes
Event13th International Conference on Principles of Distributed Systems, OPODIS 2009 - Nimes, France
Duration: Dec 15 2009Dec 18 2009

Publication series

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

Conference

Conference13th International Conference on Principles of Distributed Systems, OPODIS 2009
CountryFrance
CityNimes
Period12/15/0912/18/09

Fingerprint

Multiple Access Channel
Broadcasting
Injection
Throughput
Latency
Collision Detection
Sensing
Queue
Waiting Time

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Anantharamu, L., Chlebus, B. S., & Rokicki, M. A. (2009). Adversarial multiple access channel with individual injection rates. In Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings (pp. 174-188). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5923 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-10877-8_15

Adversarial multiple access channel with individual injection rates. / Anantharamu, Lakshmi; Chlebus, Bogdan S.; Rokicki, Mariusz A.

Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings. Springer Verlag, 2009. p. 174-188 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5923 LNCS).

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

Anantharamu, L, Chlebus, BS & Rokicki, MA 2009, Adversarial multiple access channel with individual injection rates. in Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5923 LNCS, Springer Verlag, pp. 174-188, 13th International Conference on Principles of Distributed Systems, OPODIS 2009, Nimes, France, 12/15/09. https://doi.org/10.1007/978-3-642-10877-8_15
Anantharamu L, Chlebus BS, Rokicki MA. Adversarial multiple access channel with individual injection rates. In Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings. Springer Verlag. 2009. p. 174-188. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10877-8_15
Anantharamu, Lakshmi ; Chlebus, Bogdan S. ; Rokicki, Mariusz A. / Adversarial multiple access channel with individual injection rates. Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings. Springer Verlag, 2009. pp. 174-188 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ae25fd738ec64909a40b3252cc45cf9b,
title = "Adversarial multiple access channel with individual injection rates",
abstract = "We study deterministic distributed broadcasting on a synchronous multiple-access channel. Packets are injected into stations by a window-type adversary that is constrained by an individual injection rate of each station and a window w. We investigate what queue sizes and packet latency can be achieved with the maximum throughput of one packet per round. A protocol knows the number n of all the stations but does not know the window nor the individual rates of stations. We study the power of full sensing and acknowledgment based protocols as compared to general adaptive ones. We show that individual injection rates make it possible to achieve bounded packet latency by full sensing protocols, what is in contrast with the model of global injection rates for which stability and finite waiting times are not achievable together by general protocols. We show that packet latency is Ω(w log n/log w) when w ≤ n and it is Ω(w) when w > n. We give a full sensing protocol for channels with collision detection and an adaptive one for channels without collision detection that achieve packet latency. We develop a full sensing protocol for a channel without collision detection that achieves O(n + w) queues and O(nw) packet latency.",
author = "Lakshmi Anantharamu and Chlebus, {Bogdan S.} and Rokicki, {Mariusz A.}",
year = "2009",
month = "1",
day = "1",
doi = "10.1007/978-3-642-10877-8_15",
language = "English (US)",
isbn = "3642108768",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "174--188",
booktitle = "Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings",

}

TY - GEN

T1 - Adversarial multiple access channel with individual injection rates

AU - Anantharamu, Lakshmi

AU - Chlebus, Bogdan S.

AU - Rokicki, Mariusz A.

PY - 2009/1/1

Y1 - 2009/1/1

N2 - We study deterministic distributed broadcasting on a synchronous multiple-access channel. Packets are injected into stations by a window-type adversary that is constrained by an individual injection rate of each station and a window w. We investigate what queue sizes and packet latency can be achieved with the maximum throughput of one packet per round. A protocol knows the number n of all the stations but does not know the window nor the individual rates of stations. We study the power of full sensing and acknowledgment based protocols as compared to general adaptive ones. We show that individual injection rates make it possible to achieve bounded packet latency by full sensing protocols, what is in contrast with the model of global injection rates for which stability and finite waiting times are not achievable together by general protocols. We show that packet latency is Ω(w log n/log w) when w ≤ n and it is Ω(w) when w > n. We give a full sensing protocol for channels with collision detection and an adaptive one for channels without collision detection that achieve packet latency. We develop a full sensing protocol for a channel without collision detection that achieves O(n + w) queues and O(nw) packet latency.

AB - We study deterministic distributed broadcasting on a synchronous multiple-access channel. Packets are injected into stations by a window-type adversary that is constrained by an individual injection rate of each station and a window w. We investigate what queue sizes and packet latency can be achieved with the maximum throughput of one packet per round. A protocol knows the number n of all the stations but does not know the window nor the individual rates of stations. We study the power of full sensing and acknowledgment based protocols as compared to general adaptive ones. We show that individual injection rates make it possible to achieve bounded packet latency by full sensing protocols, what is in contrast with the model of global injection rates for which stability and finite waiting times are not achievable together by general protocols. We show that packet latency is Ω(w log n/log w) when w ≤ n and it is Ω(w) when w > n. We give a full sensing protocol for channels with collision detection and an adaptive one for channels without collision detection that achieve packet latency. We develop a full sensing protocol for a channel without collision detection that achieves O(n + w) queues and O(nw) packet latency.

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

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

U2 - 10.1007/978-3-642-10877-8_15

DO - 10.1007/978-3-642-10877-8_15

M3 - Conference contribution

AN - SCOPUS:72749087552

SN - 3642108768

SN - 9783642108761

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

SP - 174

EP - 188

BT - Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings

PB - Springer Verlag

ER -