1 / 29

Scalable Application Layer Multicast

Scalable Application Layer Multicast. Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy. ACM SIGCOMM Computer Communication Review , Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications,  Vol. 32 no. 4, Aug 2002.

argus
Download Presentation

Scalable Application Layer Multicast

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review , Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications,  Vol. 32 no. 4, Aug 2002

  2. Outline • Introduction • Hierarchical Membership • Protocol Description • Simulation Results • Experiment Results

  3. Introduction • Network layer multicast • not widely deployed • Application layer multicast • Do not change the network infrastructure • Implement multicast forwarding functionality exclusively at end-hosts

  4. Introduction • NICE - NICE is the Internet Cooperative Environment • NICE is designed to • Support large receiver sets • Small control overhead • Low latency distribution trees

  5. Hierarchical Membership • Clients are assigned to different layers • Each layer is partitioned into a set of clusters of size between k and 3k – 1, where k is a constant parameter • All hosts belong to the lowest layer L0 • The host with the minimum maximum distance to all other hosts in the cluster is chose to be the leader

  6. Hierarchical Membership • Leaders of clusters of Li join layer Li+1 • At most logkN layers • Each host maintains state about all the clusters it belongs to and about its super-cluster

  7. Control Paths • Control paths • Exchange periodic state refreshes • For a host X, the peers on its control topology are the other members of the clusters to which X belongs • E.g. • For A0 – A1, A2, B0 • For B0 – A0, A1, A2, B1, B2, C0

  8. Data Paths • Data paths • Source-specific tree • Run the following algorithm

  9. Data Paths • Host h received data from host p • Forward the received packets to all clusters that h belongs, except that of p

  10. NICE Trees Analysis • Worst case control overhead of cluster-leader of the highest layer cluster • O(k * logkN) • Average overhead • No. of hops on data path • O(logkN)

  11. Protocol Description • Assumption • All hosts know the “Rendezvous Point” (RP) host • RP is always the leader of the single cluster in the highest layer • RP interacts with other hosts on control path, but not data path

  12. New Host Joins • Join procedure • Contact RP to get the cluster members of the highest layer • Loop until reach layer 0 • Query the members of the returned cluster and find the closest one, X • Get the members of the child-cluster of X

  13. New Host Joins • Overhead: O(k * logkN) • Latency: O(logkN) * RTT

  14. New Host Joins • Cluster-leader may change as member joins or leaves • A change in leadership of a cluster C, in layer Lj • Current leader of C removes itself from all layers > Lj • Each affected layers choose a new leader • The new leaders join their super-cluster • If the state of super-cluster is not locally available, contact RP

  15. Cluster Maintenance and Refinement • Cluster-leader periodically checks the size of its cluster in layer Li • If the cluster size exceeds the 3k - 1 limit • Split the cluster into two equal-sized clusters such that the maximum of the radii among the two clusters is minimized • If the cluster size is under k • The leader finds a closest host in layer Li+1 and merge with it

  16. Cluster Maintenance and Refinement • Each member, H, in any layer Li periodically probes all members in its super-cluster, to identify the closest member • If a host, J, that is closer to H is found, then H joins the cluster under the J

  17. Host Departure and Leader Selection • Node H leaves • Graceful leave • Send a leave message to all clusters it belongs • Ungraceful leave • Other hosts detect the leave by not receiving the periodic refresh of H • If H is leader • Each remaining member, J, select a new leader independently • Multiple leaders are resolved by the exchange of refreshes

  18. Simulation Results

  19. Simulation Results

  20. Simulation Results

  21. Simulation Results

  22. Experimental Results

  23. Experimental Results

  24. Experimental Results

  25. Experimental Results

  26. Experimental Results

  27. Experimental Results

  28. Experimental Results

  29. Conclusions • Proposed a new application layer multicast protocol • Low control overhead • Low link stress

More Related