The failure of TCP in high-performance computational grids
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Enabling Compatibility Between TCP Reno and TCP Vegas
SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
The Performance Comparison between TCP Reno and TCP Vegas
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops
A Case for TCP Vegas in High-Performance Computational Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Improving the Performance of TCP Vegas in a Heterogeneous Environment
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Performance Evaluation
Improve throughput of TCP-Vegas in multihop ad hoc networks
Computer Communications
Computer Communications
TCP Vegas-A: Improving the Performance of TCP Vegas
Computer Communications
Performance comparison between TCP Reno and TCP Vegas
Computer Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
TCP Vegas is a well-known delay-based congestion control mechanism. Studies have indicated that TCP Vegas outperforms TCP Reno in many aspects. However, Reno currently remains the most widely deployed TCP variant in the Internet. This is mainly because of the incompatibility of Vegas with Reno. The performance of Vegas is generally mediocre in environments where it coexists with Reno. Hence, there exists no incentive for operating systems to adopt Vegas as the default transport layer protocol. In this study, we propose a new variant of Vegas called COmpetitive DElay-based TCP (CODE TCP). This variant is compatible with Reno and it can obtain a fair share of network resources. CODE is a sender-sided modification and hence it can be implemented solely at the end host. Simulations and experiments confirm that CODE has better fairness characteristics in network environments in which it coexists with Reno while retaining the good features of Vegas.