TCP Westwood: congestion control with faster recovery

In this paper we propose a new version of the TCP protocol, called TCP Westwood, which enhances the performance of TCP window congestion control by using as feedback the end-to-end measurement of the bandwidth available along a TCP connection. The available bandwidth is estimated at the TCP source by measuring and low-pass filtering the returning rate of acknowledgments. The estimated bandwidth is then used to properly set the congestion window and the slow start threshold after a congestion episode, that is after a timeout or 3 duplicate acknowledgments. The rationale of this strategy is simple: TCP Westwood sets a slow start threshold and a congestion window which are consistent with the network capacity measured at the time congestion is experienced. In particular, TCP Westwood introduces a mechanism of faster recovery to avoid overly conservative reduction of the congestion window after a congestion episode by taking into account the end-to-end estimation of available bandwidth. The advantage of the proposed mechanism is that the TCP sender recovers faster after losses especially over connections with large round trip times, or running over wireless links where sporadic losses are due to unreliable links rather than congestion. The proposed modifications follow the end-to-end design principle of TCP. They require only slight modifications at the sender side and are backward-compatible. Simulation results show a considerable throughput increment in comparison with TCP Reno and TCP SACK over wired networks and even more over wireless networks.

[1]  Saverio Mascolo,et al.  TCP with faster recovery , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

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

[3]  Vipul Gupta,et al.  Freeze-TCP: a true end-to-end TCP enhancement mechanism for mobile environments , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Thomas Bonald,et al.  Comparison of TCP Reno and TCP Vegas: Efficiency and Fairness , 1999, Perform. Evaluation.

[5]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[6]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

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

[8]  Mario Gerla,et al.  Generalized window advertising for TCP congestion control , 2002, Eur. Trans. Telecommun..

[9]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[10]  K. K. Ramakrishnan,et al.  Explicit window adaptation: a method to enhance TCP performance , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[12]  Thomas R. Gross,et al.  TCP Vegas revisited , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).