Binary Exponential Backoff Is Stable for High Arrival Rates
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.
- 2.G. Fayolle, V.A. Malyshev and M.V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains, (Cambridge Univ. Press, 1995)Google Scholar
- 4.L.A. Goldberg, P.D. MacKenzie, M. Paterson and A. Srinivasan, Contention resolution with constant expected delay, Pre-print (1999) available at http://www.dcs.warwick.ac.uk/~leslie/pub.html. (Extends a paper by the first two authors in Proc. of the Symposium on Foundations of Computer Science (IEEE) 1997 and a paper by the second two authors in Proc. of the Symposium on Foundations of Computer Science (IEEE) 1995.)
- 10.P. Raghavan and E. Upfal, Contention resolution with bounded delay, Proc. of the ACM Symposium on the Theory of Computing 24 (1995) 229–237.Google Scholar