On a fair congestion control scheme for TCP vegas

Abstract

TCP Vegas is the congestion avoidance algorithm and utilizes the bandwidth more efficiently than TCP Reno. However, it does not guarantee the fair sharing of the bandwidth among the active connections with different round-trip times. In this paper, we proposed a new TCP Vegas to provide the fairness among connections and stabilize the queue length at the desired value irrespective of the number of active connections.