Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control

TCP congestion control has been designed to ensure Internet stability along with fair and efficient allocation of the network bandwidth. During the last decade, many congestion control algorithms have been proposed to improve the classic Tahoe/Reno TCP congestion control. This paper aims at evaluating and comparing three control algorithms, which are Westwood+, New Reno and Vegas TCP, using both Ns-2 simulations and live Internet measurements. Simulation scenarios are carefully designed in order to investigate goodput, fairness and friendliness provided by each of the algorithms. Results show that Westwood+ TCP is friendly towards New Reno TCP and improves fairness in bandwidth allocation whereas Vegas TCP is fair but it is not able to grab its bandwidth share when coexisting with Reno or in the presence of reverse traffic because of its RTT-based congestion detection mechanism. Finally results show that Westwood+ remarkably improves utilization of wireless links that are affected by losses not due to congestion.

[1]  Saverio Mascolo,et al.  Additive increase early adaptive decrease mechanism for TCP congestion control , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[2]  Luigi Rizzo,et al.  Dummynet: a simple approach to the evaluation of network protocols , 1997, CCRV.

[3]  Sally Floyd,et al.  On inferring TCP behavior , 2001, SIGCOMM.

[4]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.

[5]  Ian F. Akyildiz,et al.  TCP-Peach: a new congestion control scheme for satellite IP networks , 2001, TNET.

[6]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[7]  Rajesh Krishnan,et al.  Explicit transport error notification (ETEN) for error-prone wireless and satellite networks , 2004, Comput. Networks.

[8]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[9]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM.

[10]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[11]  Janey C. Hoe.  Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM '96.

[12]  Saverio Mascolo,et al.  Congestion control in high-speed communication networks using the Smith principle , 1999, Autom..

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

[14]  Mats Björkman,et al.  A new end-to-end probing and analysis method for estimating bandwidth bottlenecks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[15]  Mario Gerla,et al.  TCP Westwood: End-to-end Bandwidth Estimation for Efficient Transport over Wired and Wireless Networks , 2001 .

[16]  Ren Wang,et al.  TCP westwood: Bandwidth estimation for enhanced transport over wireless links , 2001, MobiCom '01.

[17]  Manish Jain,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2003, TNET.

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

[19]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[20]  Frank Kelly,et al.  Mathematical modeling of the Internet , 1999 .

[21]  S. Jørgensen.  The art of computer systems performance analysis: Techniques for Experimental Design, Measurement, Simulation and Modeling. Raj Jain. John Wiley, New York. Hardcover, 720 p. U.S. $52.95. , 1992 .

[22]  Saverio Mascolo,et al.  TCP Westwood and Easy RED to Improve Fairness in High-Speed Networks , 2002, Protocols for High-Speed Networks.

[23]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[24]  Sally Floyd,et al.  Increasing TCP's Initial Window , 1998, RFC.

[25]  George A. Perdikaris.  Computer Controlled Systems , 1991 .

[26]  Sally Floyd,et al.  On inferring TCP behavior , 2001, SIGCOMM 2001.

[27]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[28]  Saverio Mascolo,et al.  End-to-End Bandwidth Estimation for Congestion Control in Packet Networks , 2003, QoS-IP.

[29]  Astrom.  Computer Controlled Systems , 1990 .

[30]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[31]  Mark Allman,et al.  On the effective evaluation of TCP , 1999, CCRV.

[32]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

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

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

[35]  Eitan Altman,et al.  Bandwidth tradeoff between TCP and link-level FEC , 2002, Comput. Networks.

[36]  Robert Tappan Morris,et al.  TCP behavior with many flows , 1997, Proceedings 1997 International Conference on Network Protocols.

[37]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[38]  T. V. Lakshman,et al.  TCP over wireless with link level error control: analysis and design methodology , 1999, TNET.

[39]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[40]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.