A competitive delay-based TCP
Yi-Cheng Chan, Chia-Liang Lin, Fang‐Chun Liu · 2008
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.