WARD: A deterministic fluid model

C. Y. Ho, Y. C. Chan, Y. C. Chen

Research output: Contribution to journalArticle

Abstract

Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. A new TCP-friendly router-based active queue management scheme, called WARD, approximates the fair queueing policy. WARD is a simple packet dropping algorithm with a random mechanism and discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, it not only protects transmission control protocol (TCP) connections from user datagram protocol (UDP) flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. Furthermore, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead. In this article, we present a deterministic fluid model of TCP/WARD system, and explain the UDP throughput behaviour with WARD. Also, we prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (2e)-1=0.184 when UDP input rate is slightly larger than link capacity and drops to zero as UDP input rate tends to infinity.

Original languageEnglish
Pages (from-to)711-717
Number of pages7
JournalIET Communications
Volume1
Issue number4
DOIs
Publication statusPublished - 2007 Aug 13

Fingerprint

Transmission control protocol
Fluids
Network protocols
Bandwidth
Congestion control (communication)
Routers
Throughput
Internet

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Ho, C. Y. ; Chan, Y. C. ; Chen, Y. C. / WARD : A deterministic fluid model. In: IET Communications. 2007 ; Vol. 1, No. 4. pp. 711-717.
@article{828c8b34b360420fb3ab53a55a69f503,
title = "WARD: A deterministic fluid model",
abstract = "Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. A new TCP-friendly router-based active queue management scheme, called WARD, approximates the fair queueing policy. WARD is a simple packet dropping algorithm with a random mechanism and discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, it not only protects transmission control protocol (TCP) connections from user datagram protocol (UDP) flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. Furthermore, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead. In this article, we present a deterministic fluid model of TCP/WARD system, and explain the UDP throughput behaviour with WARD. Also, we prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (2e)-1=0.184 when UDP input rate is slightly larger than link capacity and drops to zero as UDP input rate tends to infinity.",
author = "Ho, {C. Y.} and Chan, {Y. C.} and Chen, {Y. C.}",
year = "2007",
month = "8",
day = "13",
doi = "10.1049/iet-com:20060380",
language = "English",
volume = "1",
pages = "711--717",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "4",

}

WARD : A deterministic fluid model. / Ho, C. Y.; Chan, Y. C.; Chen, Y. C.

In: IET Communications, Vol. 1, No. 4, 13.08.2007, p. 711-717.

Research output: Contribution to journalArticle

TY - JOUR

T1 - WARD

T2 - A deterministic fluid model

AU - Ho, C. Y.

AU - Chan, Y. C.

AU - Chen, Y. C.

PY - 2007/8/13

Y1 - 2007/8/13

N2 - Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. A new TCP-friendly router-based active queue management scheme, called WARD, approximates the fair queueing policy. WARD is a simple packet dropping algorithm with a random mechanism and discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, it not only protects transmission control protocol (TCP) connections from user datagram protocol (UDP) flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. Furthermore, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead. In this article, we present a deterministic fluid model of TCP/WARD system, and explain the UDP throughput behaviour with WARD. Also, we prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (2e)-1=0.184 when UDP input rate is slightly larger than link capacity and drops to zero as UDP input rate tends to infinity.

AB - Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. A new TCP-friendly router-based active queue management scheme, called WARD, approximates the fair queueing policy. WARD is a simple packet dropping algorithm with a random mechanism and discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, it not only protects transmission control protocol (TCP) connections from user datagram protocol (UDP) flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. Furthermore, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead. In this article, we present a deterministic fluid model of TCP/WARD system, and explain the UDP throughput behaviour with WARD. Also, we prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (2e)-1=0.184 when UDP input rate is slightly larger than link capacity and drops to zero as UDP input rate tends to infinity.

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

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

U2 - 10.1049/iet-com:20060380

DO - 10.1049/iet-com:20060380

M3 - Article

AN - SCOPUS:34547686178

VL - 1

SP - 711

EP - 717

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 4

ER -