A Markov model of TCP throughput, goodput and slow start

Performance Evaluation

Volumn 58, Issue 2-3, 2004, Pages 89-108

  Fortin Parisi, Sophie ^a   Sericola, Bruno ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Congestion control; Markov chain; Slow start; TCP; Throughput

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; DISCRETE TIME CONTROL SYSTEMS; ELECTRONIC MAIL; INTERNET; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; RELIABILITY; ROUTERS; THROUGHPUT;

CONGESTION AVOIDANCE PHASES; REMOTE ACCESS; SLOW START;

HTTP;

EID: 4644255582     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2004.07.016     Document Type: Conference Paper

References (21)

1. A.A. Abou-zeid, M. Azizoglu, S. Roy, Stochastic modeling of a single TCP/IP session over a random loss channel, in: Proceedings of the DIMACS Workshop on Mobile Networks and Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 52, American Mathematical Society, Providence, RI, 1999.
2. A.A. Abou-zeid, S. Roy, M. Azizoglu, Stochastic modeling of TCP over lossy links, in: Proceedings of INFOCOM 2000, Tel-Aviv, Israel, March, 2000.
3. O. Ait-Hellal, E. Altman, D. Elouadghiri, M. Erramdani, N. Mikou, Performance of TCP/IP: the case of two controlled sources, in: Proceedings of the ICCC'97, Cannes, France, 1997.
4. E. Altman, C. Barakat, K. Avrachenkov, A stochastic model of TCP/IP with stationary ergodic random losses, in: Proceedings of ACM-SIGCOMM 2000, Stockholm, Sweden, August 2000.
5. E. Altman, C. Barakat, K. Avrachenkov, P. Dube, CP in presence of bursty losses, International Conference on Performance and QoS of Next Generation Networks, P&Q Net 2000. Nagoya, Japan, November 2000.
6. E. Altman, J. Bolot, P. Nain, D. Elouadghiri, M. Erramdani, P. Brown, D. Collange, Performance modeling of TCP/IP in wide-area network, Technical Report RR-3142, INRIA, 1997.
7. F. Baccelli, D. Hong, TCP is max-plus linear, ACM-SIGCOMM Computer Communication Review 30 (4) (2000) 219-230.
8. P. Brown, Resource sharing of TCP connections with different round trip times, in: Proceedings of INFOCOM 2000, Tel-Aviv, Israel, March, 2000.
9. N. Cardwell, S. Savage, T. Anderson, Modeling TCP latency, in: Proceedings of INFOCOM 2000, Tel-Aviv, Israel, March, 2000.
10. D. Comer, Internetworking with TCP/IP, Volume 1: Principles, Protocols and Architecture, third ed., Prentice-Hall, Engle-
11. wood Cliffs, NJ, 1995.
12. P. Hurley, J.Y. Le Boudec, P. Thiran, A note on the fairness of additive increase and multiplicative decrease, in: Proceedings of ITC-16, Edinburgh, Scotland, June, 1999.
13. A. Kumar, Comparative performance analysis of versions of TCP in a local networks with a lossy link, IEEE/ACM Trans. Networking 6 (4) (1998) 485-498.
14. T.V. Lakshman, U. Madhow, The performance of TCP/IP for networks with high bandwidth-delay products and random loss, IEEE/ACM Trans. Networking 5 (3) (1997) 336-350.
15. M. Mathis, J. Semke, J. Mahdavi, T. Ott, The macroscopic behavior of the TCP congestion avoidance algorithm, Comput. Commun. Rev. 27 (3) (1997) 67-82.
16. V. Misra, W.B. Gong, D. Towsley, Stochastic differential equation modeling and analysis of TCP-window size behavior, in: Proceedings of the Performance'99, Istanbul, Turkey, 1999.
17. J. Padhye, V. Firoiu, D. Towsley, A stochastic model of TCP Reno congestion avoidance and control, Technical Report 99-02, University of Massachussets, 1999.
18. J. Padhye, V. Firoiu, D. Towsley, J. Kurose, Modeling TCP throughput: a simple model and its empirical validation, in: Proceedings of the ACM-SIGCOMM'98, Vancouver, Canada, September, 1998.
19. G. Rubino, B. Sericola, Sojourn times in Markov processes, J. Appl. Probability 26 (1989) 744-756.
20. W.R. Stevens, TCP/IP Illustrated: Vol. 1 The Protocols, Addison-Wesley, Reading, MA, 1994.
21. W.R. Stevens, TCP slow start congestion avoidance fast retransmit and fast recovery algorithms, RFC 2001, January 1997.