National Changhua University of Education Institutional Repository : Item 987654321/10157
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6458/11630
Visitors : 13940309      Online Users : 87
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/10157

Title: An Aided Congestion Avoidance Mechanism for TCP Vegas
Authors: Ho, Cheng-Yuan;Shih, Chen-Hua;Chen, Yaw-Chung;Chan, Yi-Cheng
Contributors: 資訊工程學系
Date: 2005-08
Issue Date: 2012-05-04T08:30:06Z
Publisher: Springer
Abstract: TCP Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. It has been demonstrated that TCP Vegas achieves much higher performance than TCP Reno in many aspects. However, TCP Vegas cannot prevent unnecessary throughput degradation when conges- tion occurs in the backward path, it passes through multiple congested links, or it reroutes through a path with longer round-trip time (RTT). In this paper, we propose an aided congestion avoidance mechanism for TCP Vegas, called Aid-Vegas, which uses the relative one-way delay of each packet along the forward path to distinguish whether congestion occurs or not. Through the results of simulation, we demonstrate that Aid-Vegas can solve the problems of rerouting and backward congestion, enhance the fairness among the competitive connections, and improve the throughput when multiple congested links are encountered.
Relation: Lecture Notes in Computer Science (LNCS), August, 2005: 961-971
Appears in Collections:[Department and Graduate Institute of Computer Science and Information Engineering] Proceedings

Files in This Item:

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