Lectures notes for 2010 - KTH

Steve Deering’s Multicast
Dynamically constructs efficient delivery trees from sender(s) to receiver(s)
• Key is to compute a spanning tree of multicast routers
Simple service model:
• receivers announce interest in some multicast address
• senders just send to that address
• routers conspire to deliver sender’s data to all interested receivers
• so the real work falls once again to the routers, not the end nodes
• Note that the assumption here is that it is worth loading the routers with this extra work,
because it reduces the traffic which has to be carried.
IGMP v1, v2, v3
Multicast Routing Protocols
PIM, CBT, DVMRP, MOSPF, MBGP, … Link-level Multicast (Ethernet)
Figure 4: IP Multicast Service Model
Maguire Steve Deering’s Multicast 8: 12 of 78
maguire@kth.se 2010.03.21 Internetworking/Internetteknik