Fairness in MIMD congestion control algorithms

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 ...

• Type: Conference
• Year: 2005
• Where: INFOCOM
• Authors: Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu
• Keywords: Asynchronous Losses, Communications, Increase Multiplicative Decrease, INFOCOM 2005, Rate Dependent Losses