Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Innovative Research in Computer and Communication Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
