Welcome to the InfoSci Platform
Interaction Between MIMD-Poly & PIPD-Poly Algorithms and other TCP Variants in Multiple Bottleneck TCP Networks

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

M. Chandrasekaran, R. S.D. Wahida Banu
Copyright: © 2009 |Pages: 17
ISBN13: 9781605661483|ISBN10: 1605661481|ISBN13 Softcover: 9781616925161|EISBN13: 9781605661490
DOI: 10.4018/978-1-60566-148-3.ch006
Cite Chapter Cite Chapter

MLA

Chandrasekaran, M., and R. S.D. Wahida Banu. "Interaction Between MIMD-Poly & PIPD-Poly Algorithms and other TCP Variants in Multiple Bottleneck TCP Networks." Breakthrough Perspectives in Network and Data Communications Security, Design and Applications, edited by Indranil Bose, IGI Global, 2009, pp. 78-94. https://doi.org/10.4018/978-1-60566-148-3.ch006

APA

Chandrasekaran, M. & Banu, R. S. (2009). Interaction Between MIMD-Poly & PIPD-Poly Algorithms and other TCP Variants in Multiple Bottleneck TCP Networks. In I. Bose (Ed.), Breakthrough Perspectives in Network and Data Communications Security, Design and Applications (pp. 78-94). IGI Global. https://doi.org/10.4018/978-1-60566-148-3.ch006

Chicago

Chandrasekaran, M., and R. S.D. Wahida Banu. "Interaction Between MIMD-Poly & PIPD-Poly Algorithms and other TCP Variants in Multiple Bottleneck TCP Networks." In Breakthrough Perspectives in Network and Data Communications Security, Design and Applications, edited by Indranil Bose, 78-94. Hershey, PA: IGI Global, 2009. https://doi.org/10.4018/978-1-60566-148-3.ch006

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.