Performance Improvement of Congestion Avoidance Mechanism for TCP Vegas

  • Authors:
  • Yi-Cheng Chan;Chia-Tai Chan;Yaw-Chung Chen;Cheng-Yuan Ho

  • Affiliations:
  • National Chiao Tung University, Hsinchu, Taiwan;National Chiao Tung University, Hsinchu, Taiwan;National Chiao Tung University, Hsinchu, Taiwan;National Chiao Tung University, Hsinchu, Taiwan

  • Venue:
  • ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a router-based congestionavoidance mechanism (RoVegas) for TCP Vegas. TCP Vegasdetects network congestion in the early stage and successfullyprevents periodic packet loss that usually occurs inTCP Reno. It has been demonstrated that TCP Vegas outperformsTCP Reno in many aspects. However, TCP Vegassuffers several problems that inhere in its congestion avoidancemechanism, these include issues of rerouting, persistentcongestion, fairness, and network asymmetry. By performingthe proposed scheme in routers along the round-trippath, RoVegas can solve the problems of rerouting andpersistent congestion, enhance the fairness among the competitiveconnections, and improve the throughput when congestionoccurs on the backward path. Through the resultsof both analysis and simulation, we demonstrate the effectiveness of RoVegas.