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.
This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.
This paper introduces and analyses non-linear congestion control using polynomial window size adjustment algorithms. These algorithms generalize the Additive Increase Multiplicative Decrease algorithms used for the TCP Networks. They 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. They are further parameterized by α and β. There are infinite numbers of TCP-friendly polynomial algorithms by assuming polynomial of different order. This paper analyses the performance of two polynomial models, for the wired and wireless TCP networks. TCP compatibility of these algorithms for the two models are evaluated using ns2, a discrete event simulator. One such model is also proved to be TCP-friendly. The results of simulation are compared with that of TCP/Tahoe, TCP/Reno TCP/New Reno, and TCP/Fast. The comparison shows that both algorithms perform better in terms of throughput.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.