The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Interaction Between MIMD-Poly & PIPD-Poly Algorithms and other TCP Variants in Multiple Bottleneck TCP Networks
Abstract
This chapter introduces and analyses a class of non-linear congestion control algorithms called polynomial congestion control algorithms. These generalize the Additive Increase and Multiplicative Decrease (AIMD) algorithms used for the 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 polynomial of different order. This chapter analyses the interaction between the two models (named as MIMD-Poly and PIPD-Poly) of these generalized algorithms, for the 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 simulation are compared with that of the 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.
Related Content
|
S. Vijay Anand, Sathis Kumar B..
© 2023.
12 pages.
|
|
Sudarson Rama Perumal, Muthumanikandan V., Sushmitha J..
© 2023.
30 pages.
|
|
Sipra Swain, Biswa Ranjan Senapati, Pabitra Mohan Khilar.
© 2023.
31 pages.
|
|
Uma Mageswari R., Nallarasu Krishnan, Mohammed Sirajudeen Yoosuf, Murugan K., Sankar Ram C..
© 2023.
20 pages.
|
|
Divya L., Pradeep Kumar T. S..
© 2023.
15 pages.
|
|
Pradeep Kumar T. S., Vetrivelan P..
© 2023.
15 pages.
|
|
Vanitha Veerasamy, Rajathi Natarajan.
© 2023.
16 pages.
|
|
|