Stability of binary exponential backoff

  • Authors:
  • Jonathan Goodman;Albert G. Greenberg;Neal Madras;Peter March

  • Affiliations:
  • Courant Institute of Mathematical Sciences, New York, NY;AT&T Bell Labs, Murray Hill, NJ;Univ. of Toronto, Toronto, Ont., Canada;McGill Univ., Montreal, Canada

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

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.