An improved stability bound for binary exponential backoff

Theory of Computing Systems

Volumn 34, Issue 3, 2001, Pages 229-244

  Al Ammal, H ^a   Goldberg, L A ^b   MacKenzie, P ^c  

^a UNIVERSITY OF BAHRAIN   (Bahrain)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

ARRIVAL RATES; BINARY EXPONENTIAL BACKOFF; LOWER BOUNDS;

BINS;

EID: 0035590639     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-001-0005-y     Document Type: Article

References (13)

1. D. Aldous, Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels, IEEE Transactions on Information 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 University Press, Cambridge, 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, Journal of the ACM (to appear). Pre-print available at http://www.dcs.warwick. ac.uk/~leslie/pub.html. (Extends a paper by the first two authors in Proceedings of the Symposium on Foundations of Computer Science (IEEE), 1997, and a paper by the second two authors in Proceedings of the Symposium on Foundations of Computer Science (IEEE), 1995.)
5. L.A. Goldberg, P.D. MacKenzie, M. Paterson and A. Srinivasan, Contention resolution with constant expected delay, Journal of the ACM (to appear). Pre-print available at http://www.dcs.warwick. ac.uk/~leslie/pub.html. (Extends a paper by the first two authors in Proceedings of the Symposium on Foundations of Computer Science (IEEE), 1997, and a paper by the second two authors in Proceedings of the Symposium on Foundations of Computer Science (IEEE), 1995.)
6. L.A. Goldberg, P.D. MacKenzie, M. Paterson and A. Srinivasan, Contention resolution with constant expected delay, Journal of the ACM (to appear). Pre-print available at http://www.dcs.warwick. ac.uk/~leslie/pub.html. (Extends a paper by the first two authors in Proceedings of the Symposium on Foundations of Computer Science (IEEE), 1997, and a paper by the second two authors in Proceedings of the Symposium on Foundations of Computer Science (IEEE), 1995.)
7. J. Goodman, A.G. Greenberg, N. Madras and P. March, Stability of binary exponential backoff, Journal of the ACM, 35(3) (1988), 579-602.
8. G.R. Grimmet and D.R. Stirzaker, Probability and Random Processes, second edition. Oxford University Press, Oxford, 1992.
9. 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.
10. F.P. Kelly, Stochastic models of computer communication systems, Journal of the Royal Statistical Society, Series B, 47(3) (1985), 379-395.
11. 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.
12. R.M. Metcalfe and D.R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, 19 (1976), 395-404.
13. P. Raghavan and E. Upfal, Stochastic contention resolution with short delays, SIAM Journal on Computing, 28 (1999), 709-719.