Ue20mc523 20211214195630

ADVANCED COMPUTER NETWORKS
Dr. Veena S
Department of Computer Applications
Routing and Next Generation IP
Dr. Veena S
Two Approaches to Multicasting
 In multicast routing, as in unicast routing, we need to create routing

trees to optimally route the packets from their source to their
destination
 However, as we discussed before, the multicast routing decision at

each router depends not only on the destination of the packet, but also
on the source of the packet
 There are two different approaches in multicast routing :
 Routing using source-based trees and group-shared trees

Shortest path tree in unicast routing
Unicasting and Multicasting
 In unicast routing, each router in the domain has a table that defines a
shortest path tree to possible destinations
 In multicast routing, each involved router needs to construct a shortest

path tree for each group
 In the source-based tree approach, each router needs to have one

shortest path tree for each group
 In the group-shared tree approach, only the core router, which has a
shortest path tree for each group, is involved in multicasting
Source-based tree approach
 If there are m groups and n sources in the internet, then the router
need to create m x n routing trees. In each tree source is the root of the
tree and the members are the leaves
Group-shared tree approach
 Here one router is designated as the Core or Rendezvous router and acts
as the representative for the group. Source unicast the packet to core
(uses tunneling concept) and the core multicast it to the group members
 Core creates one tree for each group, so there are m trees
Intradomain Multicast Routing Protocols
 Several Multicast routing protocols have been developed in the recent

past
 Here we discuss three of these protocols
 Two are extensions of unicast routing protocols (RIP and OSPF), using
the source-based tree approach
 The third is an independent protocol which is becoming more and

more popular. It can be used in both the modes
DVMRP
 The Distance Vector Multicast Routing Protocol (DVMRP) is the

extension of the Routing Information Protocol (RIP) which is used in
unicast routing
 It uses the source-based tree approach to multicasting
 It is worth mentioning that each router in this protocol that receives a

multicast packet to be forwarded implicitly creates a source-based
multicast tree in three steps as discussed below
DVMRP
1. The router uses an algorithm called Reverse Path Forwarding (RPF)

to simulate creating part of the optimal source-based tree between the
source and itself
2. The router uses an algorithm called Reverse Path Broadcasting (RPB)

to create a broadcast tree whose root is the router itself and whose
leaves are all networks in the internet
3. The router uses an algorithm called Reverse Path Multicasting (RPM)

to create a multicast tree by cutting some branches of the tree that end
in networks with no member in the group
Reverse Path Forwarding (RPF)
 Forces the router to forward a packet

from one specific interface – the one
which has come through the shortest
path from the source to the router
 It refers to Unicast Routing Table for

this purpose. The router finds the next
router in the shortest path from itself
to the source (reverse path)
 The router accepts multicast packet

if it arrives from this interface. Thus it
avoids Looping in the internet
Reverse Path Broadcasting (RPB)
 RPF helps a router to forward only one copy received from a source
and drop the rest
 If the network connected to two routers, it may receive two copies of

same packet. To eliminate this one router is designated as the parent for
each network. Only this router forwards the multicast packet towards
that network
RPF V/S RPB
Reverse Path Multicasting (RPM)
 RPB creates a shortest path broadcast tree from the source to each
destination. It guarantees that each destination receives one and only
one copy of the packet
 RPM adds pruning and grafting to RPB to create a multicast shortest

path tree that supports dynamic membership changes
 Broadcast shortest path tree is converted to multicast shortest path

tree using by pruning the interfaces that do not have active members for
that particular group
 Uses bottom up approach – join and leave the group (uses IGMP). It is
a continuous process
RPB V/S RPM
THANK YOU
Dr. Veena S, Chairperson

[email protected]
+91 80 26721983 Extn 829

Ue20mc523 20211214195630

Uploaded by

Copyright:

Available Formats

Ue20mc523 20211214195630

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ue20mc523 20211214195630

Uploaded by

Copyright:

Available Formats

ADVANCED COMPUTER NETWORKS

Routing and Next Generation IP

 In multicast routing, as in unicast routing, we need to create routing

 However, as we discussed before, the multicast routing decision at

 There are two different approaches in multicast routing :

 Routing using source-based trees and group-shared trees

 In multicast routing, each involved router needs to construct a shortest

 In the source-based tree approach, each router needs to have one

 Several Multicast routing protocols have been developed in the recent

 Here we discuss three of these protocols

 The third is an independent protocol which is becoming more and

 The Distance Vector Multicast Routing Protocol (DVMRP) is the

 It uses the source-based tree approach to multicasting

 It is worth mentioning that each router in this protocol that receives a

1. The router uses an algorithm called Reverse Path Forwarding (RPF)

2. The router uses an algorithm called Reverse Path Broadcasting (RPB)

3. The router uses an algorithm called Reverse Path Multicasting (RPM)

 Forces the router to forward a packet

 It refers to Unicast Routing Table for

 The router accepts multicast packet

 If the network connected to two routers, it may receive two copies of

 RPM adds pruning and grafting to RPB to create a multicast shortest

 Broadcast shortest path tree is converted to multicast shortest path

Dr. Veena S, Chairperson

You might also like