Binary Exponential Backoff Is Stable for High Arrival Rates

Authors:
Hesham Al-Ammal;Leslie Ann Goldberg;Philip D. MacKenzie
Affiliations:
-;-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 7
Cited 0

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)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Goodman, Greenberg, Madras and March gave a lower bound of n-Ω(log n) for the maximum arrival rate for which the n-user binary exponential backoff protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n-Ω(log n). We improve the lower bound, showing that the protocol is stable for arrival rates up to O(n-.9).