Skip to main content
SpringerLink
Log in

Analysis of TCP Vegas and TCP Reno

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper we use an analytic fluid approach in order to analyze the different features of both Vegas and Reno TCP versions. We then use simulations to confirm our analytic results. When the available bandwidth is high, indeed Vegas can retransmit less than one‐fifth as much data as Reno does, so that the higher the available bandwidth is, the more efficient Vegas is. However, under heavy congestion Vegas behaves like Reno and does not manage to make efficient use of its new mechanism for congestion detection. The analytic results that we obtain are the evolution of the window size, round trip times and their averages, and the average throughput.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.S. Ahn, P.B. Danzig, Z. Liu and L. Yan, Experience with TCP Vegas: Emulation and experiment, in: Proc. of SIGCOMM'95 Symposium, August 1995.

  2. O. Ait-Hellal and E. Altman, Problems in TCP Vegas and TCP Reno, in: DNAC (De Nouvelles Architectures pour les Communications), UVSQ, Paris, 3–5 December 1996.

  3. E. Altman, F. Boccara, J. Bolot, P. Nain, P. Brown, D. Collange and C. Fenzy, Analysis of TCP/IP flow control mechanism in hight-speed wide-area networks, in: IEEE Conf. on Decision and Control, New Orleans, December 1995.

  4. L.S. Brakmo, TCP Vegas Release 0.8, November 1994; available from ftp://ftp.cs. arizona.edu/xkernel/new-protocols/Vegas.Tar.Z.

  5. L.S. Brakmo and L.L. Peterson, TCP Vegas: End to end congestion avoidance on a global Internet, IEEE Journal on Selected Areas in Communications 13 (1995) 1465–1480.

    Article  Google Scholar 

  6. S. Floyd, TCP and successive fast retransmits, Technical report, Lawrence Berkeley Laboratory, February 24, 1995; available from anonymous ftp from ftp.ee.lbl.gov/papers/ fastrans.ps.

  7. V. Jacobson, Congestion avoidance and control, in: ACM SIGCOMM 88, pp. 273–288.

  8. V. Jacobson, Modified TCP congestion avoidance algorithm, mailling list end2end-interest, received on Monday, 30 April 1990.

  9. V. Jacobson, L. Peterson, L. Brakmo and S. Floyd, Problems with Arizona's Vegas, mailing list end2end-tf (discussion on TCP Vegas), 1994.

  10. S. Keshav, REAL: A network simulator, Technical report 88/472, Department of Computer Science, UC Berkeley (1988).

    Google Scholar 

  11. T.V. Lakshman and U. Madhow, Performance analysis of window-based flow control using TCP/IP: The effect of high bandwidth-delay products and random loss, in: IFIP Transactions C-26, High Performance Networking (North-Holland, Amsterdam, 1994) pp. 135–150.

    Google Scholar 

  12. T.V. Lakshman, U. Madhow and B. Suter, Window-based error recovery and flow control with a slow acknowledgment channel: A study of TCP/IP performance, submitted for publication.

  13. W. Richard Stevens, TCP/IP Illustrated, Vol. 1 (Addison-Wesley, Reading, MA, 1994).

    Google Scholar 

Download references

Authors
  1. Omar Ait‐Hellal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eitan Altman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ait‐Hellal, O., Altman, E. Analysis of TCP Vegas and TCP Reno. Telecommunication Systems 15, 381–404 (2000). https://doi.org/10.1023/A:1019159332202

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019159332202

Keywords

Search

Navigation