A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols

Authors:
Leslie Ann Goldberg;Mark Jerrum;Sampath Kannan;Mike Paterson
Affiliations:
-;-;-;-
Venue:
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Year:
2000

Citing 11
Cited 1

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

Journal of the ACM (JACM)
Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Stability of binary exponential backoff

Journal of the ACM (JACM)
Multiple access protocols: performance and analysis

Multiple access protocols: performance and analysis
Randomized algorithms

Randomized algorithms
Stochastic contention resolution with short delays

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Analysis of Backoff Protocols for Mulitiple AccessChannels

SIAM Journal on Computing
Analysis of practical backoff protocols for contention resolution with multiple servers

Journal of Computer and System Sciences
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Contention Resolution with Guaranteed Constant Expected Delay

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Information theory and communication networks: an unconsummated union

IEEE Transactions on Information Theory

Dynamic packet scheduling in wireless networks

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, λ, is at least 0:42 and that the capacity of every backoff protocol is at most 0:42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0:531, also hold for every acknowledgement-based protocol.