Lawrence S. Brakmo
ABSTRACT
Vegas is a new implementation of TCP that achieves between 40 and 70% better throughput, with one-fifth to one-half the losses, as compared to the implementation of TCP in the Reno distribution of BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, and presents the results of a comprehensive experimental performance study—using both simulations and measurements on the Internet—of the Vegas and Reno implementations of TCP.
- 1.P. Danzig and S. Jamin. tcplib: A Library of TCP Internetwork Traffic Characteristics. Technical Report CS-SYS-91-495, Computer Science Department, USC, 1991.]]Google Scholar
- 2.A. Heybey. The network simulator. Technical report, MIT, Sept. 1990.]]Google Scholar
- 3.N. C. Hutchinson and L. L. Peterson. The x-kernel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering, 17(1):64-76, Jan. 1991.]] Google ScholarDigital Library
- 4.V. Jacobson. Congestion Avoidance and Control. In Proceedings of the SIGCOMM '88 Symposium, pages 314-32, Aug. 1988.]] Google ScholarDigital Library
- 5.V. Jacobson and R. Braden. TCP Extensions for Long- Delay Paths. Request for Comments 1072, Oct. 1988.]] Google ScholarDigital Library
- 6.V. Jacobson, R. Braden, and D. Borman. TCP Extensions for High Performance. Request for Comments 1323, May 1992.]] Google ScholarDigital Library
- 7.R. Jain. A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks. A CM Computer Communication Review, 19(5):56-71, Oct. 1989.]] Google ScholarDigital Library
- 8.R. Jain. The Art of Computer Systems Performance Analysis: Techniques for ExperimentaIDesign, Measurement, Simulation and Modeling. John Wiley and Sons, Inc., New York, 1991.]]Google Scholar
- 9.S. Keshav. REAL: A Network Simulator. Technical Report 88/472, Department of Computer Science, UC Berkeley, 1988.]] Google ScholarDigital Library
- 10.Z. Wang and J. Crowcroft. A New Congestion Control Scheme: Slow Start and Search (Tri-S). ACM Computer Communication Review, 21 (1):32-43, Jan. 1991.]] Google ScholarDigital Library
- 11.Z. Wang and J. Crowcroft. Eliminating Periodic Packet Losses in 4.3-Tahoe BSD TCP Congestion Control Algorithm. ACM Computer Communication Review, 22(2):9-16, Apr. 1992.]] Google ScholarDigital Library
- 12.L. Zhang, S. Shenker, and D. D. Clark. Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic. In Proceedings of the SIGCOMM '91 Symposium, pages 133-147, Sept. 1991.]] Google ScholarDigital Library
Index Terms
- TCP Vegas: new techniques for congestion detection and avoidance
Recommendations
Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno network scenario
Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of network ...
Modeling throughput in TCP vegas
This abstract describes a simple and accurate analytic model for the steady state throughput of TCP Vegas, as a function of round trip time and packet loss rate. Such models have previously been developed for TCP Reno. However, several aspects of TCP ...
TCP Vegas: end to end congestion avoidance on a global Internet
Vegas is an implementation of TCP that achieves between 37 and 71% better throughput on the Internet, with one-fifth to one-half the losses, as compared to the implementation of TCP in the Reno distribution of BSD Unix. This paper motivates and ...
Comments