International Journal of Science and Research (IJSR) ISSN (Online): 2319-7064 Index Copernicus Value (2013): 6.14 | Impact Factor (2013): 4.438 Volume 4 Issue 5, May 2015 www.ijsr.net Licensed Under Creative Commons Attribution CC BY Overlay Routing Attempt towards Nontrivial Estimation Algorithm to Exhibit BGP Routing TCP Performance and VoIP Applications P. Theanmozhi 1 , Dr. R. Indra Gandhi 2 1 PG Research Scholar, Department of Master of Computer Applications, GKM College of Engineering and Technology Tamil Nadu State, Chennai, India 2 Head of the Department, Department of Master of Computer Applications, GKM College of Engineering and Technology Tamil Nadu State, Chennai, India Abstract: In current trend overlay routing is a very striking scheme that allows improving important properties of the routing such as delay or TCP throughput without changing the standards of the current underlying routing. Overlay routing was used to recover TCP performance over the Internet, where the main idea is to break the end-to-end feedback loop into smaller loops. These focus all nodes performance capability using TCP Piping which would be present along with the route at relatively small distances. Considering BGP based shortest-path routing over the Internet, query is mapped to minimum number of relay nodes that are needed in order to make the routing between a groups of Autonomous Systems. The main attempt of this paper follows three continual phases of evaluation. First phase deals with development of a broad algorithmic framework that can be used with efficient resource allocation in overlay routing. Second phase extend a nontrivial estimate algorithm and prove its properties. Final phase exhibit the actual benefit one can gain from using our proposal in three sensible scenarios, namely BGP routing, TCP improvement, and VoIP applications. Keywords: Autonomous systems, BGP, VoIP applications, TCP piping, overlay routing 1. Introduction An overlay network is a virtual network of nodes and logical links that is built on top of an existing network with the purpose to implement a network service that is not available in the existing network. Overlay networks allow both networking developers and application users to easily design and implement their own communication environment and protocols on top of the Internet, such as data routing and file sharing management. 2. Literature Survey On Improving Dynamic Stochastic Routing Algorithms in Overlay Networks by Chengwei Zhang et al [1] exposed a stochastic Routing algorithm to determine the detours or relay paths between a pair of end-to-end nodes for performance enhancement by taking the stochastic properties of the overlay links. The simulation results show that the proposed stochastic routing algorithm outperforms other algorithms in various network scenarios in reducing packet loss and average delay. Node Placement Analysis for Overlay Networks in IoT Applications by Yuxin Wan et al [2] describes that Internet of Things (IoT) has been regard as the future of internet and one of the key trends in order and communication technologies. The key idea of IoT is combining identification and communication technologies to provide a better description of physical processes. Load-Balanced One-hop Overlay Multipath Routing with Path Diversity by Jingyu Wang et al [3] expressed that Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one- hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. Cost-Effective Resource Allocation of Overlay Routing Relay Nodes Rami Cohen et al [4] added their contribution in Routing. According Cohen et al Overlay routing is a very attractive scheme that al-lows improving certain properties of the routing (such as delay or TCP throughput) without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. Network Information Flow Yeung, R.W. Study identified the problem with one information source, and they have obtained a simple characterization of the admissible coding rate region. Author registered their result using max-flow min-cut theorem for network information flow. Contrary to one's intuition, their work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. How Good Is Random Linear Coding Based Distributed Networked Storage by Ralf Koetter et al [6] states the framework consideration in multiple storage locations, each of which only have very limited storage space for each file. Each storage location chooses a part of the file without the knowledge of what is stored in the other locations. A High-Throughput Overlay Multicast Infrastructure with Network Coding by Mea Wang et al [7] recently proposed information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End hosts in overlay networks are natural Paper ID: SUB154476 1652