MULTICASTING
Concepts, Algorithms and Protocols
Introduction
What is Multicasting?
Real Life Applications of Multicasting
Multicasting
Online TV, Stock Market
Radio Updates
Video Internet
Conferencing Gaming
Concepts
“Groups” in Multicasting
Multicasting Addressing
Managed by IANA(Internet Assigned Numbers Authority)
IANA Approved
address Range
224.0.0.0-239.255.255.255
Special Purposes
e.g.(to exchange Globally Scoped
link state Addresses
information)
224.0.0.0-224.0.0.255 224.0.1.0-238.255.255.255
Ethernet MAC Address Mapping Technique using
Multicast IP address
IANA owned block of Ethernet MAC addresses start
with 01:00:5E in hexadecimal and half of this block is
allocated for multicast addresses
IGMP(Internet Group Management Protocol)
For Dynamically Registration of the Hosts in
Multicast Network
IGMP Packet Format
Type field (indicating different types of IGMP packets)
Type 11 is the IGMP membership query.
Type 12 is the IGMP version 1 membership report.
Type 16 is the IGMP version 2 membership report.
Versions of IGMP
Version
1
Version
IGMP 2
Version
3
Algorithms
Multicasting Routing Algorithms
Flooding
Spanning Trees
Reverse Path Forwarding (RPF)
Truncated Reverse Path Forwarding (TRPF)
Core Based Trees (CBT)
Flooding
Simplest Algorithm
Serious Drawbacks
Pointless Duplicate Copies
Bandwidth Wastage
Inefficient usage of Router Memory
Spanning Trees
Efficient than Flooding Algorithm
Spanning Trees
Advantage
Router will have to keep track of only 1 field
Disadvantages
Centralizes all Traffic on a single link
Doesn't consider the Group Membership
Reverse Path Broadcast (RPF)
Modified form of Spanning Trees
Implicitly Spanned Trees for each source
A more refined approach for improving RPB
RPB
Advantage
Very Fast
Better Utilization of Network
Disadvantage
Doesn’t take into account the Multicast Group
Membership info.
Truncated Reverse Path Broadcast(TRPB)
Proposed to overcome some of the limitations of
RPB algorithm
IGMP practiced
Concept of Leaf Router
Drawback
Unnecessary traffic on Non-Leaf Subnets which don’t
have the group member
Reverse Path Multicasting(RPM)
An enhancement to RPB and TRPB
Delivery Tree spans only if:
Subnetwork has a Group Member
Routers and Subnetworks along shortest path
RPM
“Prune Message”
Truncation of a Delivery Tree
RPM
Prune State should be Refreshed at regular intervals
Drawback
Relatively Large Router Memory Space needed for
maintaining state information
Core Based Trees(CBT)
Most Latest Algorithm
One of its kind
Creates a single delivery tree for each group
“Core” of CBT
Unicast system is also used
CBT In Service
CBT
Advantage
Routers will have to keep less info
Network Bandwidth Conserved
Disadvantage
Single Tree may lead to Traffic concentration
Protocols
Distance Vector Multicast Routing Protocol (DVMRP)
Multicast Extension to OSPF (MOSPF)
Protocol Independent Multicast (PIM)
PIM-DM (for densely spaced Members)
PIM-SM (for sparsely spaced Members)
Distance Vector Multicast Routing Protocol(DVMRP)
Formulated from RIP(Routing Information Protocol)
Difference Between RIP and DVMRP
Earlier Versions Uses RPB and TRPB
Latest Tactic is to use RPM
Grafting Back in case of new Joining
Multicast Extension to OSPF (MOSPF)
Build on top of OSPF
Delivery Tree Constructed using IGMP and OSPF
database
Most significant aspect:
Support of Hierarchal Routing
MOSPF
Hierarchal Routing
Intra-Area Routing
Inter-Area Routing
Inter-AS Routing
Interne
t
AS-1 AS-2
Area-1 Area-2 Area
MOSPF
Intra-Area Routing
OSPF link state database is used
Group-Membership-LSA
“Forwarding Cache” at each Router
MOSPF
Inter-Area Routing
ABR’s as “inter-area multicast forwarders”
Wild-Card Multicast Receivers
MOSPF
Inter-AS Routing
The technique used is very similar to Inter-Area
Routing
Protocol-Independent
Multicast(PIM)
Being Developed by IDMR a working group of
IETF
Objective is to develop a Multicast Routing Protocol
independent of any particular Unicast Protocol
Deficiency of DVMRP and MOSPF
No good for sparsely distributed group members
PIM
To address the issue of sparsely spaced members
PIM introduces 2 protocols:
PIM-DM (efficient for dense distributions)
PIM-SM (efficient for sparse distributions)
Both use same control messages
PIM-DM(DENSE MODE)
Uses a push model
Very efficient if active members on each subnet
Flood and Prune Mechanism
PIM-SM(SPARSE MODE)
Uses a pull model
Major Difference between PIM-SM and other
stated Protocols
Introduction of Rendezvous Point (RP)
PIM-SM(SPARSE MODE)
PIM-SM(SPARSE MODE)
Source to Group Sends
MBone(Multicast Backbone)
Launched in 1992
At Start: 40 subnets in 4 countries
Now-a-Days: 3400 subnets in 25 different countries
November 1994 Rolling Stones concert at the Cotton Bowl in
Dallas with 50,000 fans was the "first major cyberspace
multicast concert" Mick Jagger opened the concert by saying,
"I wanna say a special welcome to everyone that's, uh, climbed into the Internet tonight and, uh,
has got into the M-bone. And I hope it doesn't all collapse."
Future Research in
Multicasting
Thanks
Muhammad Yasir
Husnain Ahmad
