अमूर्त

Resolving Reliability and Optimization Downside in Overlie Relay Nodes Mistreatment Pastry

Dr.A.Joshi, D.Murugeswari

PASTRY andOverlie routing is a very attractive scheme that allows improving certain properties of the routing (such as delay or TCP throughput) without the need to change the standards of the current underlying routing. PASTRY is an implementation of a Distributed Hash Table(DHT) algorithm for P2P routing overlay using the PASTRY implementation the silent features to achieve the reliability,fully centralized and high fault tolerant . However, deploying overlie routing requires the placement and maintenance of overlie infrastructure. This gives rise to the optimization,reliability,high fault tolerant and highly distributed problem which we overcome in this project using . PASTRY distributed algorithm and non-trivial approximation algorithm. The current BGP routing in the Internet , where from a single source to all autonomous systems (ASs), that a small number of less than 100 relay servers is sufficient to enable routing over shortest paths reducing the average path length.