HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Fairness in MIMD Congestion Control Algorithms

Abstract : 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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:12:55 PM
Last modification on : Thursday, January 20, 2022 - 4:12:22 PM
Long-term archiving on: : Sunday, April 4, 2010 - 9:43:28 PM


  • 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⟩



Record views


Files downloads