Abstract
In this paper, we analyze backoff protocols, such as Ethernet. We examine a general backoff function (GBF) rather than just the binary exponential backoff (BEB) used by Ethernet. Under some mild assumptions we find stability and optimality conditions for a wide class of backoff protocols with GBF. In particular, it is proved that the maximal throughput rate over the class of backoff protocols with N stations is \(\left(1-\frac1N\right)^{\frac1{N-1}}\) and the optimal average service time for any station is \(E S = N/\left(1-\frac1N\right)^{\frac1{N-1}}\) or about Ne for large N. The reasons of the instability of the BEB protocol (for a big enough input rate) is explained.
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
Aldous, D.J.: Ultimate Instability of Exponential Back-Off Protocol for Acknowledgement-Based Transmission Control of Random Access Communication Channel. IEEE Trans. on Information Theory, IT 33(2), 219–223 (1987)
Abramson, N.: The ALOHA system-another alternative for computer communications. AFIPS 37, 281–285 (1970)
Abramson, N.: Development of the ALOHANE. IEEE Trans. on Inform. Theory 31(2), 119–123 (1985)
Kwak, B., Song, N., Miller, L.E.: Performance analysis of exponential backoff. IEEE/ACM Trans. Netw. 13(2), 343–355 (2005)
Bianchi, G.: Performance Analysis of the IEEE 802.11 Distributed Coordination Function. IEEE J. on Sel. Areas in Commun. 18(3), 535–547 (2000)
Håstad, J., Leighton, T., Rogoff, B.: Analysis of backoff protocols for multiple access channel. SIAM J. Comput. 25(4), 740–774 (1996)
Metcalfe, R., Boggs, D.: Ethernet: Distributed Packet Switching for Local Computer Networks
Kelly, F.P.: Stochastic models of computer communication systems. J. Roy. Statist. Soc. B 47, 379–395 (1985)
Kelly, F.P., MacPhee, I.M.: The number of packets transmitted by collision detect random access scheme. Annals of Prob. 15, 1557–1568 (1987)
Goodman, J., Greenberg, A.G., Madras, N., March, P.: Stability of binary exponential backoff. J. of the ACM 35(3), 579–602 (1988)
Fayolle, G., Flajolet, P., Hofri, M.: On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel. Adv. Appl. Prob. 18, 441–472 (1986)
Rosenkrantz, W.A.: Some theorems on the instability of the exponential back-off protocol. Performance 1984, 199–205 (1985)
Goldberg, L.A., MacKenzie, P.: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. of Comp. and System Sciences 58, 232–258 (1999)
Goldberg, L.A., MacKenzie, P., Paterson, M., Srinivasan, A.: Contention Resolution with Constant Expected Delay. Journal of the ACM (JACM) 47(6), 1048–1096 (2000)
Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, London (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lukyanenko, A. (2007). On the Optimality and the Stability of Backoff Protocols. In: Koucheryavy, Y., Harju, J., Sayenko, A. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2007. Lecture Notes in Computer Science, vol 4712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74833-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-74833-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74832-8
Online ISBN: 978-3-540-74833-5
eBook Packages: Computer ScienceComputer Science (R0)