Advertisement

Multicast in \({{\cal D\!K\!S}}(N,k,f)\) Overlay Networks

  • Luc Onana Alima
  • Ali Ghodsi
  • Per Brand
  • Seif Haridi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3144)

Abstract

Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures for Internet scale applications.

We are developing a family of infrastructures, \({{\cal D\!K\!S}}(N,k,f)\), for the construction of peer-to-peer applications. An instance of \({{\cal D\!K\!S}}(N,k,f)\) is an overlay network that implements a distributed hash table and which has a number of desirable properties: low cost of communication, scalability, logarithmic lookup length, fault-tolerance and strong guarantees of locating any data item that was inserted in the system.

In this paper, we show how multicast is achieved in \({{\cal D\!K\!S}}(N,k,f)\) overlay networks. The design presented here is attractive in three main respects. First, members of a multicast group self-organize in an instance of \({{\cal D\!K\!S}}(N,k,f)\) in a way that allows co-existence of groups of different sizes, degree of fault-tolerance, and maintenance cost, thereby, providing flexibility. Second, each member of a group can multicast, rather than having single source multicast. Third, within a group, dissemination of a multicast message is optimal under normal system operation in the sense that there are no redundant messages despite the presence of outdated routing information.

Keywords

Peer-to-Peer Computing Distributed Algorithms Multicast Distributed Hash Tables 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: DKS(N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications. In: 3rd International Symposium on Cluster Computing and the Grid - CCGRID 2003, Tokyo, Japan (May 2003)Google Scholar
  2. 2.
    Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast. Technical Report UMIACS-TR 2002-53 and CS-TR 4373 (2002)Google Scholar
  3. 3.
    Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: SCRIBE: A largescale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications (2002)Google Scholar
  4. 4.
    Ghodsi, A., Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: Self-Correcting Broadcast in Distributed Hash Tables. In: 15th IASTED International Conference, Parallel and Distributed Computing and Systems, Marina del Rey, CA, USA (November 2003)Google Scholar
  5. 5.
    Mozart Consortium (2003), http://www.mozart-oz.org
  6. 6.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. Technical Report TR-00-010, Berkeley, CA (2000)Google Scholar
  7. 7.
    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
  8. 8.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized 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), citeseer.nj.nec.com/rowstron01pastry.html CrossRefGoogle Scholar
  9. 9.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM 2001, San Deigo, CA, August 2001, pp. 149–160 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Luc Onana Alima
    • 1
  • Ali Ghodsi
    • 1
  • Per Brand
    • 2
  • Seif Haridi
    • 1
  1. 1.IMIT-Royal Institute of Technology (KTH) 
  2. 2.Swedish Institute of Computer Science (SICS) 

Personalised recommendations