Complementary analysis and numerical results foran elementary fluid flow model of TCP

Esa Olavi Hyytiä; Erling Austreim; Peder J. Emstad

Complementary analysis and numerical results foran elementary fluid flow model of TCP

Esa Olavi Hyytiä, Erling Austreim, Peder J. Emstad

Faculty of Industrial Engineering, Mechanical Engineering and Computer Science

University of Iceland

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

Abstract

The congestion control algorithm used in Transmission Control Protocol (TCP) is a so-called additive increase multiplicative decrease (AIMD) algorithm. The algorithm and its performance have been studied extensively in the literature. Today, several versions of the TCP exist, which behave slightly differently when congestion occurs. However, for the analytical work it is often necessary to consider idealized models. One such model based on fluid flow approach is proposed in [1], on which we will also focus in this paper. In particular, we study this simplified fluid flow approximation and its generalization by numerical simulations in order to evaluate relationships between different parameters of the model and the resulting performance quantities. Moreover, we also compare the model against an actual implementation of TCP congestion
control mechanism. Additionally, we give some complementary analytical results for the model

Original language	English
Title of host publication	Fourth International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HETNETs’06), Ilkley, West Yorkshire, U.K., September, 2006
Pages	P04/1-P04/10
Number of pages	10
Publication status	Published - 2006

Cite this

@inproceedings{3003372c0c964dafae958022a0bd7e19,

title = "Complementary analysis and numerical results foran elementary fluid flow model of TCP",

abstract = "The congestion control algorithm used in Transmission Control Protocol (TCP) is a so-called additive increase multiplicative decrease (AIMD) algorithm. The algorithm and its performance have been studied extensively in the literature. Today, several versions of the TCP exist, which behave slightly differently when congestion occurs. However, for the analytical work it is often necessary to consider idealized models. One such model based on fluid flow approach is proposed in [1], on which we will also focus in this paper. In particular, we study this simplified fluid flow approximation and its generalization by numerical simulations in order to evaluate relationships between different parameters of the model and the resulting performance quantities. Moreover, we also compare the model against an actual implementation of TCP congestion control mechanism. Additionally, we give some complementary analytical results for the model",

author = "Hyyti{\"a}, \{Esa Olavi\} and Erling Austreim and Emstad, \{Peder J.\}",

year = "2006",

language = "English",

pages = "P04/1--P04/10",

booktitle = "Fourth International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HETNETs{\textquoteright}06), Ilkley, West Yorkshire, U.K., September, 2006",

}

Complementary analysis and numerical results foran elementary fluid flow model of TCP. / Hyytiä, Esa Olavi; Austreim, Erling; Emstad, Peder J.
Fourth International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HETNETs’06), Ilkley, West Yorkshire, U.K., September, 2006. 2006. p. P04/1-P04/10.

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

TY - GEN

T1 - Complementary analysis and numerical results foran elementary fluid flow model of TCP

AU - Hyytiä, Esa Olavi

AU - Austreim, Erling

AU - Emstad, Peder J.

PY - 2006

Y1 - 2006

N2 - The congestion control algorithm used in Transmission Control Protocol (TCP) is a so-called additive increase multiplicative decrease (AIMD) algorithm. The algorithm and its performance have been studied extensively in the literature. Today, several versions of the TCP exist, which behave slightly differently when congestion occurs. However, for the analytical work it is often necessary to consider idealized models. One such model based on fluid flow approach is proposed in [1], on which we will also focus in this paper. In particular, we study this simplified fluid flow approximation and its generalization by numerical simulations in order to evaluate relationships between different parameters of the model and the resulting performance quantities. Moreover, we also compare the model against an actual implementation of TCP congestion control mechanism. Additionally, we give some complementary analytical results for the model

AB - The congestion control algorithm used in Transmission Control Protocol (TCP) is a so-called additive increase multiplicative decrease (AIMD) algorithm. The algorithm and its performance have been studied extensively in the literature. Today, several versions of the TCP exist, which behave slightly differently when congestion occurs. However, for the analytical work it is often necessary to consider idealized models. One such model based on fluid flow approach is proposed in [1], on which we will also focus in this paper. In particular, we study this simplified fluid flow approximation and its generalization by numerical simulations in order to evaluate relationships between different parameters of the model and the resulting performance quantities. Moreover, we also compare the model against an actual implementation of TCP congestion control mechanism. Additionally, we give some complementary analytical results for the model

M3 - Conference contribution

SP - P04/1-P04/10

BT - Fourth International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HETNETs’06), Ilkley, West Yorkshire, U.K., September, 2006

ER -