Abstract
Consideration was given to a queuing system that models interaction of two basic algorithms of the TCP protocol. Within the framework of analysis of this system, semi-Markov process of the unified data transmission rate was constructed, recurrent analytical representation of the stationary distribution of a Markov chain embedded in this process was determined, and stationary distribution of the original semi-Markov process was obtained. In view of high complexity of the analytical representation of the stationary distribution, an exact numerical linear-complexity algorithm was constructed enabling one to calculate some important characteristics of the initial protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chiu, D.M. and Jain, R., Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks, Comput. Networ. ISDN Syst., 1989, vol. 17, pp. 1–14.
Dumas, V., Guillemin, F., and Robert, P., A Markovian Analysis of AIMD Algorithms, Adv. Appl. Probab., 2002, vol. 34(1), pp. 85–111.
Floyd, S. and Fall, F., Promoting the Use of End-To-End Congestion Control in the Internet, IEEE/ACM Trans. Network., 1999, vol. 7(4), pp. 458–472.
Padhey, J., Firoiu, V., Towsley, D., and Kurose, J., Modeling TCP Throughput: A Simple Model and its Empirical Validation, IEEE/ACM Trans. Network., 2002, vol. 8(2), pp. 133–145.
Bogoyavlenskaya, O.Yu., Analysis of a Random Flow Generated by a Feedbacked Transport Protocol in the Data Transmission Network, Avtom. Telemekh., 2003, no. 12, pp. 60–68.
Altman, E., Avrachenkov, K., and Barakat, C., A Stochastic Model of TCP/IP with Stationary Random Losses, IEEE/ACM Trans. Network, 2005, vol. 13(2), pp. 356–368.
Adjih, C., Jacquet, P., and Vvedenskaya, N., Performance Evaluation of Multiple TCP Flows: An Analytical Approach, in Rapport de recherche no. 5417, INRIA, 2004.
Baccelli, F., McDonald, D.R., and Reynier, J., A Mean-field Model for Multiple TCP Connections Through a Buffer Implementing RED, Performance Evaluat., 2002, vol. 49(4), pp. 77–97.
Kang, W., Kelly, F.P., Lee, N.H., and Williams, R.J., Fluid and Brownian Approximations for an Internet Congestion Control Model, in Proc. 43rd IEEE Conf. Decision Control, Atlantis, 2004, pp. 3938–3943.
Baccelli, F. and Hong, D., TCP is Max-Plus Linear and What it Tells us on its Throughput, in Proc. ACM SIGCOMM, Stockholm, 2000, pp. 219–230.
Sikdar, V., Kalyanaraman, S., and Vastola, K.S., An Integrated Model for the Latency dnd Steady-state Throughput of TCP Connections, Performance Evaluat., 2001, vol. 46, pp. 139–154.
Allman, M., Paxon, V., and Stevens, W., TCP Congestion Control, RFC2581.
Gnedenko, B.V. and Kovalenko, I.N., Vvedenie v teoriyu massovogo obsluzhivaniya (An Introduction to the Queuing Theory), Moscow: Radio i Svyaz’, 1987.
Author information
Authors and Affiliations
Additional information
Original Russian Text © O.Yu. Bogoyavlenskaya, 2009, published in Avtomatika i Telemekhanika, 2009, No. 1, pp. 119–129.
The level of losses is estimated in the units of data segments generated by the protocol. The most typical segment in Internet is 0.5 Db. At that, the hardware losses may remain at a very low level accepted in the stationary data transmission networks.
Rights and permissions
About this article
Cite this article
Bogoyavlenskaya, O.Y. Probabilistic model of the algorithms of distributed control protocol in the internet network. Autom Remote Control 70, 107–117 (2009). https://doi.org/10.1134/S0005117909010081
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117909010081