English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 18463513      Online Users : 204
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

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

Title: A TCP-Friendly Stateless AQM Scheme for Fair Bandwidth Allocation
Authors: Ho, Cheng-Yuan;Chan, Yi-Cheng;Chen, Yaw-Chung
Contributors: 資訊工程學系
Date: 2005-10
Issue Date: 2012-05-04T08:30:04Z
Publisher: IEEE Computer Society Washington, DC, USA
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 routerbased 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.
Relation: IEEE International Conference on Autonomic and Autonomous Systems & International Conference on Networking and Services (ICAS /ICNS 2005), Papeete, Tahiti, French Polynesia, October 23-28, 2005: 14-19
Appears in Collections:[資訊工程學系] 會議論文

Files in This Item:

File SizeFormat
index.html0KbHTML440View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback