State-dependent M/G/1 type queueing analysis for congestion control in data networks

E. Altman, K.E. Avrachenkov, C. Barakat, R. Núñez Queija

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

    15 Citations (Scopus)


    We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poisson process. We focus on the case when the transmission rate cannot exceed a certain maximum value. We write the Kolmogorov equations and we use Laplace transforms to calculate the distribution of the transmission rate in the steady state as well as its moments. Our model is particularly useful to study the behavior of TCP, the congestion control mechanism in the Internet. By a simple transformation, the problem can be reformulated in terms of an equivalent M/G/1 queue, where the transmission rate in the original model corresponds to the workload in the 'dual' queue. The service times in the queueing model are not i.i.d., and they depend on the workload in the system.
    Original languageEnglish
    Title of host publicationProceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001)
    EditorsR. Cruz, G. Pacifici, B. Sengupta
    PublisherInstitute of Electrical and Electronics Engineers
    Number of pages10
    ISBN (Print)0-7803-7016-3
    Publication statusPublished - 2001
    EventINFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA - Anchorage, AK, United States
    Duration: 22 Apr 200126 Apr 2001


    ConferenceINFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA
    CountryUnited States
    CityAnchorage, AK

    Fingerprint Dive into the research topics of 'State-dependent M/G/1 type queueing analysis for congestion control in data networks'. Together they form a unique fingerprint.

    Cite this