Fairness in Transfer Control Protocol for Congestion Control in Multiplicative Increase and Multiplicative Decrease
Sarika Agarwal, Parul Gupta, Mamta Narwaria · 2013
High speed Network(Scalable TCP) uses Multiplicative Increase Multiplicative Decrease (MIMD) algorithm . This paper investigates fairness among sessions sharing a common bottleneck link, where one or more sessions use the MIMD algorithm. Congestion occur when Traffic reached Beyond the capacity of window. We first study how two MIMD sessions share the capacity in the presence of generalcombinations of synchronous and asynchronous losses. We show that, in the presence of rate dependent losses, the capacity is fairly shared whereas rate independent losses provide high unfairness. Keyword:- MIMD, Scalable TCP, AIMD,CUBIC,WESTWOOD,Fairness