Abstract
This paper investigates discrete random process describing behavior of the Additive Increase Multiplicative Decrease algorithm of networking Transmission Control Protocol (TCP). We use the sequence of TCP rounds with no data loss events to define the end-to-end path data loss behavior. The Markov chain embedded in the random process is described and the theorem on its ergodic property is proved. Further analysis yields the estimates of stationary first and second moments of the congestion window size which are key performance metrics of TCP protocol.
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
Allman, M., Paxon, V.: TCP Congestion Control. RFC 5681 (2009)
Floyd, S., Henderson, T.: The NewReno Modification to TCP’s Fast Recovery Algorithm. RFC 2582 (1999)
Ha, S., Rhee, I., Xu, L.: CUBIC: A New TCP-Friendly High-Speed TCP Variant. ACM SIGOPS Operating System Review (2008)
Baiocchi, A., Castellani, A.P., Vacirca, F.: Yeah-tcp: yet another highspeed tcp. In: 5th International Workshop on Protocols for Fast Long-Distance Networks (PFLDnet), March 2007
Leith, D.J., Shorten, R.N., McCullagh, G.: Experimental evaluation of cubic TCP. In: Proc. Protocols for Fast Long Distance Networks, Los Angeles (2007)
Afanasyev, A., Tilley, N., Reiher, P., Kleinrock, L.: Host-to-host congestion control for TCP. IEEE Communications Surveys & Tutorials, 12(3) (2010)
Mathis, M., Semke, J., Mahdavi, J., Ott, T.: The macroscopic behavior of the TCP congestion avoidance algorithm. ACM SIGCOMM Computer Communication Review 27(3), 67–82 (1997)
Bogoiavlenskaia, O.: Comparison of stepwise and piecewise linear models of congestion avoidance algorithm. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds.) NEW2AN/ruSMART 2014. LNCS, vol. 8638, pp. 609–618. Springer, Heidelberg (2014)
Brandt, A.: The Stochastic Equation \(Y_{n+1}=A_nY_n+B_n\) with stationary coefficients. Adv. Appl. Prob. 18, 211–220 (1986)
Gnedenko, B.V., Kovalenko, I.N.: Introduction to Queuing Theory. Radio i Sviaz, Moscow (1987)
Altman, E., Avrachenkov, K., Barakat, C.: A stochastic model of TCP/IP with stationary random losses. In: Proceedings of ACM SIGCOMM 2000, Stockholm, pp. 231-242 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bogoiavlenskaia, O. (2015). Discrete Model of TCP Congestion Control Algorithm with Round Dependent Loss Rate. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networks and Systems. ruSMART NEW2AN 2015 2015. Lecture Notes in Computer Science(), vol 9247. Springer, Cham. https://doi.org/10.1007/978-3-319-23126-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-23126-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23125-9
Online ISBN: 978-3-319-23126-6
eBook Packages: Computer ScienceComputer Science (R0)