An analytical study of CANIT algorithm in TCP protocol

ABSTRACT

CANIT (Congestion Avoidance with Normalized Interval of Time) algorithm is a new policy for TCP congestion avoidance which is proposed in order to improve TCP fairness over long delay links. CANIT uses a new parameter refered to NIT (Normalized Interval of Time), which is the key of this algorithm. In former works, we showed by simulations of some configuration with various value of NIT parameter, that using our algorithm instead of the standard one, improves the TCP fairness as well as the utilisation of network ressources. In this work, we propose an analytical study and we give the basic equations in order to find the optimal value of NIT parameter which provides more fairness and better bandwidth utilisation.

REFERENCES

• 1: CANIT: A New Algorithm to Improve the Fairness of TCP Congestion Avoidance, Proceedings of the Sixth IEEE Symposium on Computers and Communications, p.702, July 03-05, 2001
• 2: D.-M. Chiu , R. Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems, v.17 n.1, p.1-14, June 10, 1989 [doi>10.1016/0169-7552(89)90019-6]
• 3: V. Jacobson, Congestion avoidance and control, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.314-329, August 1988
• 4: V. Jacobson, Modified TCP Congestion Avoidance Algorithm, end2end-interest mailing list, April 30, 1990.
• 5: J. Postel, Transmission Control Protocol, RFC793, September 1981.
• 6: W. Richard Stevens, TCP Slow Start, Congestion Avoidance, Fast Retransmit and Fast Recovery Algorithms, RFC2001, January 1997.