Portal de Periódicos da CAPES

Fairness in MIMD Congestion Control Algorithms

2005; Springer Science+Business Media; Volume: 30; Issue: 4 Linguagem: Inglês

10.1007/s11235-005-5498-2

1572-9451

Eitan Altman, Konstantin Avrachenkov, B.J. Prabhu,

Advanced Queuing Theory Analysis

The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness among sessions sharing a common bottleneck link, where one or more sessions use the MIMD algorithm. Losses, or congestion signals, occur when the capacity is reached but could also be initiated before that. Both synchronous as well as asynchronous losses are considered. In the asynchronous case, only one session suffers a loss at a loss instant. Two models are then considered to determine which source looses a packet: a rate dependent model in which the packet loss probability of a session is proportional to its rate at the congestion instant, and the independent loss rate model. We first study how two MIMD sessions share the capacity in the presence of general combinations 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. We then study inter protocol fairness: how the capacity is shared in the presence of synchronous losses among sessions some of which use Additive Increase Multiplicative Decrease (AIMD) protocols whereas the others use MIMD protocols.