Introducing an improved algorithm for TCP-Vegas incompatibility problem solving with other connections in heterogeneous networks

To manage congestion in a computer network congestion control algorithms are used. Studies so far show that in homogeneous networks, TCP-Vegas in many cases, acts better than TCP-Reno. But when both algorithms of Vegas and Reno are being used in the Internet, Reno acts better than Vegas. For this reason, there is no incentive for operating systems to use Vegas as the default transport layer protocol. In this article, an improved Vegas has proposed which is consistent with Reno and when it is competing with Reno, it can get a fair share of network resources. Unlike TCP-Vegas which uses the fixed parameters α and β, the proposed algorithm, determines these parameters according to network conditions and in a dynamic way. The proposed algorithm is being compared with original Vegas and other improved Vegas algorithms like, Vegas-A and CODE TCP. Simulation results show that the proposed algorithm competing with Reno, compared to other improved algorithms, achieves a more equitable share of the bandwidth and has a higher throughput. Furthermore, proposed algorithm also preserves the good qualities of Vegas algorithm.