Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Partridge, C., Mendez, T., Milliken, W.: Host Anycast Service. RFC 1546 (1993)
Bhattacharjee, S., Ammar, M.H., Zegura, E.W., Shah, V., Fei, Z.: Application Layer Anycasting. In: Proc. IEEE INFOCOM (1997)
Fei, Z., Bhattacharjee, S., Zegura, E.W., Ammar, M.H.: A Novel Server Selection Technique for Improving the Response Time of a Replicated Service. In: Proc. IEEE INFOCOM (1998)
Zegura, E.W., Ammar, M.H., Fei, Z., Bhattacharjee, S.: Application-layer Anycasting: a Server Selection Architecture and Use in a Replicated Web Service. IEEE/ACM Transactions on Networking (2000)
Katabi, D., Wroclawski, J.: A Framework for Scalable Global IP-Anycast (GIA). In: Proc. ACM SIGCOMM (2000)
Napster, http://www.napster.com/
The Gnutella protocol specification (2000), http://dss.clip2.com/GnutellaProtocol04
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Workshop on Design Issues in Anonymity and Unobservability (2000)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: Proc. ACM SIGCOMM (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. Middleware (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-Resilient Wide-area Location and Routing. Technical Report UCB//CSD- 01-1141, U. C. Berkeley (2001)
Rowstron, A., Kermarrec, A.M., Castro, M., Druschel, P.: Scribe: The design of a large-scale event notification infrastructure. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, p. 30. Springer, Heidelberg (2001)
Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R.H., Kubiatowicz, J.: Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination. In: Proc. NOSSDAV 2001 (2001)
Zhang, R., Hu, Y.C.: Borg: A hybrid protocol for scalable application-level multicast in peer-to-peer systems. In: Proc. NOSSDAV 2003 (2003)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level Multicast using Content-Addressable Networks. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, p. 14. Springer, Heidelberg (2001)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting Network Proximity in Distributed Hash Tables. In: Proc. FuDiCo (2002)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in peer-to-peer overlay networks. Technical report MSR-TR-2002-82 (2002)
FreePastry. http://www.cs.rice.edu/CS/Systems/Pastry/FreePastry/
Zegura, E., Calvert, K., Bhattacharjee, S.: How to Model an Internetwork. In: Proc. IEEE INFOCOM (1996)
Bolosky, W.J., Douceur, J.R., Ely, D., Theimer, M.: Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs. In: Proc. SIGMETRICS (2000)
Katabi, D.: The Use of IP-anycast for Building Efficient Multicast Trees. In: Proc. Global Internet Symposium (1999)
Kim, D., Meyer, D., Kilmer, H.: Anycast RP mechanism using PIM and MSDP. RFC 3446 (2001)
Francis, P., Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: IDMaps: A Global Internet Host Distance Estimation Service. IEEE/ACM Transactions on Networking (2001)
Ng, T.S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates- Based Approaches. In: Proc. IEEE INFOCOM (2002)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-Aware Overlay Construction and ServerSelection. In: Proc. IEEE INFOCOM (2002)
Stoica, I., Adkins, D., Zhaung, S., Shenker, S., Surana, S.: Internet Indirection Infrastructure. In: Proc. ACM SIGCOMM (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, R., Hu, Y.C. (2003). Anycast in Locality-Aware Peer-to-Peer Overlay Networks. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds) Group Communications and Charges. Technology and Business Models. NGC ICQT 2003 2003. Lecture Notes in Computer Science, vol 2816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39405-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-39405-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20051-2
Online ISBN: 978-3-540-39405-1
eBook Packages: Springer Book Archive