Modeling the Stationary Behavior of TCP Reno Connections

  • Claudio Casetti
  • Michela Meo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1989)


In this paper, we outline a methodology that can be applied to model the behavior of TCP Reno flows. The proposed methodology stems from a Markovian model of a single TCP source, and eventually considers the superposition and interaction of several such sources using standard queueing analysis techniques. Our approach allows the evaluation of such performance indices as throughput, queueing delay and segment loss of TCP flows. The results obtained through our model are validated by means of simulation, under different traffic settings.


Window Size Propagation Delay Round Trip Time Congestion Window Slow Start 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Altman, F. Boccara, J.C. Bolot, F. Nain, P Brown, D. Collange, and C. Fenzy. Analysis of the TCP/IP Flow Control Mechanism in High-Speed Wide-Area Networks. In 34th IEEE Conference on Decision and Control, pages 368–373, New Orleans, Louisiana, USA, December 1995.Google Scholar
  2. 2.
    C. Casetti and M. Meo. A New Approach to Model the Stationary Behavior of TCP Connections. In Proceedings of IEEE INFOCOM’2000, Tel Aviv, Israel, March 2000.Google Scholar
  3. 3.
    K. Fall, and S. Floyd. Simulation-based Comparisons of Tahoe, Reno, and SACK TCP. ACM Computer Communications Review, 26(3):5–21, July 1996.CrossRefGoogle Scholar
  4. 4.
    W. Grassman, M. Taksar, and D. Heyman. Regenerative Analysis and Steady State Distribution for Markov Chains. Operation Research, 33(5):1107–1116, 1985.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    A. Kumar. Comparative Performance Analysis of Versions of TCP in a Local Network with a Lossy Link. IEEE/ACM Transactions on Networking, 6(4):485–498, August 1998.CrossRefGoogle Scholar
  6. 6.
    T.V. Lakshman and U. Madhow. The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss. IEEE/ACM Transactions on Networking, 3(3):336–350, June 1997.CrossRefGoogle Scholar
  7. 7.
    M. Mathis, J. Semke, J. Mahdavi, and T. Ott. The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. ACM Computer Communication Review, 27(3):67–82, July 1997.CrossRefGoogle Scholar
  8. 8.
    J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP Throughput: A Simple Model and its Empirical Validation. Proceedings of the ACM SIGCOMM’98-ACM Computer Communication Review, 28(4):303–314, September 1998.Google Scholar
  9. 9.
    V. Paxson. Empirically-Derived Analytic Models of Wide-Area TCP Connections. IEEE/ACM Transactions on Networking, 2(4):316–336, August 1994.CrossRefGoogle Scholar
  10. 10.
    V. Paxson and S. Floyd. Wide-Area Traffic: The Failure of Poisson Modeling. ACM Computer Communications Review, 24(4):257–268, October 1994.CrossRefGoogle Scholar
  11. 11.
    W.R. Stevens. TCP/IP Illustrated, vol. 1. Addison Wesley, Reading, MA, USA, 1994.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Claudio Casetti
    • 1
  • Michela Meo
    • 1
  1. 1.Dipartimento di ElettronicaPolitecnico di TorinoTorinoItaly

Personalised recommendations