TY  - JOUR
T1  - Interaction Between Polynomial Congestion Control Algorithms and Queue Management Schemes in Wired TCP Networks
AU - , M. Chandrasekaran AU - , R.S.D.Wahida Banu 
JO  - International Journal of Soft Computing
VL  - 1
IS  - 2
SP  - 83
EP  - 90
PY  - 2006
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2006.83.90
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2006.83.90
KW  - Queue Management
KW  -Polynomial Congestion control
KW  -TCP
KW  -AIMD
KW  -ns2
KW  -RED
KW  -Drop Tail
AB  - In this study, the effect of queue management schemes on various congestion control algorithms
used in wired TCP networks is compared with that of the newly proposed Polynomial Congestion Control
Algorithms. The parameter used for comparison is the total throughput. First the polynomial congestion control
algorithms are introduced and analyzed. They generalize the Additive Increase Multiplicative Decrease
algorithms and 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 of different order. This study analyses the performance of two such
models for the wired TCP networks. Simulations are done using ns2. The results show that the proposed
congestion control algorithms perform better than TCP/Tahoe, TCP/Reno, TCP/New Reno and TCP/Fast
algorithms. The effects of varying the buffer size on these algorithms are also studied.
ER  -