A simple TCP throughput model and analytic characterization of fairness

In this paper, we develop a simple and accurate stochastic model for the steady-state throughput of a TCP bulk data transfer as a function of round-trip time, loss event rate and burstiness of loss. Our model generalizes the TCP window adaptation policy and provides the analytical characterization of the fast recovery algorithm. We validated our model by conducting a large number of simulations using the ns-2 simulator. The proposed model can accurately predict the steady-state TCP NewReno throughput for a wide range of network conditions. Based on the model, we analytically determine the Jainpsilas fainess index for multiple concurrent flows passing through the same bottleneck.