Interaction between polynomial congestion control algorithms MIMD-poly and PIPD-poly and other TCP variants in TCP/IP networks

This paper analyses the interaction between a class of non-linear congestion control algorithms called polynomial congestion control algorithms and other transmission control protocol (TCP) congestion control algorithms in TCP/IP networks. The proposed polynomial algorithms generalize the additive increase and multiplicative decrease (AIMD) algorithms used for the TCP/IP networks. These algorithms provide additive increase and multiplicative decrease using the polynomial of the current window size. Infinite numbers of TCP-friendly polynomial algorithms could be formulated by assuming polynomial of different order. This paper analyses the interaction between two models (named as MIMD-Poly and PIPD-Poly) of these generalized algorithms and the TCP variants in TCP/IP networks. TCP compatibility of these algorithms is evaluated using the simulations of the implementations of the proposed two models. Simulations are done using ns2, a discrete event simulator. The results of simulation are compared with that of the TCP variants such as TCP/Tahoe, TCP/Reno, TCP/NewReno, and TCP/Fast. The comparison shows that both the poly algorithms perform better in terms of long term throughput