Performance Evaluation of Polynomial Congestion Control Algorithms in Mobile Ad hoc TCP Networks
M. Chandrasekaran, Reshma Banu · IETE Journal of Research · 2007
This paper introduces and analyses a class of non-linear congestion control algorithms called polynomial congestion control algorithms. These algorithms 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 of these generalized algorithms for Mobile Ad hoc TCP networks. TCP compatibility of these algorithms are evaluated using the simulations of the implementations of the proposed two models. Simulations are done using ns2, a discrete event simulator. One such model is also proved to be TCP-compatible. The results of simulation are compared with that of TCP and TCP/Reno.