Stochastic modelling of congestion control algorithms

S. Ravi Jagannathan, Kenan M. Matawie, Andrew R. Francis, Kenan M. Matawie, Alicia Oshlack

    Research output: Chapter in Book / Conference PaperConference Paper

    Abstract

    ![CDATA[Consider an Internet traffic source sending packets into a single link connected to (an)other source(s). The source's "window" is the maximum number of packets discharged without waiting for acknowledgement, at any point in time. Such a window concept is the cornerstone of a number of congestion control algorithms, such as Tahoe, Reno, NewReno, Vegas and Sierra (partly rate-based). All these are briefly treated. We then develop quantitative (deterministic and probabilistic) models for the performance (throughput) levels of all these algorithms. It is shown that Sierra is by far, analytically, the most superior among all these algorithms. One of the goals of this paper is to contribute meaningfully to the quantitative modelling literature on this subject.]]
    Original languageEnglish
    Title of host publicationStatistical Solutions to Modern Problems: Proceedings of the 20th International Workshop on Statistical Modelling, Sydney, Australia, July 10-15, 2005
    PublisherUniversity of Western Sydney
    Number of pages6
    ISBN (Print)1741081017
    Publication statusPublished - 2005
    EventInternational Workshop on Statistical Modelling -
    Duration: 16 Jul 2012 → …

    Conference

    ConferenceInternational Workshop on Statistical Modelling
    Period16/07/12 → …

    Keywords

    • algorithms
    • congestion control
    • telecommunication
    • stochastic models

    Fingerprint

    Dive into the research topics of 'Stochastic modelling of congestion control algorithms'. Together they form a unique fingerprint.

    Cite this