This paper advocates implementing anycast in peer-to-peer (p2p) overlay networks. We argue that anycast in p2p overlays (exemplified by Pastry, Tapestry, Chord, CAN) combines the advantages of IP anycast and existing application-layer anycast services. We show that anycast can leverage the locality-awareness embedded in existing p2p overlays. The locality-awareness of the p2p routing substrates can be extended to support anycast and anycast is achieved as the result of the enhanced locality-aware routing. We have implemented anycast in Pastry, and experiments confirm that with high probability, a message addressed to an anycast group is routed to the closest node in the group according to the proximity metric. We also evaluate the performance of anycast using a realistic failure trace and the results show that our implementation of anycast is resilient to node failures. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Zhang, R., & Hu, Y. C. (2003). Anycast in locality-aware peer-to-peer overlay networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2816, 34–46. https://doi.org/10.1007/978-3-540-39405-1_4
Mendeley helps you to discover research relevant for your work.