Advertisement

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.

Keywords

Overlay Network Multicast Tree Node Failure IEEE INFOCOM Group Rank 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Partridge, C., Mendez, T., Milliken, W.: Host Anycast Service. RFC 1546 (1993) Google Scholar
  2. 2.
    Bhattacharjee, S., Ammar, M.H., Zegura, E.W., Shah, V., Fei, Z.: Application Layer Anycasting. In: Proc. IEEE INFOCOM (1997) Google Scholar
  3. 3.
    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) Google Scholar
  4. 4.
    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) Google Scholar
  5. 5.
    Katabi, D., Wroclawski, J.: A Framework for Scalable Global IP-Anycast (GIA). In: Proc. ACM SIGCOMM (2000) Google Scholar
  6. 6.
  7. 7.
    The Gnutella protocol specification (2000), http://dss.clip2.com/GnutellaProtocol04
  8. 8.
    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) Google Scholar
  9. 9.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: Proc. ACM SIGCOMM (2001) Google Scholar
  10. 10.
    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) Google Scholar
  11. 11.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. Middleware (2001) Google Scholar
  12. 12.
    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) Google Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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) Google Scholar
  15. 15.
    Zhang, R., Hu, Y.C.: Borg: A hybrid protocol for scalable application-level multicast in peer-to-peer systems. In: Proc. NOSSDAV 2003 (2003) Google Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting Network Proximity in Distributed Hash Tables. In: Proc. FuDiCo (2002) Google Scholar
  19. 19.
    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) Google Scholar
  20. 20.
  21. 21.
    Zegura, E., Calvert, K., Bhattacharjee, S.: How to Model an Internetwork. In: Proc. IEEE INFOCOM (1996) Google Scholar
  22. 22.
    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) Google Scholar
  23. 23.
    Katabi, D.: The Use of IP-anycast for Building Efficient Multicast Trees. In: Proc. Global Internet Symposium (1999) Google Scholar
  24. 24.
    Kim, D., Meyer, D., Kilmer, H.: Anycast RP mechanism using PIM and MSDP. RFC 3446 (2001) Google Scholar
  25. 25.
    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) Google Scholar
  26. 26.
    Ng, T.S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates- Based Approaches. In: Proc. IEEE INFOCOM (2002) Google Scholar
  27. 27.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-Aware Overlay Construction and ServerSelection. In: Proc. IEEE INFOCOM (2002) Google Scholar
  28. 28.
    Stoica, I., Adkins, D., Zhaung, S., Shenker, S., Surana, S.: Internet Indirection Infrastructure. In: Proc. ACM SIGCOMM (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Rongmei Zhang
    • 1
  • Y. Charlie Hu
    • 1
  1. 1.Purdue UniversityWest LafayetteUSA

Personalised recommendations