论文信息 - TCP Vegas: new techniques for congestion detection and avoidance

TCP Vegas: new techniques for congestion detection and avoidance

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] Srinivasan Keshav,et al. REAL: A Network Simulator , 1988 .

[2] V. Jacobson,et al. Congestion avoidance and control , 1988, SIGCOMM '88.

[3] Van Jacobson,et al. TCP extensions for long-delay paths , 1988, RFC.

[4] Raj Jain,et al. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[5] Raj Jain,et al. A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

[6] Jon Crowcroft,et al. A new congestion control scheme: slow start and search (Tri-S) , 1991, CCRV.

[7] Srinivasan Keshav,et al. A control-theoretic approach to flow control , 1991, SIGCOMM '91.

[8] S. Shenker,et al. Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[9] Larry L. Peterson,et al. The x-Kernel: An Architecture for Implementing Network Protocols , 1991, IEEE Trans. Software Eng..

[10] Raj Jain,et al. The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[11] Jeffrey C. Mogul,et al. Observing TCP dynamics in real networks , 1992, SIGCOMM '92.

[12] Jon Crowcroft,et al. Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm , 1992, CCRV.