Modeling the throughput of TCP Vegas

ABSTRACT

Previous analytic models of TCP Vegas throughput have been developed for loss-free (all-Vegas) networks. This work develops a simple and accurate analytic model for the throughput of a TCP Vegas bulk transfer in the presence of packet loss, as a function of average round trip time, minimum round trip time, and loss rate for the transfer. Similar models have previously been developed for TCP Reno. However, several aspects of TCP Vegas need to be treated differently than their counterparts in Reno. The proposed model captures the key innovative mechanisms that Vegas employs during slow start, congestion avoidance, and congestion recovery. The results include (1) a simple, validated model of TCP Vegas throughput that can be used for equation-based rate control of other flows such as UDP streams, (2) a simple formula to determine, from the measured packet loss rate, whether the network buffers are overcommitted and thus the TCP Vegas flow cannot reach the specified target lower threshold on throughput, (3) new insights into the design and performance of TCP Vegas, and (4) comparisons between TCP Vegas and TCP Reno including new insights regarding incremental deployment of TCP Vegas.

REFERENCES

• 1: Ns-2 simulator, http://www.isi.edu/nsnam/ns.
• 2: Jong Suk Ahn , Peter B. Danzig , Zhen Liu , Limin Yan, Evaluation of TCP Vegas: emulation and experiment, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.185-195, August 28-September 01, 1995, Cambridge, Massachusetts, United States
• 3: Mark Allman, A web server's view of the transport layer, ACM SIGCOMM Computer Communication Review, v.30 n.5, October 2000 [doi>10.1145/505672.505674]
• 4: T. Bonald. Comparison of TCP Reno and TCP Vegas via fluid approximation. Technical Report RR-3563, 1998.
• 5: C. Boutremans and J. Y. L. Boudec. A note on the fairness of TCP Vegas. In International Zurich Seminar on Broadband Communications, Zurich, Switzerland, February 2000.
• 6: Lawrence S. Brakmo , Sean W. O'Malley , Larry L. Peterson, TCP Vegas: new techniques for congestion detection and avoidance, Proceedings of the conference on Communications architectures, protocols and applications, p.24-35, August 31-September 02, 1994, London, United Kingdom
• 7: 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(8), 1995.
• 8: N. Cardwell, S. Savage, and T. Anderson. Modeling TCP latency. In INFOCOM 00, Tel Aviv, March 2000.
• 9: Sally Floyd , Mark Handley , Jitendra Padhye , Jörg Widmer, Equation-based congestion control for unicast applications, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, p.43-56, August 28-September 01, 2000, Stockholm, Sweden
• 10: S. Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582, 1999.
• 11: S. Floyd and E. Kohler. Interent reasearch needs better models. In Hotnets I, Princeton, NJ, October 2002.
• 12: M. Goyal, R. Guerin, and R. Rajan. Predicting TCP throughput from non-invasive network sampling. In INFOCOM 02, New York, NY, June 2002.
• 13: G. Hasegawa, M. Murata, and H. Miyahara. Fairness and stability of congestion control mechanisms. In Globecom, Rio de Janeiro, Brazil, December 1999.
• 14: U. Hengartner, J. Bolliger, and T. Gross. TCP Vegas revisited. In INFOCOM 00, Tel Aviv, March 2000.
• 15: Hao Jiang , Constantinos Dovrolis, Passive estimation of TCP round-trip times, ACM SIGCOMM Computer Communication Review, v.32 n.3, p.75-88, July 2002 [doi>10.1145/571697.571725]
• 16: S. Low. A duality model of TCP and queue management algorithms. In ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management 00, Monterey, CA, September 2000.
• 17: S. H. Low, F. Paganini, J. Wang, S. Adlakha, and J. C. Doyle. Dynamics of TCP/RED and a scalable control. In INFOCOM 02, New York, NY, June 2002.
• 18: Steven H. Low , Larry Peterson , Limin Wang, Understanding TCP vegas: a duality model, Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, p.226-235, June 2001, Cambridge, Massachusetts, United States
• 19: Matthew Mathis , Jeffrey Semke , Jamshid Mahdavi, The macroscopic behavior of the TCP congestion avoidance algorithm, ACM SIGCOMM Computer Communication Review, v.27 n.3, p.67-82, July 1997 [doi>10.1145/263932.264023]
• 20: V. Misra, W. Gong, and D. Towsley. Stochastic differential equation modeling and analysis of TCP-windowsize behavior. In Performance, Istanbul, Turkey, October 1999.
• 21: J. Mo, R. J. La, V. Anantharam, and J. C. Walrand. Analysis and comparison of TCP Reno and Vegas. In INFOCOM 99, New York, NY, March 1999.
• 22: Jitendra Padhye , Victor Firoiu , Don Towsley , Jim Kurose, Modeling TCP throughput: a simple model and its empirical validation, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, p.303-314, August 31-September 04, 1998, Vancouver, British Columbia, Canada
• 23: Milan VojnoviΕ , Jean-Yves Le Boudec, On the long-run behavior of equation-based rate control, Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, August 19-23, 2002, Pittsburgh, Pennsylvania, USA

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

General Terms:
Design, Experimentation, Performance

Keywords:
TCP, TCP Vegas, performance model, throughput