Binary exponential backoff is stable for high arrival rates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 169-180

  Al Ammal, Hesham ^a   Goldberg, Leslie Ann ^a   MacKenzie, Phil ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ARRIVAL RATES; BINARY EXPONENTIAL BACKOFF; LOWER BOUNDS;

ARTIFICIAL INTELLIGENCE;

EID: 73449149084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_14     Document Type: Conference Paper

References (10)

1. 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.
2. G. Fayolle, V.A. Malyshev and M.V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains, (Cambridge Univ. Press, 1995)
3. 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.
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.)
5. J. Goodman, A.G. Greenberg, N. Madras and P. March, Stability of binary exponential backoff, J. of the ACM, 35(3) (1988) 579-602.
6. 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.
7. F.P. Kelly, Stochastic models of computer communication systems, J.R. Statist. Soc. B 47(3) (1985) 379-395.
8. 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.
9. R.M. Metcalfe and D.R. Boggs, Ethernet: Distributed packet switching for local computer networks. Commun. ACM, 19 (1976) 395-404.
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.