English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 18463871      Online Users : 233
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/10153

Title: A Competitive Delay-Based TCP
Authors: Chan, Yi-Cheng;Lin, Chia-Liang;Liu, Fang-Chun
Contributors: 資訊工程學系
Date: 2008-07
Issue Date: 2012-05-04T08:30:00Z
Publisher: IEEE
Abstract: TCP Vegas is a famous delay-based congestion control mechanism. Researches have indicated that TCP Vegas outperforms the loss-based TCP Reno in many aspects. However, Reno is still the most widely deployed TCP version in the current Internet. This predicament is primarily due to the incompatibility of Vegas with Reno. The performance of Vegas is generally mediocre in environments where Reno coexists. Hence, there exists no incentive for operating systems to adopt Vegas as default transport layer protocol. In this paper, we propose a new variant of Vegas called competitive delay-based TCP (CODE TCP) which could be compatible and get the fair share of network resources with Reno. CODE is a sender-sided modification and hence can be implemented solely at the end host. Our simulations confirm that CODE has better fairness characteristic in network environments where Reno coexist without discarding the good features of Vegas.
Relation: IEEE International Conference on Research, Innovation and Vision for the Future (RIVF 2008), Ho Chi Ming City, Vietnam, July 13-17, 2008: 134-140
Appears in Collections:[資訊工程學系] 會議論文

Files in This Item:

File SizeFormat
index.html0KbHTML455View/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