protocol https://www.file-upload.com/qyxdgi3850y7

1. MULTICAST ROUTING
PROTOCOLS
In multicasting, the router may forward the received packet through
several of its interfaces.

2. Submitted to;
Submitted by
Date

3. Multicasting
• In multicasting , there is a one source and a group of
distination.
• In multicasting, the router may forward the received packet
through several ofits interfaces.
• The source address is a unicast address but the distination
address is a group address.

4. Multicasting routing protocol

5. Multicast link state routing
Multicast link state routing is a direct extension of
unicast routing, uses the source-base tree approach.
• Every router creates n shortest path trees ,using
Dijkstra’s algorithm.
• Problem with this protocol is the space and time
needed create and store that much trees.

6. MOSPF(multicast open shortest path first)
• it uses multicast link state routing to create source based
tree.
• It calculates trees on demand.

7. DVMRP(Distance vector multicast routing
protocol
• it uses source based router never actually makes a routing tables.
• The tree are evanescent , that is after a packet is forwarded table
is destroyed.
• To accomplish the routing ,multicast distance vector algorithm
uses a process based on one of the four decision-making
strategies ;
Flooding
Reverse path forwarding(RPF)
Reverse path broadcasting (RPB)
Reverse path multicasting (RPM)

8. DVMRP(Distance vector multicast routing
protocol)
FLOODING
• in flooding,a router receives a packet and sends it out to
every interface except the form which it was received.
• Flooding broadcasts packets not multicast.
• It creates loop in the system.

9. DVMRP(Distance vector multicast routing
protocol
REVERSE PATH FORWARDING (RPF)
• RPF eliminates the loops in the foolding process.
• In RPF, a router forwards only one copy of a packet that has
traveled the shortest path from the source to the router.
• To checkout if the packets has come thought its shortest
path RPF uses unicast routing table.

10. DVMRP(Distance vector multicast routing
protocol)
REVERSE PATH BROADCASTING
• RPB creates a shortest shortest path broadcast tree from the
source to each destination.
• It guarantees that each destination receives one and only
one copy of the packet.

11. DVMRP(Distance vector multicast routing
protocol
Reverse path multicasting (RPM)
• RPM adds prunting and grafting to RPB to create a multicast shortest
path tree that supports dynamic membership changes.
 PRUNING
• THE router sends a prune message to the upstream router ,so that
the upstream router can stop sending multicast message for this
group though that interface .
 Grafting
• the graft message forces the upstream router to resume sending the
multicast messages.

12. Protocol Independent Multicast (PIM)
• Protocol Independent Multicast (PIM) is the name given to
two independent multicast routing protocols:
• Protocol Independent Multicast, Dense Mode (PIM-DM)
PIM-DM is used in a dense multicast environment, such as a
LAN
PIM-DM uses RPF and pruning and grafting strategies to
handle multicasting. However, it is independent of the
underlying unicast protocol.

13. • Protocol Independent Multicast, Sparse Mode (PIM-SM).
PIM-SM is used in a sparse multicast environment such as a
WAN.
PIM-SM is similar to CRT but uses a simpler procedure.

14. Core-Based Tree (CBT)
• The Core-Based Tree (CBT) protocol is a group-shared
protocol that uses a core as the root of the tree.
• In CRT, the source sends the multicast packet (encapsulated
in a unicast packet) to the core router. The core router
decapsulates the packet and forwardsit to all interested
interfaces.