A TCP-friendly stateless AQM scheme for fair bandwidth allocation

Cheng Yuan Ho, Yi-Cheng Chan, Yaw Chung Chen

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

2 Citations (Scopus)

Abstract

Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of providing a fair bandwidth allocation to those flows that share congested link in a router. A new TCP-friendly router-based AQM (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, and discriminates against the flows which transmit more packets than allowed. By doing this, it not only protects TCP connections from UDP flows, but also solves the problem of competing bandwidth among different TCP versions such as TCP Vegas and 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, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead.

Original languageEnglish
Title of host publicationProceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
Number of pages1
DOIs
Publication statusPublished - 2005 Dec 1
EventJoint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, 2005. ICAS-ICNS 2005 - Papeete, Tahiti, French Polynesia
Duration: 2005 Oct 232005 Oct 28

Publication series

NameProceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005
Volume2005

Other

OtherJoint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, 2005. ICAS-ICNS 2005
CountryFrench Polynesia
CityPapeete, Tahiti
Period05-10-2305-10-28

Fingerprint

Frequency allocation
Routers
Bandwidth
Congestion control (communication)
Internet

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Ho, C. Y., Chan, Y-C., & Chen, Y. C. (2005). A TCP-friendly stateless AQM scheme for fair bandwidth allocation. In Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006 [1559865] (Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005; Vol. 2005). https://doi.org/10.1109/ICAS-ICNS.2005.11
Ho, Cheng Yuan ; Chan, Yi-Cheng ; Chen, Yaw Chung. / A TCP-friendly stateless AQM scheme for fair bandwidth allocation. Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2005. (Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005).
@inproceedings{71cc5238908e4d918de765fec64eedb0,
title = "A TCP-friendly stateless AQM scheme for fair bandwidth allocation",
abstract = "Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of providing a fair bandwidth allocation to those flows that share congested link in a router. A new TCP-friendly router-based AQM (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, and discriminates against the flows which transmit more packets than allowed. By doing this, it not only protects TCP connections from UDP flows, but also solves the problem of competing bandwidth among different TCP versions such as TCP Vegas and 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, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead.",
author = "Ho, {Cheng Yuan} and Yi-Cheng Chan and Chen, {Yaw Chung}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ICAS-ICNS.2005.11",
language = "English",
isbn = "0769524508",
series = "Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005",
booktitle = "Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006",

}

Ho, CY, Chan, Y-C & Chen, YC 2005, A TCP-friendly stateless AQM scheme for fair bandwidth allocation. in Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006., 1559865, Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005, vol. 2005, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, 2005. ICAS-ICNS 2005, Papeete, Tahiti, French Polynesia, 05-10-23. https://doi.org/10.1109/ICAS-ICNS.2005.11

A TCP-friendly stateless AQM scheme for fair bandwidth allocation. / Ho, Cheng Yuan; Chan, Yi-Cheng; Chen, Yaw Chung.

Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2005. 1559865 (Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005; Vol. 2005).

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

TY - GEN

T1 - A TCP-friendly stateless AQM scheme for fair bandwidth allocation

AU - Ho, Cheng Yuan

AU - Chan, Yi-Cheng

AU - Chen, Yaw Chung

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of providing a fair bandwidth allocation to those flows that share congested link in a router. A new TCP-friendly router-based AQM (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, and discriminates against the flows which transmit more packets than allowed. By doing this, it not only protects TCP connections from UDP flows, but also solves the problem of competing bandwidth among different TCP versions such as TCP Vegas and 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, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead.

AB - Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of providing a fair bandwidth allocation to those flows that share congested link in a router. A new TCP-friendly router-based AQM (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, and discriminates against the flows which transmit more packets than allowed. By doing this, it not only protects TCP connections from UDP flows, but also solves the problem of competing bandwidth among different TCP versions such as TCP Vegas and 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, it is stateless and easy to implement, so WARD controls unresponsive or misbehaving flows with a minimum overhead.

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

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

U2 - 10.1109/ICAS-ICNS.2005.11

DO - 10.1109/ICAS-ICNS.2005.11

M3 - Conference contribution

AN - SCOPUS:33845334850

SN - 0769524508

SN - 9780769524504

T3 - Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005

BT - Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006

ER -

Ho CY, Chan Y-C, Chen YC. A TCP-friendly stateless AQM scheme for fair bandwidth allocation. In Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2005. 1559865. (Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, ICAS/ICNS 2005). https://doi.org/10.1109/ICAS-ICNS.2005.11