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

Abstract

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 (AIlNMD) 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 TCPfriendly 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.

Scalable TCP: Better Throughput in TCP Congestion Control Algorithms on MANETs

“…The MIMD and PIPD protocols developed and provides better throughput for the wireless networks [15], [19] and [20].…”

Study on congestion control in internet

“…Researchers proved that RED had better capability than traditional algorithms. RED drop principle is the average queue size, which could be accounted by an Exponential Weighted Moving Average(EWMA) algorithm, as (2).…”

“…Polynomial-AIMD mostly mend the increasing speed of window, it could gain more bandwidth in little time. The rules of window are following: I : Wi+R +--W, + (a Iw,)k + (a I w,)2k + (a I W,)Jk + ...... ; a > 0 (9) D: w,+8i � W , -(pw,) l -(pw,)2 1 -Cpw,l-.. ;0 < p <l (10) Reference [2] brought forward the nonlinear AIMD algorithms MIMD-Poly and PIPD-Poly ,they actually are the binomial and trinomial forms of Polynomial-AIMD. Simulations indicate that the window increasing speed of PIPD-Poly is faster than MIMD-Poly.…”