Application-Level Multicast Using Content-Addressable Networks

  • Sylvia Ratnasamy
  • Mark Handley
  • Richard Karp
  • Scott Shenker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2233)

Abstract

Most currently proposed solutions to application-level multicast organise the group members into an application-level mesh over which a Distance-Vector routingp rotocol, or a similar algorithm, is used to construct source-rooted distribution trees. The use of a global routing protocol limits the scalability of these systems. Other proposed solutions that scale to larger numbers of receivers do so by restricting the multicast service model to be single-sourced. In this paper, we propose an application-level multicast scheme capable of scaling to large group sizes without restrictingthe service model to a single source. Our scheme builds on recent work on Content-Addressable Networks (CANs). Extendingthe CAN framework to support multicast comes at trivial additional cost and, because of the structured nature of CAN topologies, obviates the need for a multicast routingalg orithm. Given the deployment of a distributed infrastructure such as a CAN, we believe our CAN-based multicast scheme offers the dual advantages of simplicity and scalability.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Y. Chawathe, S. McCanne, and E. Brewer. An architecture for internet content distribution as an infrastructure service. Available at http://www.cs.berkeley.edu/~yatin/papers, 2000.
  2. 2.
    S. E. Deering. Multicast Routing in a Datagram Internetwork. PhD thesis, Stanford University, Dec. 1991.Google Scholar
  3. 3.
    P. Francis. Yoid: Extendingthe internet multicast architecture. Unpublished paper, available at http://www.aciri.org/yoid/docs/index.html, Apr. 2000.
  4. 4.
    Y. hua Chu, S. Rao, and H. Zhang. A case for end system multicast. In Proceedings of SIGMETRICS 2000, Santa Clara, CA, June 2000.Google Scholar
  5. 5.
    J. Jannotti, D. Gifford, K. Johnson, F. Kaashoek, and J. O’Toole. Overcast: Reliable multicastingwit h an overlay network. In Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, CA, Oct. 2000.Google Scholar
  6. 6.
    S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of SIGCOMM 2001, Aug. 2001.Google Scholar
  7. 7.
    A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routingfor large-scale peer-to-peer systems. Available at http://research.microsoft.com/~antr/PAST/, 2001.
  8. 8.
    I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001, Aug. 2001.Google Scholar
  9. 9.
    E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings IEEE Infocom’ 96, San Francisco, CA, May 1996.Google Scholar
  10. 10.
    B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for faulttolerant wide-area location and routing. Available at http://www.cs.berkeley.edu/~ravenben/tapestry/, 2001.
  11. 11.
    S. Q. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of the Eleventh International Workshop on Network and OS Support for Digital Audio and Video, New York, July 2001. ACM.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Sylvia Ratnasamy
    • 1
    • 2
  • Mark Handley
    • 2
  • Richard Karp
    • 1
    • 2
  • Scott Shenker
    • 2
  1. 1.University of CaliforniaBerkeleyUSA
  2. 2.AT&T Center for Internet Research at ICSIUSA

Personalised recommendations