Abstract
In this paper we analyze the performance of a TCP-like flow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a congestion notification (via loss detection in context of TCP) where the transmission rate is multiplicatively decreased. We introduce a general model based on a multi-state Markov chain for the moments at which the congestion is detected. With this model, we are able to account for correlation and burstiness in congestion moments. Furthermore, we specify several simple versions of our general model and then we identify their parameters from real TCP traces.
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
E. Altman, K.E. Avrachenkov, and C. Barakat, “TCP in presence of bursty losses”, to appear in Performance Evaluations. A shorter version appeared in the Proceedings of ACM SIGMETRICS, Santa Clara, California, Jun 2000.
E. Altman, K.E. Avrachenkov, and C. Barakat, “A stochastic model of TCP-IP with stationary ergodic random losses”, ACM SIGCOMM, Aug. 28 - Sept. 1, Stockholm, Sweden, 2000.
F. Baccelli and P. Bremaud, “Elements of queueing theory: Palm-Martingale calculus and stochastic recurrences”, Springer- Verlag, 1994.
A. Brandt, “The stochastic equation Y n+1 = A n Y n + B n with stationary coefficients”, Adv. Appl Prob., Vol. 18, pp. 211–220, 1986.
K. Fall and S. Floyd, “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP”, ACM Computer Communication Review, Jul 1996.
S. Floyd, M. Handley and J. Padhye, “Equation-based congestion control for unicast applications: the extended version”, ACM Sigcomm, Aug. 28 - Sept. 1, Stockholm, Sweden, 2000.
E.N. Gilbert, “Capacity of a burst-noise channel”, Bell Systems Technical Journal, Vol. 39, pp. 1253–1265, Sep 1960.
P. Glasserman and D.D. Yao, “Stochastic vector difference equations with stationary coefficients”, J. Appl. Prob., Vol. 32, pp. 851–866, 1995.
V. Jacobson, “Congestion avoidance and control”, ACM SIGCOMM, Aug 1988.
K.S. Meier-Hellstern, “A fitting algorithm for Markov-modulated Poisson processes having two arrival rates”, Euro. J. Oper. Res., Vol. 29, pp. 370–377, 1987.
M. Rahman, M. Bulmer and M. Wilkinson, “Error models for land mobile satellite channels”,Australian Telecommunication Research, Vol. 25 No 2, pp. 61–68, 1991.
W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms”,RFC 2001, Jan 1997.
B. Vucetic and J. Du, “Channel modeling and simulation in satellite mobile communication systems”, IEEE J. on Selected Areas in Communications, Vol. 10, No. 8, pp. 1209–1218, 1992.
J. Walrand, “An introduction to queueing networks”, Prentice Hall, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London Limited
About this paper
Cite this paper
Altman, E., Avrachenkov, K., Barakat, C., Dube, P. (2001). TCP over a multi-state Markovian path. In: Goto, K., Hasegawa, T., Takagi, H., Takahashi, Y. (eds) Performance and QoS of Next Generation Networking. Springer, London. https://doi.org/10.1007/978-1-4471-0705-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0705-7_6
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1183-2
Online ISBN: 978-1-4471-0705-7
eBook Packages: Springer Book Archive