Professional Documents
Culture Documents
Part IV
Multicast Communication*
*Referred to slides by Manhyung Han at Kyung Hee University and Hitesh Ballani at Cornell
University
Unicast, Broadcast Key:
Unicast transfer
• Unicast
– One-to-one
– Destination – unique receiver
host address
• Broadcast
– One-to-all
– Destination – address of
network
• Multicast
– One-to-many
– Multicast group must be
identified
– Destination – address of group
Multicast application examples
• Financial services
– Delivery of news, stock quotes, financial indices, etc
• Remote conferencing/e-learning
– Streaming audio and video to many participants
(clients, students)
– Interactive communication between participants
• Data distribution
– e.g., distribute experimental data from Large Hadron
Collider (LHC) at CERN lab to interested physicists around
the world
IP multicast
Gatech Stanford
CMU
Berkeley
Stan2
CMU
Berk1
Berkeley
Stan2
CMU
Berk1
Berk2
Pros and Cons
• Scalability
– Routers do not maintain per-group state
– End systems do, but they participate in very few groups
• Efficiency concerns
– redundant traffic on physical links
– increase in latency due to end-systems
System structure
The overlay comprises of :
• A central source (may be replicated for fault tolerance)
• A number of overcast nodes (standard PCs with lot’s of
storage)
- organized into a distribution tree rooted at the source
- bandwidth efficient trees
• Final Consumers – members of the multicast group
- allows unmodified HTTP clients to join
Bandwidth Efficient Overlay Trees
1
10 Mb/s
R
“…three ways of organizing the root and the nodes into a distribution tree.”
R R 1 2 R 2 1
2
The node addition algorithm
R R
5
10 10
3 1 2
1 8
7
5
2 3
1 3
R1 R2 R3
2 4 6
5
Application level multicasting
• A survey on ALM