![Page 1: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/1.jpg)
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
![Page 2: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/2.jpg)
Outline
Introduction Hierarchical Membership Protocol Description Simulation Results Experiment Results
![Page 3: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/3.jpg)
Introduction
Network layer multicast not widely deployed
Application layer multicast Do not change the network infrastructure Implement multicast forwarding functionality exclusively at
end-hosts
![Page 4: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/4.jpg)
Introduction
NICE - NICE is the Internet Cooperative Environment
NICE is designed to Support large receiver sets Small control overhead Low latency distribution trees
![Page 5: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/5.jpg)
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
![Page 6: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/6.jpg)
Hierarchical Membership
Leaders of clusters of Li join layer Li+1
At most logkN layers Each host maintains state about all the cluste
rs it belongs to and about its super-cluster
![Page 7: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/7.jpg)
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
![Page 8: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/8.jpg)
Data Paths
Data paths Source-specific tree Run the following algorithm
![Page 9: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/9.jpg)
Data Paths
Host h received data from host p Forward the received packets to all clusters that h
belongs, except that of p
![Page 10: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/10.jpg)
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)
![Page 11: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/11.jpg)
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
![Page 12: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/12.jpg)
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
![Page 13: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/13.jpg)
New Host Joins
Overhead: O(k * logkN)
Latency: O(logkN) * RTT
![Page 14: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/14.jpg)
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
![Page 15: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/15.jpg)
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
![Page 16: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/16.jpg)
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
![Page 17: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/17.jpg)
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
![Page 18: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/18.jpg)
Simulation Results
![Page 19: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/19.jpg)
Simulation Results
![Page 20: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/20.jpg)
Simulation Results
![Page 21: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/21.jpg)
Simulation Results
![Page 22: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/22.jpg)
Experimental Results
![Page 23: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/23.jpg)
Experimental Results
![Page 24: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/24.jpg)
Experimental Results
![Page 25: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/25.jpg)
Experimental Results
![Page 26: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/26.jpg)
Experimental Results
![Page 27: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/27.jpg)
Experimental Results
![Page 28: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/28.jpg)
Experimental Results
![Page 29: Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of](https://reader035.vdocuments.us/reader035/viewer/2022062320/56649d435503460f94a1f8f5/html5/thumbnails/29.jpg)
Conclusions
Proposed a new application layer multicast protocol Low control overhead Low link stress