Abstract: This study introduces and analyses a class of non-linear congestion control algorithms called polynomial congestion control algorithms. They generalize the AIMD algorithms used for the TCP connections. These algorithms provide additive increase using a polynomial of the inverse of the current window size and provide multiplicative decrease using the polynomial of the current window size. They are further parameterized by and . There are infinite numbers of TCP-compatible polynomial algorithms by assuming polynomial of different order. This paper analyses the performance of two models (named as MIMD-Poly and PIPD-Poly) of these generalized algorithms, for the wired (with unicast and multicast) and wireless TCP 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 model MIMD-Poly is proved to be TCP-compatible. The results of simulation are compared with that of the TCP variants such as TCP/Tahoe. TCP/Reno, TCP/New Reno and TCP/Fast. The Comparison shows that both algorithms perform better in terms of throughput.
M. Chandrasekaran and R.S.D.Wahida Banu , 2006. Performance Evaluation of Polynomial Congestion Control Algorithms Mimd-Poly and PIPD-Poly in TCP Networks. Asian Journal of Information Technology, 5: 346-357.