National Changhua University of Education Institutional Repository : Item 987654321/10137

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30026189 Online Users : 488

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/10137

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/10137

Title:	WARD: A Transmission Control Protocol-Friendly Stateless Active Queue Management Scheme
Authors:	Ho, Cheng-Yuan;Chan, Yi-Cheng;Chen, Yaw-Chung
Contributors:	資訊工程學系
Date:	2007-12
Issue Date:	2012-05-04T08:27:45Z
Publisher:	Institution of Engineering and Technology
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.
Relation:	IET Communications, 1(6): 1179-1186
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	650	View/Open

Loading...