A mathematical model for the steady state throughput of the Westwood TCP congestion control algorithm

The success of the Internet has been in large part due to the end-to-end design principle of the TCP/IP. Moreover, it is widely recognized that the additive increase multiplicative decrease paradigm (AIMD), implemented by the standard Reno TCP algorithm, is at the core of the Internet stability. Westwood TCP introduces the Additive Increase Adaptive Decrease (AIAD) paradigm for the Internet congestion control. This paper proposes a mathematical model for the steady state Westwood TCP throughput. The model aims at evaluating Westwood TCP stability, fairness and friendliness to Reno TCP. Moreover, simulation results are reported to confirm the theoretical analysis.