Complementary analysis and numerical results for an elementary fluid flow model of TCP
Esa Hyytiä, E. Austreim, Peder J. Emstad · 2006
The congestion control algorithm used in Transmission Control Protocol (TCP) is a so-called additive increase multiplicative decrease (AIMD) algorithm. The algorithm and its performance have been studied extensively in the literature. Today, several versions of the TCP exist, which behave slightly differently when congestion occurs. However, for the analytical work it is often necessary to consider idealized models. One such model based on fluid flow approach is proposed [1], on which we will also focus in this paper. In particular, we study this simplified fluid flow approximation and its generalization by numerical simulations in order to evaluate relationships between different parameters of the model and the resulting performance quantities. Moreover, we also compare the model against an actual implementation of TCP congestion control mechanism. Additionally, we give some complementary analytical results for the model.