RoVegas: a router-based congestion avoidance mechanism for TCP Vegas

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

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan;Telecommunication Laboratories, Chunghwa TeIecom Company Ltd, Taipei 106, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan

  • Venue:
  • Computer Communications
  • Year:
  • 2004

Quantified Score

Hi-index 0.24

Visualization

Abstract

Transmission control protocol (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 outperforms TCP Reno in many aspects. However, TCP Vegas suffers several problems that inhere in its congestion avoidance mechanism, these include issues of rerouting, persistent congestion, fairness, and network asymmetry. In this paper, we propose a router-based congestion avoidance mechanism (RoVegas) for TCP Vegas. By performing the proposed scheme in routers along the round-trip path, RoVegas can solve the problems of rerouting and persistent congestion, enhance the fairness among the competitive connections, and improve the throughput when congestion occurs on the backward path. Through the results of both analysis and simulation, we demonstrate the effectiveness of RoVegas.