Mathematical analysis of Westwood+TCP congestion control

TCP congestion control is based on an additive-increase/multiplicative-decrease (AIMD) probing paradigm aimed at adapting the sending rate of TCP data sources to match the Internet time-varying available bandwidth. Westwood+ TCP has been recently proposed to improve the tracking of available bandwidth of classic TCP. It is based on an end-to-end estimate of the available bandwidth, which is obtained by properly counting and filtering the stream of acknowledgement packets. The estimate is used to adaptively decrease the congestion window and slow start threshold after congestion so that it can be said that Westwood+ TCP substitutes the classic multiplicative decrease with an adaptive decrease paradigm. The authors propose a mathematical analysis of the additive-increase/adaptive-decrease (AIADD) paradigm to analyse the steady-state throughput provided by Westwood+ TCP and investigate the intra-protocol fairness of the AIADD paradigm and the inter-protocol friendliness between AIADD and AIMD algorithms. It is shown that (i) both classic and Westwood+ TCP provide a throughput that is proportional to 1/√p, where p is the segment drop probability, that is they are friendly to each other; and (ii) the throughput of Westwood+ TCP is proportional to 1/√RTT, where RTT is the round trip time, whereas the throughput of Reno TCP is proportional to 1/RTT, i.e. Westwood+ TCP improves the intra-protocol fairness. Finally, Ns-2 simulations are reported in order to validate the mathematical model in the presence of a wide range of network loads, loss probabilities and round trip times.

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

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

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

[4]  Donald F. Towsley,et al.  Analysis and design of controllers for AQM routers supporting TCP flows , 2002, IEEE Trans. Autom. Control..

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

[6]  Fernando Paganini,et al.  Fluid-flow analysis of TCP Westwood with RED , 2006, Comput. Networks.

[7]  Saverio Mascolo,et al.  Linux 2.4 implementation of Westwood+ TCP with rate-halving: a performance evaluation over the Internet , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

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

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

[11]  Saverio Mascolo,et al.  Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control , 2004, CCRV.

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

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

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

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

[16]  Saverio Mascolo.  Modeling the internet congestion controlas a time delay system: A robust stability analysis , 2003 .

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

[18]  TowsleyDon,et al.  Modeling TCP throughput , 1998 .

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

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