Overlay Routing Attempt towards Nontrivial Estimation Algorithm to Exhibit BGP Routing TCP Performance and VoIP Applications

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.