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

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

Title: WARD: A Deterministic Fluid Model
Authors: Ho, Cheng-Yuan;Chan, Yi-Cheng;Chen, Yaw-Chung
Contributors: 資訊工程學系
Date: 2007-08
Issue Date: 2012-05-04T08:27:47Z
Publisher: The Institution of Engineering and Technology
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, soWARD 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)21 � 0.184 when UDP input rate is slightly larger than link capacity and drops to zero as UDP input rate tends to infinity.
Relation: IET Communications, 1(4): 711-717
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat

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