0% found this document useful (0 votes)
43 views21 pages

Multicast Protocols: Presented by Spandana N

Multicast protocols allow efficient one-to-many and many-to-many distribution of data by sending packets from a single source to multiple receivers simultaneously. There are two main types of multicast protocols: source-based tree protocols which form trees based on the source of the packets, and group-shared tree protocols which use a rendezvous point. Some examples of multicast protocols discussed are DVMRP, which uses distance vector routing to build source-based trees, and PIM Sparse Mode, which uses a shared tree to initially distribute multicast data and can later switch to a source-based tree. Key challenges in multicast include authentication, authorization, encryption of data, and key distribution.

Uploaded by

spandana n
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views21 pages

Multicast Protocols: Presented by Spandana N

Multicast protocols allow efficient one-to-many and many-to-many distribution of data by sending packets from a single source to multiple receivers simultaneously. There are two main types of multicast protocols: source-based tree protocols which form trees based on the source of the packets, and group-shared tree protocols which use a rendezvous point. Some examples of multicast protocols discussed are DVMRP, which uses distance vector routing to build source-based trees, and PIM Sparse Mode, which uses a shared tree to initially distribute multicast data and can later switch to a source-based tree. Key challenges in multicast include authentication, authorization, encryption of data, and key distribution.

Uploaded by

spandana n
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

MULTICAST PROTOCOLS

PRESENTED BY
SPANDANA N
Introduction

 It’s an efficient mean of sending packet from a single source


to group of receivers simultaneously on a network.
 Multicast can be one-to-many or many-to-many distribution.
 Multicasting is done by sending the unicast packets.
Multicast Routing
Advantages of Multicasting

 Enhanced Efficiency
 Optimized performances
 Distributed Applications
 Efficient usage of Bandwidth
Multicast Protocols
Source Based Tree

 Tree is formed bases on the source.


 It is based on both the Source Address
that the packets originated from and the
Group address G that the packets
are addressed .
Group Shared Tree
 All multicast source register themselves to one
center point known as RP(Rendezvous point).
 When the host request for any multicast
stream, the concern router will send that
request to mapped RP.
The RP will redirect it to source.
DISTANCE VECTOR MULTICASTING
PROTOCOL [DVMRP]
 DVMRP uses the broadcast-and-prune method to build
a separate source-based tree for every multicast source.
 It uses a variant of RIP to discover the shortest path to the
source ”hence the name “Distance Vector Multicast
Routing Protocol”.
 Each multicast tree is maintained dynamically by
pruning and grafting branches as group members leave
and join the group.
OPERATION

 The first task when a DVMRP router comes online is to


discover its neighbors using Probe packets
 It makes three decisions during the process:
1. Reverse Path Forwarding (RPF)
2. Reverse Path Broadcasting (RPB)
3. Reverse Path Multicasting (RPM)
Reverse Path Forwarding (RPF)
 To prevent loops, only one copy is forwarded;
the other copies are dropped.
 In RPF, a router forwards only the copy that
has traveled the shortest path from the source
to the router.
 The router extracts the source address of
the multicast packet and consults its
unicast routing table.
Reverse Path Broadcasting (RPB)
 To eliminate the duplication of packets ,
only one router is assigned as parent router
for each network(fig 1)
 In RPB, for each source, the router sends
Fig 1
the packet only out of those interfaces
for which it is the designated parent
 The designated parent router can be
the router with the shortest path to the source.

Fig 2
Reverse Path Multicasting (RPM)

 RPM adopts the procedures of Pruning and


Grafting
 Pruning: A router can send a prune message
to its upstream router whenever it finds that its
network is not interested in a multicast packet.
Pruning
In this way a router prunes (cuts) its network
from multicasting.
 Grafting:The graft message forces the
upstream router to resume sending the
multicast messages
Grafting
Drawbacks of DVMRP

 The main drawbacks of Distance Vector are limited scalability due


to slow convergence time, bandwidth consumption and routing
loops.
 Packets are unnecessarily received by all routers.
 Routers receive duplicate packets.
PROTOCOL INDEPENDENT MULTICAST
 Protocol Independent Multicast (PIM) is a collection of
multicast routing protocols, each optimized for a
different environment.
 Though PIM is multicast protocol but it takes help of
existing unicast routing protocol to make RPF check and
to perform multicast routing/forwarding function
 It doesn’t send or receive multicast routing updates like
other routing protocols.
 There are two main PIM protocols:
 PIM Sparse Mode
 PIM Dense Mode
PIM Dense Mode
 PIM-DM only supports source trees and
can not be used for shared trees
 PIM-DM uses “Push” model to send
multicast data down to receivers.
 PIM-DM floods multicast data to all the
corners of the network and the routers
which do not have any downstream
receiver prune back the unwanted traffic.
.
PIM Dense Mode

Advantges Disadvantage
 It is simpler to set up.  It floods multicasts more
extensively, so it consumes more
 It does not have any points of
bandwidth.
failure.
 It does not allow source-specific
multicast routing.
 It does not allow to implement
multicast boundaries, which divide
a system into multiple multicast
domains.
PIM Sparse Mode

 PIM-SM uses shared trees to forward multicast


data.
 PIM-SM uses “Pull” model to send multicast
data down to receivers.
 Initially only shared tree will be created and
depending upon the configuration options,
traffic can remain in shared tree or can switch
to optimal source tree.
 PIM-SM uses the concept of RP.
PIM-SM sender registration PIM-SM traffic flow
PIM SparseMode

Advanatges Disadvantages
 It minimizes flooding of multicast  It is more complicated to set up.
traffic and so uses bandwidth You must choose rendezvous
more efficiently. points (RPs) for multicast groups or
ranges of multicast groups.
 It allows you to implement source-
specific multicast routing.  RPs can be points of failure.
However, a system can include
 It allows you to implement
multiple candidate RPs (C-RPs) to
multicast boundaries.
provide resiliency.
 When planned properly, it is just as
resilient as PIM-DM.
Key challenges in Multicast

 Need authentication, authorization


 Encryption of data
 Key distribution
 Still an active area of research
THANK YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy