Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Stability results for networks with input and output blocking
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
Adaptive packet routing for bursty adversarial traffic
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Distributed Algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
A note on models for non-probabilistic analysis of packet switching networks
Information Processing Letters
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
SIAM Journal on Computing
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Achieving stability in networks of input-queued switches
IEEE/ACM Transactions on Networking (TON)
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
SIAM Journal on Computing
New Stability Results for Adversarial Queuing
SIAM Journal on Computing
The Impact of Failure Management on the Stability of Communication Networks
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
SIAM Journal on Computing
The Impact of Network Structure on the Stability of Greedy Protocols
Theory of Computing Systems
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The Wake-Up Problem in MultiHop Radio Networks
SIAM Journal on Computing
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Deterministic broadcast on multiple access channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
We study deterministic broadcasting on multiple access channels when packets are injected continuously. The quality of service is considered in the framework of adversarial queuing. An adversary is determined by injection rate and burstiness, the latter denoting the number of packets that can be injected simultaneously in a round. We consider only injection rates that are less than 1. A protocol is stable when the numbers of packets in queues stay bounded at all rounds, and it is of fair latency when waiting times of packets in queues are O(burstiness/rate). For channels with collision detection, we give a full-sensing protocol of fair latency for injection rates that are at most 1 2(⌈lg n⌉ + 1), where n is the number of stations, and show that fair latency is impossible to achieve for injection rates that are ω(1 log n). For channels without collision detection, we present a full-sensing protocol of fair latency for injection rates that are at most 1 c lg2 n, for some c 0. We show that there exists an acknowledgment-based protocol that has fair latency for injection rates that are at most 1 cn lg2 n, for some c 0, and develop an explicit acknowledgment-based protocol of fair latency for injection rates that are at most 1 27n2 ln n. Regarding impossibility to achieve just stability by restricted protocols, we prove that no acknowledgment-based protocol can be stable for injection rates larger than 3 1 + lg n.