Introduction to IP

Multicast Routing
2002.01.31
Yun Chan Phill
Yunmir@postech.ac.kr
POSTECH
Networking and Distributed Systems Lab. - 2 -
References
Introduction to IP Multicast Routing-An IP Multicast
Initiative White Paper
Stardust Technologies, Inc
Multicast Routing Algorithms and Protocols:A
Tutorial
Laxman H. Sahasrabuddhe & Biswanath Mukerjee
IEEE Network, Jan./Feb. 2000
Intra- And Inter- Domain Multicast Routing
Protocols: A Survey And Taxonmy
Maria Ramalho
IEEE Communications Surveys & Tutorials, vol.3, no.1,
2000.
POSTECH
Networking and Distributed Systems Lab. - 3 -
Contents
Introduction
Multicast Routing Tree
Multicast Routing Protocols
Intra-Domain
Inter-Domain
Conclusion
POSTECH
Networking and Distributed Systems Lab. - 4 -
What is Multicasting
Ability of Communication Networks
Send packets from a source
To a group of Receivers at different
locations
With shared routes
POSTECH
Networking and Distributed Systems Lab. - 5 -
Multicast
Why Multicasting
Better bandwidth
Less Host/Router processing

Applications
video/audio conferencing for remote meetings
News feed/ File distribution
Interactive games
service advertisement
POSTECH
Networking and Distributed Systems Lab. - 6 -
Compare To Unicast
Unicast
Multicast
Source D
C
B
A
Source
D
C
B
A
POSTECH
Networking and Distributed Systems Lab. - 7 -
Multicast Group Address
Multicasting uses group address for
Identify
Managed by IGMP protocols
Use Class D IP address
224.0.0.2 239.255.255.255
224.0.0.0 not assigned to any group
224.0.0.1 assigned to permanent
group(IGMP query)
POSTECH
Networking and Distributed Systems Lab. - 8 -
Contents-MR Tree
Properties
Classification
Steiner Tree Problem
POSTECH
Networking and Distributed Systems Lab. - 9 -
Multicast Routing Tree
an acyclic(loopless) spanning tree for
support multicasting routing
All Route Multicasting Tree Route
POSTECH
Networking and Distributed Systems Lab. - 10 -
Properties of Good MR Tree
High Priority
Low cost
Low delay
Scalability
Support for dynamic multicast groups
Low Priority
Survivability
Fairness
POSTECH
Networking and Distributed Systems Lab. - 11 -
Classes of MR Trees
Source-based Tree
One Source for each MR Tree
Dense Mode, Not Scalable
App: real time multimedia

Group Shared Tree
Multi Source exist for each MR Tree
Sparse Mode, Scalable
App: software distribution
POSTECH
Networking and Distributed Systems Lab. - 12 -
Source Based Tree
A Tree Required per Source
Flood and Prune
Not scalable
Heavy control message
Hard to manage group
Dense mode
DVMRP,MOSPF, PIM-DM
POSTECH
Networking and Distributed Systems Lab. - 13 -
Source Based Tree
All Route Multicasting Tree Route
POSTECH
Networking and Distributed Systems Lab. - 14 -
Group Shared Tree
A Tree Required per Group
Center based Tree Constructing
Scalable
Light control message
Easy to Manage group
Traffic Concentration
Steiner Tree Problem occurred
Sparse Mode
CBT, PIM-SM

POSTECH
Networking and Distributed Systems Lab. - 15 -
Group Shared Tree
All Route Multicasting Tree Route
POSTECH
Networking and Distributed Systems Lab. - 16 -
Steiner Tree Problem
The Optimization Problem in MR
Group shared multicast tree
STP is a NP-complete problem
Steiner node
A MR tree nodes which do not belongs to
multicast group(e.g.:node D, E in fig)

POSTECH
Networking and Distributed Systems Lab. - 17 -
Two Steiner Trees
All Route 1st Steiner Tree Route
2nd Steiner Tree Route
POSTECH
Networking and Distributed Systems Lab. - 18 -
Properties of Good MR Protocols
Efficiency

Scalability

Easy to Implement

Incrementally deployable
POSTECH
Networking and Distributed Systems Lab. - 19 -
Classes of MR Protocols
HosttoRouter
IGMP
Intra-Domain
DVMRP, MOSPF, PIM-DM/SM, MIP
Inter-Domain
YAM, QosMIC, BGMP, PTMR-, EXPRESS
POSTECH
Networking and Distributed Systems Lab. - 20 -
Example of MR protocols
POSTECH
Networking and Distributed Systems Lab. - 21 -
Internet Group Management Protocol
Exist at IP module of host
IGMP messages
Enables a MR to keep track of group
Host membership query
Host membership reply
Join-group report
Leave-group report
POSTECH
Networking and Distributed Systems Lab. - 22 -
Contents
Intra Domain MR Protocol
RPF
DVMRP
MOSPF
CBT
PIM-DB
PIM-SM
POSTECH
Networking and Distributed Systems Lab. - 23 -
Reverse Path Forwarding
A method to Find shortest path from
one source to many receivers
flood & prune
Uses unicast routing table
Employed in many MR protocol
DVMRP, MOSPF, PIM-DM, etc.
POSTECH
Networking and Distributed Systems Lab. - 24 -
Steps of RPF
Unicast Route
All Route
First Flooding
Second Floodiing
Third Floodiing
Fourth Floodiing
MR1
MR2
MR3
MR5
MR6
MR4
MR7 MR8
MR9
POSTECH
Networking and Distributed Systems Lab. - 25 -
Distance-Vector Multicast Routing Protocol
Intra-Domain Protocol of Dense Mode
Construct source-based multicast tree
Depends on RIP, the Unicast protocol
Flood & Prune for construct tree by the
first packet
POSTECH
Networking and Distributed Systems Lab. - 26 -
Constructing DVMRP Tree
Unicast Route
All Route
First Flooding
Second Floodiing
Third Floodiing
Fourth Floodiing
MR1
MR2
MR3
MR5
MR6
MR4
MR7 MR8
MR9
POSTECH
Networking and Distributed Systems Lab. - 27 -
Resulting Spanning Tree
MR1
MR3
MR5
MR4
MR7
POSTECH
Networking and Distributed Systems Lab. - 28 -
Merits of DVMRP
Minimize the packet delivery costs
No routing loops
Support incremental deployment
Use DVMRP Tunnel for inter domain
Easy to implement
Low computational complexity
POSTECH
Networking and Distributed Systems Lab. - 29 -
Drawbacks of DVMRP
Big memory usage
Poor scalability
Waste bandwidth
Hard to Mange Group(flooding)
POSTECH
Networking and Distributed Systems Lab. - 30 -
Multicast Open Shortest Path First
Intra-Domain Protocol of Dense Mode
Depends on OSPF, Unicast Protocol
Tree is built on demand by First Packet
Every routers knows complete routing
topology
Make Source-based Tree
Dijkstra Algorithm for computing Paths
POSTECH
Networking and Distributed Systems Lab. - 31 -
Constructing MOSPF Tree
Unicast Route
All Route
First Step
Second Step
Third Step
MR1
MR2
MR3
MR5
MR6
MR4
MR7 MR8
MR9
POSTECH
Networking and Distributed Systems Lab. - 32 -
Resulting Spanning Tree
MR1
MR3
MR5
MR4
MR7
POSTECH
Networking and Distributed Systems Lab. - 33 -
Merits of MOSPF
Tree state required only on tree node
POSTECH
Networking and Distributed Systems Lab. - 34 -
Drawbacks of MOSPF
Heavy computation
Poor Scalability
Not support incremental deployment
No tunnels nor any feature for support it
Hard to Mange Group(flooding)
POSTECH
Networking and Distributed Systems Lab. - 35 -
Core Based Trees
Intra-Domain Protocol of Sparse Mode
Uses only one tree per group
To Overcome the scalability
Do not use RPF
POSTECH
Networking and Distributed Systems Lab. - 36 -
Joining a CBT Group
existing route
added route
source path
join REQ
join ACK
POSTECH
Networking and Distributed Systems Lab. - 37 -
Merits of CBT
Small Usage of routers memory space
Independent of unicast routing
protocol
Scalable
Easy to manage Multicast Group
POSTECH
Networking and Distributed Systems Lab. - 38 -
Drawbacks of CBT
Concentrates traffic(e.g.: Core Node)
Can occur routing loop
Include NP-complete problem
Selecting Core

POSTECH
Networking and Distributed Systems Lab. - 39 -
Protocol Independent Multicast
To overcome the drawbacks of DVMRP, CBT
DVMRP: protocol dependant
CBT: traffic concentration
Two modes of operations
PIM- Dense Mode
PIM Sparse Mode
POSTECH
Networking and Distributed Systems Lab. - 40 -
PIM-DM
Similar to DVMRP
RPF checks
Construct source-based tree
Data driven
Differences from DVMRP
Do not save the packet routes
Independent of unicast routing protocol

POSTECH
Networking and Distributed Systems Lab. - 41 -
Constructing PIM-DM Tree
Unicast Route
All Route
First Flooding
Second Floodiing
Third Floodiing
Fourth Floodiing
MR1
MR2
MR3
MR5
MR6
MR4
MR7 MR8
MR9
Differs from
DVMRP
Prun message
POSTECH
Networking and Distributed Systems Lab. - 42 -
PIM-SM
Similar to CBT
Construct group shared tree with core
Differences from CBT
PIM-SM can construct source-based tree
Semi-soft state
Wide deployed
POSTECH
Networking and Distributed Systems Lab. - 43 -
Construct PIM-SM SB Tree
existing route
added route
source path
join REQ
prune message
deleted route
POSTECH
Networking and Distributed Systems Lab. - 44 -
Result of Tree
POSTECH
Networking and Distributed Systems Lab. - 45 -
Inter-Domain MR Protocols
For Communicate Between different
ASes
Most Protocols in research only steps
Based on Sparse Mode assumption

POSTECH
Networking and Distributed Systems Lab. - 46 -
Border Gateway Multicast Protocol
for inter-operate with any intra-domain
MR protocols
Similar to PIM-SM
Two Components
MIGP Intra-Domain MR part
BGMP Join/Prune etc.
Use TCP for Control message

POSTECH
Networking and Distributed Systems Lab. - 47 -
BGMP Simplification
POSTECH
Networking and Distributed Systems Lab. - 48 -
Conclusion
What is a multicast tree, how
does one construct it?
Design choice
Network performance
considerations

POSTECH
Networking and Distributed Systems Lab. - 49 -
IP Address Classes
POSTECH
Networking and Distributed Systems Lab. - 50 -
Tunnel
POSTECH
Networking and Distributed Systems Lab. - 51 -
Terminologies
IGMP: Internet Group Management
Protocols
Domain: Routers run the same routing
protocols(ex: postech)