Delay-based TCP congestion avoidance

A network calculus interpretation and performance improvements

Mingyu Chen, Jinsong Zhang, Manohar Murthi, Kamal Premaratne

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In delay-based TCP congestion avoidance mechanisms, a source adjusts its window size to adapt to changes in network conditions as measured through changing queueing delays. Although network calculus (NC) has been used to study window flow control and determine performance bounds, there is a lack of a bridge between NC theory and the practical issues of delay-based TCP congestion avoidance. In this paper, we use an NC-based approach to derive ideal congestion controllers for representative delay-based window flow control models with time-variant feedback delays. We show that the basic delay-based TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas, and FAST TCP can be viewed as different approaches to approximating a certain NC controller. Moreover, we derive another NC controller that is explicitly constructed to address the throughput degradation of the current delay-based methods due to delayed acknowledgement (ACK) packets caused by network traffic in the reverse path (ACK packet) direction. The approximation of this F-model NC-based controller is shown to provide better throughput and fairness over the existing delay-based methods for a variety of network topologies in ns-2 simulations.

Original languageEnglish
Pages (from-to)1319-1340
Number of pages22
JournalComputer Networks
Volume53
Issue number9
DOIs
StatePublished - Jun 25 2009

Fingerprint

Controllers
Flow control
Throughput
Topology
Feedback
Degradation

Keywords

  • Congestion control
  • Deterministic network calculus
  • High-speed networking
  • Reverse path congestion
  • Transport protocols

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

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

In: Computer Networks, Vol. 53, No. 9, 25.06.2009, p. 1319-1340.

Research output: Contribution to journalArticle

@article{f3fe874303a8451599639da8164e2601,
title = "Delay-based TCP congestion avoidance: A network calculus interpretation and performance improvements",
abstract = "In delay-based TCP congestion avoidance mechanisms, a source adjusts its window size to adapt to changes in network conditions as measured through changing queueing delays. Although network calculus (NC) has been used to study window flow control and determine performance bounds, there is a lack of a bridge between NC theory and the practical issues of delay-based TCP congestion avoidance. In this paper, we use an NC-based approach to derive ideal congestion controllers for representative delay-based window flow control models with time-variant feedback delays. We show that the basic delay-based TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas, and FAST TCP can be viewed as different approaches to approximating a certain NC controller. Moreover, we derive another NC controller that is explicitly constructed to address the throughput degradation of the current delay-based methods due to delayed acknowledgement (ACK) packets caused by network traffic in the reverse path (ACK packet) direction. The approximation of this F-model NC-based controller is shown to provide better throughput and fairness over the existing delay-based methods for a variety of network topologies in ns-2 simulations.",
keywords = "Congestion control, Deterministic network calculus, High-speed networking, Reverse path congestion, Transport protocols",
author = "Mingyu Chen and Jinsong Zhang and Manohar Murthi and Kamal Premaratne",
year = "2009",
month = "6",
day = "25",
doi = "10.1016/j.comnet.2008.12.024",
language = "English",
volume = "53",
pages = "1319--1340",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "9",

}

TY - JOUR

T1 - Delay-based TCP congestion avoidance

T2 - A network calculus interpretation and performance improvements

AU - Chen, Mingyu

AU - Zhang, Jinsong

AU - Murthi, Manohar

AU - Premaratne, Kamal

PY - 2009/6/25

Y1 - 2009/6/25

N2 - In delay-based TCP congestion avoidance mechanisms, a source adjusts its window size to adapt to changes in network conditions as measured through changing queueing delays. Although network calculus (NC) has been used to study window flow control and determine performance bounds, there is a lack of a bridge between NC theory and the practical issues of delay-based TCP congestion avoidance. In this paper, we use an NC-based approach to derive ideal congestion controllers for representative delay-based window flow control models with time-variant feedback delays. We show that the basic delay-based TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas, and FAST TCP can be viewed as different approaches to approximating a certain NC controller. Moreover, we derive another NC controller that is explicitly constructed to address the throughput degradation of the current delay-based methods due to delayed acknowledgement (ACK) packets caused by network traffic in the reverse path (ACK packet) direction. The approximation of this F-model NC-based controller is shown to provide better throughput and fairness over the existing delay-based methods for a variety of network topologies in ns-2 simulations.

AB - In delay-based TCP congestion avoidance mechanisms, a source adjusts its window size to adapt to changes in network conditions as measured through changing queueing delays. Although network calculus (NC) has been used to study window flow control and determine performance bounds, there is a lack of a bridge between NC theory and the practical issues of delay-based TCP congestion avoidance. In this paper, we use an NC-based approach to derive ideal congestion controllers for representative delay-based window flow control models with time-variant feedback delays. We show that the basic delay-based TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas, and FAST TCP can be viewed as different approaches to approximating a certain NC controller. Moreover, we derive another NC controller that is explicitly constructed to address the throughput degradation of the current delay-based methods due to delayed acknowledgement (ACK) packets caused by network traffic in the reverse path (ACK packet) direction. The approximation of this F-model NC-based controller is shown to provide better throughput and fairness over the existing delay-based methods for a variety of network topologies in ns-2 simulations.

KW - Congestion control

KW - Deterministic network calculus

KW - High-speed networking

KW - Reverse path congestion

KW - Transport protocols

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

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

U2 - 10.1016/j.comnet.2008.12.024

DO - 10.1016/j.comnet.2008.12.024

M3 - Article

VL - 53

SP - 1319

EP - 1340

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 9

ER -