English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6491/11663
Visitors : 24618929      Online Users : 53
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/10133

Title: CODE TCP: A Competitive Delay-Based TCP
Authors: Chan, Yi-Cheng;Lin, Chia-Liang;Chan, Chia-Tai;Ho, Cheng-Yuan
Contributors: 資訊工程學系
Keywords: Congestion control;TCP Reno;TCP Vegas;Fairness;Transport layer protocol
Date: 2010-06
Issue Date: 2012-05-04T08:27:36Z
Publisher: Elsevier B.V
Abstract: TCP Vegas is a well-known delay-based congestion control mechanism. Studies have indicated that TCP Vegas outperforms TCP Reno in many aspects. However, Reno currently remains the most widely deployed TCP variant in the Internet. This is mainly because of the incompatibility of Vegas with Reno. The performance of Vegas is generally mediocre in environments where it coexists with Reno. Hence, there exists no incentive for operating systems to adopt Vegas as the default transport layer protocol. In this study, we propose a new variant of Vegas called COmpetitive DElay-based TCP (CODE TCP). This variant is compatible with Reno and it can obtain a fair share of network resources. CODE is a sender-sided modification and hence it can be implemented solely at the end host. Simulations and experiments confirm that CODE has better fairness characteristics in network environments in which it coexists with Reno while retaining the good features of Vegas.
Relation: Computer Communications, 33(9): 1013-1029
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