Stability of binary exponential backoff

129Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Binary exponential backoff is a randomized protocol for regulating transmissions on a multiple-access broadcast channel. Ethernet, a local-area network, is built upon this protocol. The fundamental theoretical issue is stability: Does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? It is assumed n ≥ 2 stations share the channel, each having an infinite buffer where packets accumulate while the station attempts to transmit the first from the buffer. Here, it is established that binary exponential backoff is stable if the sum of the arrival rates is sufficiently small. Detailed results are obtained on which rates lead to stability when n = 2 stations share the channel. In passing, several other results are derived bearing on the efficiency of the conflict resolution process. Simulation results are reported that, in particular, indicate alternative retransmission protocols can significantly improve performance. © 1988, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Goodman, J., Greenberg, A. G., Madras, N., & March, P. (1988). Stability of binary exponential backoff. Journal of the ACM (JACM), 35(3), 579–602. https://doi.org/10.1145/44483.44488

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free