Application-Level Multicast Using Content-Addressable Networks

  • Sylvia Ratnasamy
  • Mark Handley
  • Richard Karp
  • Scott Shenker
Conference paper

DOI: 10.1007/3-540-45546-9_2

Volume 2233 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ratnasamy S., Handley M., Karp R., Shenker S. (2001) Application-Level Multicast Using Content-Addressable Networks. In: Crowcroft J., Hofmann M. (eds) Networked Group Communication. NGC 2001. Lecture Notes in Computer Science, vol 2233. Springer, Berlin, Heidelberg

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.

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