Interaction Between MIMD-Poly and PIPD-Poly Algorithms and Other TCP Variants in Multiple Bottleneck TCP Networks

Abstract

This paper introduces and analyzes a class of non-linear congestion control algorithms called polynomial congestion control algorithms. They generalize the Additive Increase and Multiplicative Decrease (AIMD) algorithms used for Transmission Control Protocol (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. There are infinite numbers of TCP-compatible polynomial algorithms by assuming a polynomial of a different order. This paper analyzes the interaction between the two models (Multiplicative Increase and Multiplicative Decrease/MIMD-Poly and Polynomial Increase and Polynomial Decrease/PIPD-Poly) of these generalized algorithms, for 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 the simulation are compared with TCP variants, such as TCP/Tahoe, TCP/Reno, TCP/New Reno and TCP/Vegas. The comparison shows that both algorithms perform better in terms of throughput.