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).
This work was partially supported by EPSRC grant GR/L6098
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Aldous, Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels, IEEE Trans. Inf. Theory IT-33(2) (1987) 219–233.
G. Fayolle, V.A. Malyshev and M.V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains, (Cambridge Univ. Press, 1995)
L.A. Goldberg and P.D. MacKenzie, Analysis of practical backoff protocols for contention resolution with multiple servers, Journal of Computer and Systems Sciences, 58 (1999) 232–258.
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.)
J. Goodman, A.G. Greenberg, N. Madras and P. March, Stability of binary exponential backoff, J. of the ACM, 35(3) (1988) 579–602.
J. Håstad, T. Leighton and B. Rogoff, Analysis of backoff protocols for multiple access channels, SIAM Journal on Computing 25(4) (1996) 740–774.
F.P. Kelly, Stochastic models of computer communication systems, J.R. Statist. Soc. B 47(3) (1985) 379–395.
F.P. Kelly and I.M. MacPhee, The number of packets transmitted by collision detect random access schemes, The Annals of Probability, 15(4) (1987) 1557–1568.
R.M. Metcalfe and D.R. Boggs, Ethernet: Distributed packet switching for local computer networks. Commun. ACM, 19 (1976) 395–404.
P. Raghavan and E. Upfal, Contention resolution with bounded delay, Proc. of the ACM Symposium on the Theory of Computing 24 (1995) 229–237.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-46541-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive