CANIT: a new algorithm to improve the fairness of TCP congestion avoidance

We propose a new policy for TCP congestion avoidance and we compare, by a queueing-simulation study, its performance to those of standard policy. This leads to unfair sharing of bandwidth when multiple connections, with different round trip times (RTTs), traverse the same bottleneck link with the long RTT connections obtaining only a small fraction of their fair share of the bandwidth. The new policy, which we refer to as “CANIT” (Congestion Avoidance with Normalized Interval of Time), allows TCP senders of all connections sharing the same network resource to accelerate their rates similarly during the congestion avoidance phase. Our first main result is that, using the “CANIT” algorithm, instead of the standard congestion avoidance one, improves the TCP fairness as well as the utilization of network resources. Our second main result is that, using the small values of the parameter “NIT” (Normalized Interval of Time) in our algorithm leads to a more efficient use of bandwidth and the fairness is more improved