Binary Exponential Backoff Is Stable for High Arrival Rates

  • Hesham Al-Ammal
  • Leslie Ann Goldberg
  • Phil MacKenzie
Conference paper

DOI: 10.1007/3-540-46541-3_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Al-Ammal H., Goldberg L.A., MacKenzie P. (2000) Binary Exponential Backoff Is Stable for High Arrival Rates. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Hesham Al-Ammal
    • 1
  • Leslie Ann Goldberg
    • 2
  • Phil MacKenzie
    • 2
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK
  2. 2.Information Sciences Center, Bell LaboratoriesLucent TechnologiesMurray Hill

Personalised recommendations