15-441 Computer Networking
Lecture 12 – Multicast
Multicast Routing
• Unicast: one source to one destination
• Multicast: one source to many destinations
• Main goal: efficient data distribution
Lecture 12: 02-17-2005 2
Overview
• IP Multicast Service Basics
• Host/Router Interaction
• Multicast Routing Basics
• MOSPF/DVMRP
• Overlay Multicast
Lecture 12: 02-17-2005 3
Multicast – Efficient Data Distribution
Src Src
Lecture 12: 02-17-2005 4
Example Applications
• Broadcast audio/video
• Push-based systems
• Software distribution
• Web-cache updates
• Teleconferencing (audio, video, shared
whiteboard, text editor)
• Multi-player games
• Server/service location
• Other distributed applications
Lecture 12: 02-17-2005 5
IP Multicast Architecture
Service model Hosts
Host-to-router protocol
(IGMP)
Routers
Multicast routing protocols
(various)
Lecture 12: 02-17-2005 6
Logical Naming
• Single name/address maps to logically related set
of destinations
• Destination set = multicast group
• Key challenge: scalability
• Single name/address independent of group growth or
changes
Lecture 12: 02-17-2005 7
Multicast Router Responsibilities
• Learn of the existence of multicast groups
(through advertisement)
• Identify links with group members
• Establish state to route packets
• Replicate packets on appropriate interfaces
• Routing entry:
Src, incoming interface List of outgoing interfaces
Lecture 12: 02-17-2005 8
IP Multicast Service Model (rfc1112)
• Each group identified by a single IP address
• Groups may be of any size
• Members of groups may be located anywhere in the
Internet
• Members of groups can join and leave at will
• Senders need not be members
• Group membership not known explicitly
• Analogy:
• Each multicast address is like a radio frequency, on which anyone
can transmit, and to which anyone can tune-in.
Lecture 12: 02-17-2005 9
IP Multicast Addresses
• Class D IP addresses
• [Link] – [Link]
1 110 Group ID
• How to allocated these addresses?
• Well-known multicast addresses, assigned by IANA
• Transient multicast addresses, assigned and reclaimed
dynamically, e.g., by “sdr” program
Lecture 12: 02-17-2005 10
IP Multicast API
• Sending – same as before
• Receiving – two new operations
• Join-IP-Multicast-Group(group-address, interface)
• Leave-IP-Multicast-Group(group-address, interface)
• Receive multicast packets for joined groups via normal
IP-Receive operation
• Implemented using socket options
Lecture 12: 02-17-2005 11
Multicast Scope Control – Small TTLs
• TTL expanding-ring search to reach or find a
nearby subset of a group
Lecture 12: 02-17-2005 12
Multicast Scope Control – Large TTLs
• Administrative TTL Boundaries to keep multicast traffic
within an administrative domain, e.g., for privacy or
resource reasons
The rest of the Internet
TTL threshold set on
interfaces to these links,
greater than the diameter
An administrative domain of the admin. domain
Lecture 12: 02-17-2005 13
Overview
• IP Multicast Service Basics
• Host/Router Interaction
• Multicast Routing Basics
• MOSPF/DVMRP
• Overlay Multicast
Lecture 12: 02-17-2005 14
IP Multicast Architecture
Service model
Hosts
Host-to-router protocol
(IGMP)
Routers
Multicast routing protocols
(various)
Lecture 12: 02-17-2005 15
Internet Group Management Protocol
• End system to router protocol is IGMP
• Each host keeps track of which mcast groups are
subscribed to
• Socket API informs IGMP process of all joins
• Objective is to keep router up-to-date with group
membership of entire LAN
• Routers need not know who all the members are, only
that members exist
Lecture 12: 02-17-2005 16
How IGMP Works
Routers: Q
Hosts:
• On each link, one router is elected the “querier”
• Querier periodically sends a Membership Query message to the
all-systems group ([Link]), with TTL = 1
• On receipt, hosts start random timers (between 0 and 10
seconds) for each multicast group to which they belong
Lecture 12: 02-17-2005 17
How IGMP Works (cont.)
Routers: Q
Hosts: G G G G
• When a host’s timer for group G expires, it sends a Membership
Report to group G, with TTL = 1
• Other members of G hear the report and stop their timers
• Routers hear all reports, and time out non-responding groups
Lecture 12: 02-17-2005 18
How IGMP Works (cont.)
• Note that, in normal case, only one report
message per group present is sent in response
to a query
• Power of randomization + suppression
• Query interval is typically 60-90 seconds
• When a host first joins a group, it sends one or
two immediate reports, instead of waiting for a
query
Lecture 12: 02-17-2005 19
Overview
• IP Multicast Service Basics
• Host/Router Interaction
• Multicast Routing Basics
• MOSPF/DVMRP
• Overlay Multicast
Lecture 12: 02-17-2005 20
IP Multicast Architecture
Service model
Hosts
Host-to-router protocol
(IGMP)
Routers
Multicast routing protocols
(various)
Lecture 12: 02-17-2005 21
Routing Techniques
• Basic objective – build distribution tree for multicast
packets
• Flood and prune
• Begin by flooding traffic to entire network
• Prune branches with no receivers
• Examples: DVMRP, PIM-DM
• Unwanted state where there are no receivers
• Link-state multicast protocols
• Routers advertise groups for which they have receivers to entire
network
• Compute trees on demand
• Example: MOSPF
• Unwanted state where there are no senders
Lecture 12: 02-17-2005 22
Routing Techniques
• Core based protocols
• Specify “meeting place” aka core
• Sources send initial packets to core
• Receivers join group at core
• Requires mapping between multicast group address
and “meeting place”
• Examples: CBT, PIM-SM
Lecture 12: 02-17-2005 23
Shared vs. Source-based Trees
• Source-based trees
• Separate shortest path tree for each sender
• DVMRP, MOSPF, PIM-DM, PIM-SM
• Shared trees
• Single tree shared by all members
• Data flows on same tree regardless of sender
• CBT, PIM-SM
Lecture 12: 02-17-2005 24
Source-based Trees
Router
S Source
R Receiver
R
R
R
S
Lecture 12: 02-17-2005 25
Shared Tree
Router
S Source
R Receiver
R
R
RP
R
S
S
Lecture 12: 02-17-2005 26
Shared vs. Source-Based Trees
• Source-based trees
• Shortest path trees – low delay, better load distribution
• More state at routers (per-source state)
• Efficient for in dense-area multicast
• Shared trees
• Higher delay (bounded by factor of 2), traffic concentration
• Choice of core affects efficiency
• Per-group state at routers
• Efficient for sparse-area multicast
• Which is better? extra state in routers is bad!
Lecture 12: 02-17-2005 27
Overview
• IP Multicast Service Basics
• Host/Router Interaction
• Multicast Routing Basics
• MOSPF/DVMRP
• Overlay Multicast
Lecture 12: 02-17-2005 28
Multicast OSPF (MOSPF)
• Add-on to OSPF (Open Shortest-Path First,
a link-state, intra-domain routing protocol)
• Multicast-capable routers flag link state routing
advertisements
• Link-state packets include multicast group
addresses to which local members have joined
• Routing algorithm augmented to compute
shortest-path distribution tree from a source to any
set of destinations
Lecture 12: 02-17-2005 29
Example
Source 1
Z
Receiver 1
Receiver 2
Lecture 12: 02-17-2005 30
Link Failure/Topology Change
Source 1
Z
Receiver 1
Receiver 2
Lecture 12: 02-17-2005 31
Membership Change
Source 1
Z
Receiver 3
Receiver 1
Receiver 2
Lecture 12: 02-17-2005 32
Impact on Route Computation
• Can’t pre-compute multicast trees for all possible
sources
• Compute on demand when first packet from a
source S to a group G arrives
• New link-state advertisement
• May lead to addition or deletion of outgoing interfaces if
it contains different group addresses
• May lead to re-computation of entire tree if links are
changed
Lecture 12: 02-17-2005 33
Distance-Vector Multicast Routing
• DVMRP consists of two major components:
• A conventional distance-vector routing protocol (like
RIP)
• A protocol for determining how to forward multicast
packets, based on the routing table
• DVMRP router forwards a packet if
• The packet arrived from the link used to reach the
source of the packet (reverse path forwarding check –
RPF)
• If downstream links have not pruned the tree
Lecture 12: 02-17-2005 34
Example Topology
G G
Lecture 12: 02-17-2005 35
Broadcast with Truncation
G G
G
Lecture 12: 02-17-2005 36
Prune
G G
Prune (s,g)
S Prune (s,g)
G
Lecture 12: 02-17-2005 37
Graft
G G
G
Report (g)
Graft (s,g)
S Graft (s,g)
G
Lecture 12: 02-17-2005 38
Steady State
G G
G
G
Lecture 12: 02-17-2005 39
Overview
• IP Multicast Service Basics
• Host/Router Interaction
• Multicast Routing Basics
• MOSPF
• Overlay Multicast
Lecture 12: 02-17-2005 40
Failure of IP Multicast
• Not widely deployed even after 15 years!
• Use carefully – e.g., on LAN or campus, rarely over
WAN
• Various failings
• Scalability of routing protocols
• Hard to manage
• Hard to implement TCP equivalent
• Hard to get applications to use IP Multicast without
existing wide deployment
• Hard to get router vendors to support functionality and
hard to get ISPs to configure routers to enable
Lecture 12: 02-17-2005 41
Supporting Multicast on the Internet
Application
? At which layer should
multicast be implemented?
IP ?
Network
Internet architecture
Lecture 12: 02-17-2005 42
IP Multicast
MIT
Berkeley
UCSD
routers
CMU
end systems
multicast flow
• Highly efficient
• Good delay
Lecture 12: 02-17-2005 43
End System Multicast
MIT1
MIT
Berkeley
MIT2
UCSD
CMU1
CMU
CMU2
Berkeley MIT1
Overlay Tree
MIT2
UCSD
CMU1 CMU2
Lecture 12: 02-17-2005 44
Potential Benefits Over IP Multicast
• Quick deployment
• All multicast state in end systems
• Computation at forwarding points simplifies
support for higher level functionality
MIT1
MIT
Berkeley
MIT2
UCSD
CMU1
CMU
CMU2
Lecture 12: 02-17-2005 45
Concerns with End System Multicast
• Self-organize recipients into multicast delivery overlay tree
• Must be closely matched to real network topology to be efficient
• Performance concerns compared to IP Multicast
• Increase in delay
• Bandwidth waste (packet duplication)
• Penalty can be kept small in practice
Berkeley MIT1 Berkeley MIT1
UCSD MIT2 MIT2
UCSD
CMU1
CMU1
IP Multicast CMU2 End System Multicast
CMU2
Lecture 12: 02-17-2005 46
Important Concepts
• Multicast provides support for efficient data
delivery to multiple recipients
• Requirements for IP Multicast routing
• Keeping track of interested parties
• Building distribution tree
• Broadcast/suppression technique
• Difficult to deploy new IP-layer functionality
• End system-based techniques can provide similar
efficiency
• Easier to deploy
Lecture 12: 02-17-2005 47
Next Lecture: DNS
• How to resolve names like [Link] into
IP addresses
Lecture 12: 02-17-2005 48
EXTRA SLIDES
The rest of the slides are FYI