Abstract
We present an application-level implementation of anycast for highly dynamic groups. The implementation can handle group sizes varying from one to the whole Internet, and membership maintenance is efficient enough to allow members to join for the purpose of receiving a single message. Key to this efficiency is the use of a proximity-aware peer-to-peer overlay network for decentralized, lightweight group maintenance; nodes join the overlay once and can join and leave many groups many times to amortize the cost of maintaining the overlay. An anycast implementation with these properties provides a key building block for distributed applications. In particular, it enables management and location of dynamic resources in large scale peer-to-peer systems. We present several resource management applications that are enabled by our implementation.
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
Bhattachargee, S., Ammar, M., Zegura, E., Shah, N., Fei, Z.: Application layer anycasting. In: Proc IEEE Infocom 1997 (1997)
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure routing for structured peer-to-peer overlay networks. In: Proc. OSDI 2002 (December 2002)
M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Technical report MSR-TR-2002-82 (2002)
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth content distribution in a cooperative environment. In: SOSP 2003 (2003)
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth content distribution in a cooperative environment. In: IPTPS 2003 (February 2003)
Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE JSACÂ 20(8) (2002)
Castro, M., Jones, M., Kermarrec, A.-M., Rowstron, A., Theimer, M., Wang, H., Wolman, A.: An evaluation of scalable application-level multicast built using peerto- peer overlay networks. In: Proc. of INFOCOM 2003 (2003)
Dalal, Y.K., Metcalfe, R.: Reverse path forwarding of broadcast packets. Communications of the ACM 21(12), 1040–1048 (1978)
Fei, Z., Bhattachargee, S., Ammar, M., Zegura, E.: A novel server technique for improving the response time of a replicated service. In: Proc IEEE Infocom 1998 (1998)
Katabi, D., Wroclawski, J.: A Framework for Scalable Global IP-Anycast (GIA). In: Proc SIGCOMM 2000 (2000)
Mutka, M., Livny, M.: Scheduling remote processing capacity in a workstationprocessing bank computing system. In: Proc. of ICDCS 1987 (1987)
Partridge, C., Menedez, T., Milliken, W.: Host anycasting service. In: RFC 1546 (November 1993)
Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, Newport, Rhode Island, USA, June 1997, pp. 311–320 (1997)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. SIGCOMM 2001 (August 2001)
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)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Rowstron, A., Druschel, P.: Storage management and caching in PAST, a largescale, persistent peer-to-peer storage utility. In: Proc. SOSP (Octeber 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)
Stoica, I., Adkins, D., Ratnasamy, S., Shenker, S., Surana, S., Zhuang, S.: Internet indirection infrastructure. In: Proc of ACM SIGCOMM (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. SIGCOMM 2001 (2001)
van Renesse, R., Birman, K.: Scalable management and data mining using Astrolabe. In: IPTPS 2002 (2002)
Zegura, E., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: INFOCOM 1996 (1996)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faultresilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley (Apr 2001)
Zhuang, S., Zhao, B., Joseph, A., Katz, R., Kubiatowicz, J.: Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination. In: Proc. NOSSDAV 2001 (June 2001)
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
Castro, M., Druschel, P., Kermarrec, AM., Rowstron, A. (2003). Scalable Application-Level Anycast for Highly Dynamic Groups. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-39405-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20051-2
Online ISBN: 978-3-540-39405-1
eBook Packages: Springer Book Archive