English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 30144399      線上人數 : 808
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/10138

題名: WARD: A Deterministic Fluid Model
作者: Ho, Cheng-Yuan;Chan, Yi-Cheng;Chen, Yaw-Chung
貢獻者: 資訊工程學系
日期: 2007-08
上傳時間: 2012-05-04T08:27:47Z
出版者: The Institution of Engineering and Technology
摘要: 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.
關聯: IET Communications, 1(4): 711-717
顯示於類別:[資訊工程學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML643檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 

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