Fairness in MIMD congestion control algorithms

E. Altman, K.E. Avrachenkov, Balakrishna Prabhu

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    26 Citations (Scopus)

    Abstract

    The multiplicative 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.
    Original languageEnglish
    Title of host publicationProceedings IEEE Infocom 2005
    Place of PublicationPiscataway
    PublisherInstitute of Electrical and Electronics Engineers
    Pages1350-1361
    Number of pages12
    ISBN (Print)0-7803-8968-9
    DOIs
    Publication statusPublished - 2005
    Event24th Annual Joint Conference of the IEEE Computer and Communications Societies - Miami, United States
    Duration: 13 Mar 200517 Mar 2005

    Conference

    Conference24th Annual Joint Conference of the IEEE Computer and Communications Societies
    Country/TerritoryUnited States
    CityMiami
    Period13/03/0517/03/05

    Fingerprint

    Dive into the research topics of 'Fairness in MIMD congestion control algorithms'. Together they form a unique fingerprint.

    Cite this