Fairness in MIMD Congestion Control Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Fairness in MIMD Congestion Control Algorithms


We study fairness among sessions sharing a common bottleneck link, where one or more sessions use a multiplicative increase multiplicative decrease (MIMD) algorithm. Losses or congestion signals occur when the capacity is reached but could also be initiated before that. Both synchronized as well as non-synchronized losses are considered. In the non-synchronized case, only one session suffers a loss at a time. Two models are then considered to determine which source looses a packet: a rate dependent model in which the 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 synchronized and non-synchronized losses. We show that, in the presence of rate dependent losses, the capacity is fairly shared whereas rate independent losses provides high unfairness. We then study inter protocol fairness: how the capacity is shared in the presence of synchronized losses among sessions some of which use additive increase multiplicative decrease (AIMD) protocols whereas the others use MIMD protocols.
Fichier principal
Vignette du fichier
RR-5312.pdf (785.74 Ko) Télécharger le fichier

Dates and versions

inria-00070688 , version 1 (19-05-2006)


  • HAL Id : inria-00070688 , version 1


Eitan Altman, Konstantin Avrachenkov, Balakrishna Prabhu. Fairness in MIMD Congestion Control Algorithms. [Research Report] RR-5312, INRIA. 2004, pp.29. ⟨inria-00070688⟩
116 View
208 Download


Gmail Facebook Twitter LinkedIn More