Advertisement

Multicast and Bulk Lookup in Structured Overlay Networks

Chapter

Abstract

Structured overlay networks are often used to implement a Distributed Hash Table (DHT) abstraction. In this chapter, we argue that structured overlay networks are suitable for doing efficient group communication. We provide algorithms that enable a node to efficiently broadcast a message to all other nodes in a structured overlay network, without inducing any redundant messages. We also provide algorithms that enasble any node to efficiently send a message to all nodes in a specified set of identifiers. Such algorithms have found usage in many structured overlay networks that implement range queries. Similarly, we provide algorithms that enable any node to efficiently send a message to the nodes responsible for any of the identifiers in a specified set of identifiers. Finally, we look at a case study of implementing efficient Application Level Multicast (ALM) using the group communication algorithms on top of structured overlay networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 1.
    L. O. Alima, S. El-Ansary, P. Brand, and S. Haridi. DKS(N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications. In Proceedings of the 3rd International Workshop on Global and Peer-To-Peer Computing on Large Scale Distributed Systems (CCGRID’03), pages 344–350, Tokyo, Japan, May 2003. IEEE Computer Society.Google Scholar
  2. 2.
    Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication subsystem for high availability. In Proceedings of 22nd International Symposium on Fault Tolerant Computing (FTCS’92), pages 76–84, Boston, MA, USA, 1992. IEEE Computer Society.Google Scholar
  3. 3.
    M. Amnefelt and J. Svenningsson. Keso – A Scalable, Reliable and Secure Read/Write Peer-to-peer File System. Master’s thesis, KTH/Royal Institute of Technology, Stockholm, Sweden, 2004.Google Scholar
  4. 4.
    H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced topics. Wiley series on parallel and distributed computing. John Wiley & Sons, second edition, 2004.Google Scholar
  5. 5.
    K. P. Birman and T. A. Joseph. Reliable communication in the presence of failures. ACM Transactions on Computer Systems (TOCS), 5(1):47–76, 1987.CrossRefGoogle Scholar
  6. 6.
    M. Castro, M. Costa, and A. Rowstron. Should we build Gnutella on a structured overlay? SIGCOMM Computing Communication Review, 34(1):131–136, 2004.CrossRefGoogle Scholar
  7. 7.
    M. Castro, M. Costa, and A. Rowstron. Debunking Some Myths About Structured and Unstructured Overlays. In Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI ’05), Boston, MA, USA, May 2005. USENIX.Google Scholar
  8. 8.
    M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications), pages 1489–1499, 2002.Google Scholar
  9. 9.
    J. Cates. Robust and Efficient Data Management for a Distributed Hash Table. Master’s thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, May 2003.Google Scholar
  10. 10.
    T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, 1996.MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    J. Chang and N. F. Maxemchuk. Reliable Broadcast Protocols. ACM Transactions on Computer Systems (TOCS), 2(3):251–273, 1984.CrossRefGoogle Scholar
  12. 12.
    Y. Chawathe. Scattercast: an adaptable broadcast distribution framework. Multimedia Systems, 9(1):104–118, 2003.CrossRefGoogle Scholar
  13. 13.
    Y.-H. Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS’00), pages 1–12, 2000.Google Scholar
  14. 14.
    S.E. Deering. Host extensions for IP multicasting. RFC 1054, May 1988. Obsoleted by RFC 1112.Google Scholar
  15. 15.
    S. El-Ansary, L. O. Alima, P. Brand, and S. Haridi. Efficient Broadcast in Structured P2P Netwoks. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), volume 2735 of Lecture Notes in Computer Science (LNCS), pages 304–314, Berkeley, CA, USA, 2003. Springer-Verlag.Google Scholar
  16. 16.
    H. Eriksson. MBONE: the multicast backbone. Communications of the ACM, 37(8):54–60, 1994.CrossRefMathSciNetGoogle Scholar
  17. 17.
    P. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, 35(2):114–131, 2003.CrossRefGoogle Scholar
  18. 18.
    M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, 1985.MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    A. Ghodsi. Distributed k-ary System: Algorithms for Distributed Hash Tables. PhD dissertation, KTH – Royal Institute of Technology, Stockholm, Sweden, October 2006.Google Scholar
  20. 20.
    V. Hadzilacos and S. Toueg. A Modular Approach to Fault-Tolerant Broadcasts and Related Problems. Technical Report TR94-1425, Cornell University, 1994.Google Scholar
  21. 21.
    N. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In Proceedings of the 4th USENIX ymposium on Internet Technologies and Systems (USITS’03), Seattle, WA, USA, March 2003. USENIX.Google Scholar
  22. 22.
    D. R. Karger and M. Ruhl. Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks. In Proceedings of the 3rd Interational Workshop on Peer-to-Peer Systems (IPTPS’04), volume 3279 of Lecture Notes in Computer Science (LNCS), pages 288–297. Springer-Verlag, 2004.Google Scholar
  23. 23.
    B. Koldehofe. Distributed Algorithms and Educational Simulation/Visualisation in Collaborative Environments. PhD thesis, Chalmers University of Technology, Gothenburg, Sweden, 2005.Google Scholar
  24. 24.
    B. Leong, B. Liskov, and E. Demaine. EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. In 12th International Conference on Networks (ICON’04), Singapore, November 2004. IEEE Computer Society.Google Scholar
  25. 25.
    X. Li, J. Misra, and C. G. Plaxton. Concurrent maintenance of rings. Distributed Computing, 19(2):126–148, 2006.CrossRefGoogle Scholar
  26. 26.
    D. Liben-Nowell, H. Balakrishnan, and D. R. Karger. Analysis of the Evolution of Peer-to-Peer Systems. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC’02), pages 233–242, New York, NY, USA, 2002. ACM Press.Google Scholar
  27. 27.
    D. Liben-Nowell, H. Balakrishnan, and D. R. Karger. Observations on the Dynamic Evolution of Peer-to-Peer Networks. In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS’02), volume 2429 of Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2002.Google Scholar
  28. 28.
    N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.Google Scholar
  29. 29.
    N. A. Lynch, D. Malkhi, and D. Ratajczak. Atomic Data Access in Distributed Hash Tables. In Proceedings of the First Interational Workshop on Peer-to-Peer Systems (IPTPS’02), Lecture Notes in Computer Science (LNCS), pages 295–305, London, UK, 2002. Springer-Verlag.Google Scholar
  30. 30.
    L. R. Monnerat and C. L. Amorim. D1ht: a distributed one hop hash table. In 20th International Parallel and Distributed Processing Symposium (IPDPS’06), 2006.Google Scholar
  31. 31.
    S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level Multicast using Content-Addressable Networks. In Third International Workshop on Networked Group Communication (NGC’01), volume 2233 of Lecture Notes in Computer Science (LNCS), pages 14–29. Springer-Verlag, 2001.Google Scholar
  32. 32.
    A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 2nd ACM/IFIP International Conference on Middleware (MIDDLEWARE’01), volume 2218 of Lecture Notes in Computer Science (LNCS), pages 329–350, Heidelberg, Germany, November 2001. Springer-Verlag.Google Scholar
  33. 33.
    B. Stefansson, A. Thodis, A. Ghodsi, and S. Haridi. MyriadStore. Technical Report TR-2006-09, Swedish Institute of Computer Science (SICS), May 2006.Google Scholar
  34. 34.
    I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proceedings of the ACM SIGCOMM 2001 Symposium on Communication, Architecture, and Protocols, pages 149–160, San Deigo, CA, August 2001. ACM Press.Google Scholar
  35. 35.
    I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (TON), 11(1):17–32, 2003.CrossRefGoogle Scholar
  36. 36.
    G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 2000.Google Scholar
  37. 37.
    B. Y. Zhao, L. Huang, S. C. Rhea, J. Stribling, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: A Global-scale Overlay for Rapid Service Deployment. IEEE Journal on Selected Areas in Communications (JSAC), 22(1):41–53, January 2004.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.SICSKistaSweden

Personalised recommendations