International Journal of Soft Computing
ISSN: OnlineISSN: Print 1816-9503
Abstract
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.
How to cite this article:
M. Chandrasekaran and R.S.D.Wahida Banu . Interaction Between Polynomial Congestion Control Algorithms and Queue Management Schemes in Wired TCP Networks.
DOI: https://doi.org/10.36478/ijscomp.2006.83.90
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2006.83.90