Analysis of scalable TCP in the presence of Markovian losses
Eitan Altman, Konstantin E. Avrachenkov, Arzad Alam Kherani, Balakrishna Prabhu · 2005
In high speed networks, the standard TCP's AIMD algorithm was observed to be inefficient in utilizing the link capacity. As a result of which several proposals such as High-Speed TCP, FAST and Scalable TCP, were put forward. In contrast to the additive increase multiplicative decrease algorithm used in the standard TCP, Scalable TCP uses a multiplicative increase multiplicative decrease (MIMD) algorithm for the window size evolution. In this paper, we first present an approximate expression for the throughput of a long lasting Scalable TCP session when the losses are i.i.d. and due to window dependent errors. We then present an analysis when the losses are due to Markovian window independent errors. We compare our analytical results with ns-2 simulations.