Binary Exponential Backoff Is Stable for High Arrival Rates
- 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
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).
Unable to display preview. Download preview PDF.