Stochastic modelling of congestion control algorithms

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

Stochastic modelling of congestion control algorithms

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

School of Computer, Data & Mathematical Sciences

Research output: Chapter in Book / Conference Paper › Conference Paper

Abstract

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 language	English
Title of host publication	Statistical Solutions to Modern Problems: Proceedings of the 20th International Workshop on Statistical Modelling, Sydney, Australia, July 10-15, 2005
Publisher	University of Western Sydney
Number of pages	6
ISBN (Print)	1741081017
Publication status	Published - 2005
Event	International Workshop on Statistical Modelling - Duration: 16 Jul 2012 → …

Conference

Conference	International Workshop on Statistical Modelling
Period	16/07/12 → …

Keywords

algorithms
congestion control
telecommunication
stochastic models

Cite this

@inproceedings{9ee80b182fd34d2fb703d42f67c09a4d,

title = "Stochastic modelling of congestion control algorithms",

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

keywords = "algorithms, congestion control, telecommunication, stochastic models",

author = "Jagannathan, \{S. Ravi\} and Matawie, \{Kenan M.\} and Francis, \{Andrew R.\} and Matawie, \{Kenan M.\} and Alicia Oshlack",

year = "2005",

language = "English",

isbn = "1741081017",

booktitle = "Statistical Solutions to Modern Problems: Proceedings of the 20th International Workshop on Statistical Modelling, Sydney, Australia, July 10-15, 2005",

publisher = "University of Western Sydney",

note = "International Workshop on Statistical Modelling ; Conference date: 16-07-2012",

}

Jagannathan, SR, Matawie, KM, Francis, AR, Matawie, KM & Oshlack, A 2005, Stochastic modelling of congestion control algorithms. in Statistical Solutions to Modern Problems: Proceedings of the 20th International Workshop on Statistical Modelling, Sydney, Australia, July 10-15, 2005. University of Western Sydney, International Workshop on Statistical Modelling, 16/07/12.

Stochastic modelling of congestion control algorithms. / Jagannathan, S. Ravi; Matawie, Kenan M.; Francis, Andrew R. et al.
Statistical Solutions to Modern Problems: Proceedings of the 20th International Workshop on Statistical Modelling, Sydney, Australia, July 10-15, 2005. University of Western Sydney, 2005.

Research output: Chapter in Book / Conference Paper › Conference Paper

TY - GEN

T1 - Stochastic modelling of congestion control algorithms

AU - Jagannathan, S. Ravi

AU - Matawie, Kenan M.

AU - Francis, Andrew R.

AU - Matawie, Kenan M.

AU - Oshlack, Alicia

PY - 2005

Y1 - 2005

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

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

KW - algorithms

KW - congestion control

KW - telecommunication

KW - stochastic models

UR - http://handle.uws.edu.au:8081/1959.7/44921

M3 - Conference Paper

SN - 1741081017

BT - Statistical Solutions to Modern Problems: Proceedings of the 20th International Workshop on Statistical Modelling, Sydney, Australia, July 10-15, 2005

PB - University of Western Sydney

T2 - International Workshop on Statistical Modelling

Y2 - 16 July 2012

ER -

Stochastic modelling of congestion control algorithms

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this