TCP congestion avoidance: A network calculus interpretation and performance improvements

Mingyu Chen, Jinsong Zhang, Manohar Murthi, Kamal Premaratne

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
EditorsK. Makki, E. Knightly
Pages914-925
Number of pages12
Volume2
DOIs
StatePublished - Oct 10 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Other

OtherIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL
Period3/13/053/17/05

Fingerprint

Controllers
Flow control
Throughput
Parameter estimation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Chen, M., Zhang, J., Murthi, M., & Premaratne, K. (2005). TCP congestion avoidance: A network calculus interpretation and performance improvements. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM (Vol. 2, pp. 914-925) https://doi.org/10.1109/INFCOM.2005.1498321

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

Proceedings - IEEE INFOCOM. ed. / K. Makki; E. Knightly. Vol. 2 2005. p. 914-925.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, M, Zhang, J, Murthi, M & Premaratne, K 2005, TCP congestion avoidance: A network calculus interpretation and performance improvements. in K Makki & E Knightly (eds), 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 M, Premaratne K. TCP congestion avoidance: A network calculus interpretation and performance improvements. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM. Vol. 2. 2005. p. 914-925 https://doi.org/10.1109/INFCOM.2005.1498321
Chen, Mingyu ; Zhang, Jinsong ; Murthi, Manohar ; Premaratne, Kamal. / TCP congestion avoidance : A network calculus interpretation and performance improvements. Proceedings - IEEE INFOCOM. editor / K. Makki ; E. Knightly. Vol. 2 2005. pp. 914-925
@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 Manohar Murthi and Kamal Premaratne",
year = "2005",
month = "10",
day = "10",
doi = "10.1109/INFCOM.2005.1498321",
language = "English",
isbn = "0780389689",
volume = "2",
pages = "914--925",
editor = "K. Makki and E. Knightly",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - TCP congestion avoidance

T2 - A network calculus interpretation and performance improvements

AU - Chen, Mingyu

AU - Zhang, Jinsong

AU - Murthi, Manohar

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

VL - 2

SP - 914

EP - 925

BT - Proceedings - IEEE INFOCOM

A2 - Makki, K.

A2 - Knightly, E.

ER -