Improving computational efficiency using polynomial congestion control algorithms MIMD-Poly and PIPD-Poly in TCP/IP networks

Abstract

This paper proposes a technique for improving the computational efficiency using the congestion control algorithms. A class of nonlinear congestion control algorithms, called polynomial congestion control algorithms is introduced. This paper initially analyses the interaction between these 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. By increasing the congestion window size faster, the proposed algorithms capture the channel bandwidth more. This additional bandwidth acquired, helps to improve the throughput and hence the overall efficiency of computations to be done on the information transferred using this additional bandwidth. A wired TCP network is simulated using NS2 to study the interaction between the various TCP algorithms. The results of simulation are compared with that of the TCP variants such as TCP/Tahoe, TCP/Reno, TCP/NewReno, and TCP/Vegas. The comparison shows that the proposed algorithms improve the long-term throughput.