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

doi:10.1109/INFCOM.2001.916630

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

Stochastic Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

17 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Proceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001)
Editors	R. Cruz, G. Pacifici, B. Sengupta
Publisher	Institute of Electrical and Electronics Engineers
Pages	1350-1359
Number of pages	10
ISBN (Print)	0-7803-7016-3
DOIs	https://doi.org/10.1109/INFCOM.2001.916630
Publication status	Published - 2001
Event	INFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA - Anchorage, AK, United States Duration: 22 Apr 2001 → 26 Apr 2001

Conference

Conference	INFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA
Country/Territory	United States
City	Anchorage, AK
Period	22/04/01 → 26/04/01

Access to Document

10.1109/INFCOM.2001.916630

Cite this

Altman, E., Avrachenkov, K. E., Barakat, C., & Núñez Queija, R. (2001). State-dependent M/G/1 type queueing analysis for congestion control in data networks. In R. Cruz, G. Pacifici, & B. Sengupta (Eds.), Proceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001) (pp. 1350-1359). Article 916630 Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/INFCOM.2001.916630

@inproceedings{abb397b9c6264c07a514d00b9b0d0fcb,

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

abstract = "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.",

author = "E. Altman and K.E. Avrachenkov and C. Barakat and \{N{\'u}{\~n}ez Queija\}, R.",

year = "2001",

doi = "10.1109/INFCOM.2001.916630",

language = "English",

isbn = "0-7803-7016-3",

pages = "1350--1359",

editor = "R. Cruz and G. Pacifici and B. Sengupta",

booktitle = "Proceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001)",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "INFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA ; Conference date: 22-04-2001 Through 26-04-2001",

}

Altman, E, Avrachenkov, KE, Barakat, C & Núñez Queija, R 2001, State-dependent M/G/1 type queueing analysis for congestion control in data networks. in R Cruz, G Pacifici & B Sengupta (eds), Proceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001)., 916630, Institute of Electrical and Electronics Engineers, pp. 1350-1359, INFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA, Anchorage, AK, United States, 22/04/01. https://doi.org/10.1109/INFCOM.2001.916630

State-dependent M/G/1 type queueing analysis for congestion control in data networks. / Altman, E.; Avrachenkov, K.E.; Barakat, C. et al.
Proceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001). ed. / R. Cruz; G. Pacifici; B. Sengupta. Institute of Electrical and Electronics Engineers, 2001. p. 1350-1359 916630.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Altman, E.

AU - Avrachenkov, K.E.

AU - Barakat, C.

AU - Núñez Queija, R.

PY - 2001

Y1 - 2001

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

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

U2 - 10.1109/INFCOM.2001.916630

DO - 10.1109/INFCOM.2001.916630

M3 - Conference contribution

SN - 0-7803-7016-3

SP - 1350

EP - 1359

BT - Proceedings INFOCOM 2001 (Anchorage AK, USA, April 22-26, 2001)

A2 - Cruz, R.

A2 - Pacifici, G.

A2 - Sengupta, B.

PB - Institute of Electrical and Electronics Engineers

T2 - INFOCOM 2001, April 22-26, 2001, Anchorage, AK, USA

Y2 - 22 April 2001 through 26 April 2001

ER -

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

Abstract

Conference

Access to Document

Fingerprint

Cite this