TCP congestion avoidance: A network calculus interpretation and performance improvements

Mingyu Chen; Jinsong Zhang; Manohar N. Murthi; Kamal Premaratne

doi:10.1109/INFCOM.2005.1498321

TCP congestion avoidance: A network calculus interpretation and performance improvements

Mingyu Chen, Jinsong Zhang, Manohar N. Murthi, Kamal Premaratne

Electrical and Computer Engineering

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

7 Scopus citations

Abstract

TCP congestion avoidance mechanisms determine methods by which a source adjusts its window size according to network conditions. Although network calculus has been utilized to study window flow control, the use of network calculus to determine an optimal window controller and to provide analytical guidance to TCP congestion avoidance has persisted as an open problem. For the first time within a network calculus setting, we determine an optimal window size control method for general flow control problems. We also show that the basic TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas and Fast TCP can be viewed as different approaches to approximating the optimal NC controller, with each TCP variant making different assumptions in terms of parameter estimation and control implementation strategy. Therefore, the network calculus controller reveals the inherent underlying structure in TCP congestion avoidance. Furthermore, we demonstrate through ns-2 simulations that an approximation of a particular NC controller achieves performance gains in terms of link throughput and source node throughput fairness with respect to TCP Vegas, Enhanced TCP Vegas and Fast TCP.

Original language	English (US)
Title of host publication	Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
Editors	K. Makki, E. Knightly
Pages	914-925
Number of pages	12
DOIs	https://doi.org/10.1109/INFCOM.2005.1498321
State	Published - Oct 10 2005
Event	IEEE INFOCOM 2005 - Miami, FL, United States Duration: Mar 13 2005 → Mar 17 2005

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	2
ISSN (Print)	0743-166X

Other

Other	IEEE INFOCOM 2005
Country/Territory	United States
City	Miami, FL
Period	3/13/05 → 3/17/05

ASJC Scopus subject areas

Computer Science(all)
Electrical and Electronic Engineering

Access to Document

10.1109/INFCOM.2005.1498321

Cite this

Chen, M., Zhang, J., Murthi, M. N., & Premaratne, K. (2005). TCP congestion avoidance: A network calculus interpretation and performance improvements. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 914-925). (Proceedings - IEEE INFOCOM; Vol. 2). https://doi.org/10.1109/INFCOM.2005.1498321

TCP congestion avoidance : A network calculus interpretation and performance improvements. / Chen, Mingyu; Zhang, Jinsong; Murthi, Manohar N.; Premaratne, Kamal.

Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. ed. / K. Makki; E. Knightly. 2005. p. 914-925 (Proceedings - IEEE INFOCOM; Vol. 2).

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

Chen, M, Zhang, J, Murthi, MN & Premaratne, K 2005, TCP congestion avoidance: A network calculus interpretation and performance improvements. in K Makki & E Knightly (eds), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings - IEEE INFOCOM, vol. 2, pp. 914-925, IEEE INFOCOM 2005, Miami, FL, United States, 3/13/05. https://doi.org/10.1109/INFCOM.2005.1498321

Chen M, Zhang J, Murthi MN, Premaratne K. TCP congestion avoidance: A network calculus interpretation and performance improvements. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. 2005. p. 914-925. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2005.1498321

Chen, Mingyu ; Zhang, Jinsong ; Murthi, Manohar N. ; Premaratne, Kamal. / TCP congestion avoidance : A network calculus interpretation and performance improvements. Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. editor / K. Makki ; E. Knightly. 2005. pp. 914-925 (Proceedings - IEEE INFOCOM).

@inproceedings{305fe04d8640482b8f0347c6e3b4b2a5,

title = "TCP congestion avoidance: A network calculus interpretation and performance improvements",

abstract = "TCP congestion avoidance mechanisms determine methods by which a source adjusts its window size according to network conditions. Although network calculus has been utilized to study window flow control, the use of network calculus to determine an optimal window controller and to provide analytical guidance to TCP congestion avoidance has persisted as an open problem. For the first time within a network calculus setting, we determine an optimal window size control method for general flow control problems. We also show that the basic TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas and Fast TCP can be viewed as different approaches to approximating the optimal NC controller, with each TCP variant making different assumptions in terms of parameter estimation and control implementation strategy. Therefore, the network calculus controller reveals the inherent underlying structure in TCP congestion avoidance. Furthermore, we demonstrate through ns-2 simulations that an approximation of a particular NC controller achieves performance gains in terms of link throughput and source node throughput fairness with respect to TCP Vegas, Enhanced TCP Vegas and Fast TCP.",

author = "Mingyu Chen and Jinsong Zhang and Murthi, {Manohar N.} and Kamal Premaratne",

year = "2005",

month = oct,

day = "10",

doi = "10.1109/INFCOM.2005.1498321",

language = "English (US)",

isbn = "0780389689",

series = "Proceedings - IEEE INFOCOM",

pages = "914--925",

editor = "K. Makki and E. Knightly",

booktitle = "Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies",

note = "IEEE INFOCOM 2005 ; Conference date: 13-03-2005 Through 17-03-2005",

}

TY - GEN

T1 - TCP congestion avoidance

T2 - IEEE INFOCOM 2005

AU - Chen, Mingyu

AU - Zhang, Jinsong

AU - Murthi, Manohar N.

AU - Premaratne, Kamal

PY - 2005/10/10

Y1 - 2005/10/10

N2 - TCP congestion avoidance mechanisms determine methods by which a source adjusts its window size according to network conditions. Although network calculus has been utilized to study window flow control, the use of network calculus to determine an optimal window controller and to provide analytical guidance to TCP congestion avoidance has persisted as an open problem. For the first time within a network calculus setting, we determine an optimal window size control method for general flow control problems. We also show that the basic TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas and Fast TCP can be viewed as different approaches to approximating the optimal NC controller, with each TCP variant making different assumptions in terms of parameter estimation and control implementation strategy. Therefore, the network calculus controller reveals the inherent underlying structure in TCP congestion avoidance. Furthermore, we demonstrate through ns-2 simulations that an approximation of a particular NC controller achieves performance gains in terms of link throughput and source node throughput fairness with respect to TCP Vegas, Enhanced TCP Vegas and Fast TCP.

AB - TCP congestion avoidance mechanisms determine methods by which a source adjusts its window size according to network conditions. Although network calculus has been utilized to study window flow control, the use of network calculus to determine an optimal window controller and to provide analytical guidance to TCP congestion avoidance has persisted as an open problem. For the first time within a network calculus setting, we determine an optimal window size control method for general flow control problems. We also show that the basic TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas and Fast TCP can be viewed as different approaches to approximating the optimal NC controller, with each TCP variant making different assumptions in terms of parameter estimation and control implementation strategy. Therefore, the network calculus controller reveals the inherent underlying structure in TCP congestion avoidance. Furthermore, we demonstrate through ns-2 simulations that an approximation of a particular NC controller achieves performance gains in terms of link throughput and source node throughput fairness with respect to TCP Vegas, Enhanced TCP Vegas and Fast TCP.

UR - http://www.scopus.com/inward/record.url?scp=25844463719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25844463719&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2005.1498321

DO - 10.1109/INFCOM.2005.1498321

M3 - Conference contribution

AN - SCOPUS:25844463719

SN - 0780389689

T3 - Proceedings - IEEE INFOCOM

SP - 914

EP - 925

BT - Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies

A2 - Makki, K.

A2 - Knightly, E.

Y2 - 13 March 2005 through 17 March 2005

ER -

TCP congestion avoidance: A network calculus interpretation and performance improvements

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this