WARD

A transmission control protocol-friendly stateless active queue management scheme

C. Y. Ho, Yi-Cheng Chan, Y. C. Chen

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this article, the problem of providing a fair bandwidth allocation to the flows sharing a congested link in a router is investigated. Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. A new transmission control protocol (TCP)-friendly router-based active queue management scheme, termed WARD, is proposed to approximate the fair queueing policy. WARD is a simple packet-dropping algorithm with a random mechanism which discriminates against flows that submit more packets per second than is allowed as their fair share. By doing this, it not only protects TCP connections from user datagram protocol flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. In addition, WARD works quite well for TCP flow isolation even with different round trip times. In other words, WARD improves the unfair bandwidth allocation properties. Furthermore, as it is stateless and easy to implement, WARD controls unresponsive or misbehaving flows with only a minimum overhead.

Original languageEnglish
Pages (from-to)1179-1186
Number of pages8
JournalIET Communications
Volume1
Issue number6
DOIs
Publication statusPublished - 2007 Dec 1

Fingerprint

Transmission control protocol
Frequency allocation
Routers
Bandwidth
Congestion control (communication)
Internet
Network protocols

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{1829e52f48c74dc6aec86bef7a2e7df4,
title = "WARD: A transmission control protocol-friendly stateless active queue management scheme",
abstract = "In this article, the problem of providing a fair bandwidth allocation to the flows sharing a congested link in a router is investigated. Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. A new transmission control protocol (TCP)-friendly router-based active queue management scheme, termed WARD, is proposed to approximate the fair queueing policy. WARD is a simple packet-dropping algorithm with a random mechanism which discriminates against flows that submit more packets per second than is allowed as their fair share. By doing this, it not only protects TCP connections from user datagram protocol flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. In addition, WARD works quite well for TCP flow isolation even with different round trip times. In other words, WARD improves the unfair bandwidth allocation properties. Furthermore, as it is stateless and easy to implement, WARD controls unresponsive or misbehaving flows with only a minimum overhead.",
author = "Ho, {C. Y.} and Yi-Cheng Chan and Chen, {Y. C.}",
year = "2007",
month = "12",
day = "1",
doi = "10.1049/iet-com:20060595",
language = "English",
volume = "1",
pages = "1179--1186",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "6",

}

WARD : A transmission control protocol-friendly stateless active queue management scheme. / Ho, C. Y.; Chan, Yi-Cheng; Chen, Y. C.

In: IET Communications, Vol. 1, No. 6, 01.12.2007, p. 1179-1186.

Research output: Contribution to journalArticle

TY - JOUR

T1 - WARD

T2 - A transmission control protocol-friendly stateless active queue management scheme

AU - Ho, C. Y.

AU - Chan, Yi-Cheng

AU - Chen, Y. C.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In this article, the problem of providing a fair bandwidth allocation to the flows sharing a congested link in a router is investigated. Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. A new transmission control protocol (TCP)-friendly router-based active queue management scheme, termed WARD, is proposed to approximate the fair queueing policy. WARD is a simple packet-dropping algorithm with a random mechanism which discriminates against flows that submit more packets per second than is allowed as their fair share. By doing this, it not only protects TCP connections from user datagram protocol flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. In addition, WARD works quite well for TCP flow isolation even with different round trip times. In other words, WARD improves the unfair bandwidth allocation properties. Furthermore, as it is stateless and easy to implement, WARD controls unresponsive or misbehaving flows with only a minimum overhead.

AB - In this article, the problem of providing a fair bandwidth allocation to the flows sharing a congested link in a router is investigated. Queue management, bandwidth share and congestion control are very important to both the robustness and fairness of the Internet. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. A new transmission control protocol (TCP)-friendly router-based active queue management scheme, termed WARD, is proposed to approximate the fair queueing policy. WARD is a simple packet-dropping algorithm with a random mechanism which discriminates against flows that submit more packets per second than is allowed as their fair share. By doing this, it not only protects TCP connections from user datagram protocol flows, but also solves the problem of competing bandwidth among different TCP versions, such as TCP Vegas and TCP Reno. In addition, WARD works quite well for TCP flow isolation even with different round trip times. In other words, WARD improves the unfair bandwidth allocation properties. Furthermore, as it is stateless and easy to implement, WARD controls unresponsive or misbehaving flows with only a minimum overhead.

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

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

U2 - 10.1049/iet-com:20060595

DO - 10.1049/iet-com:20060595

M3 - Article

VL - 1

SP - 1179

EP - 1186

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 6

ER -