Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Adversarial Multiple Access Channels with Individual Injection Rates

Adversarial Multiple Access Channels with Individual Injection Rates We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into n nodes by a window-type adversary that is constrained by a window w and injection rates individually assigned to all nodes. We investigate what queue size and packet latency can be achieved with the maximum aggregate injection rate of one packet per round, depending on properties of channels and algorithms. We give a non-adaptive algorithm for channels with collision detection and an adaptive algorithm for channels without collision detection that achieve O ( min ( n + w , w log n ) ) ${\mathcal {O}}(\min (n+w,w\log n))$ packet latency. We show that packet latency has to be either Ω(wmax(1,logw n)), when w ≤ n, or Ω(w + n), when w > n, as a matching lower bound to these algorithms. We develop a non-adaptive algorithm for channels without collision detection that achieves O ( n + w ) ${\mathcal {O}}(n+w)$ queue size and O ( nw ) ${\mathcal {O}}(nw)$ packet latency. This is in contrast with the adversarial model of global injection rates, in which non-adaptive algorithms with bounded packet latency do not exist (Chlebus et al. Distrib. Comput. 22(2), 93–116 2009). Our algorithm avoids collisions produced by simultaneous transmissions; we show that any algorithm with this property must have Ω(n w) packet latency. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Theory of Computing Systems Springer Journals

Adversarial Multiple Access Channels with Individual Injection Rates

Loading next page...
 
/lp/springer_journal/adversarial-multiple-access-channels-with-individual-injection-rates-JGDUUF2sWZ

References (52)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer Science+Business Media New York
Subject
Computer Science; Theory of Computation
ISSN
1432-4350
eISSN
1433-0490
DOI
10.1007/s00224-016-9725-x
Publisher site
See Article on Publisher Site

Abstract

We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into n nodes by a window-type adversary that is constrained by a window w and injection rates individually assigned to all nodes. We investigate what queue size and packet latency can be achieved with the maximum aggregate injection rate of one packet per round, depending on properties of channels and algorithms. We give a non-adaptive algorithm for channels with collision detection and an adaptive algorithm for channels without collision detection that achieve O ( min ( n + w , w log n ) ) ${\mathcal {O}}(\min (n+w,w\log n))$ packet latency. We show that packet latency has to be either Ω(wmax(1,logw n)), when w ≤ n, or Ω(w + n), when w > n, as a matching lower bound to these algorithms. We develop a non-adaptive algorithm for channels without collision detection that achieves O ( n + w ) ${\mathcal {O}}(n+w)$ queue size and O ( nw ) ${\mathcal {O}}(nw)$ packet latency. This is in contrast with the adversarial model of global injection rates, in which non-adaptive algorithms with bounded packet latency do not exist (Chlebus et al. Distrib. Comput. 22(2), 93–116 2009). Our algorithm avoids collisions produced by simultaneous transmissions; we show that any algorithm with this property must have Ω(n w) packet latency.

Journal

Theory of Computing SystemsSpringer Journals

Published: Nov 28, 2016

There are no references for this article.