Practical 2

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 5

Advance ComputerNetwork (03606382) Enrollment No:

PRACTICAL - 2

AIM:- Explain Working Of PIM DNRMP protocol.

Solution:-

 PIM (Protocol Independent Multicast):

PIM is a family of multicast routing protocols that operate independently of the


underlying unicast routing protocol. PIM is used to efficiently route multicast
traffic in IP networks.

There are two primary modes of PIM:

(I). Dense Mode (DM) .

(II). Sparse Mode (SM).

 Working of PIM :

PIM combines the features of PIM and to efficiently route multicast traffic in
dense mode using a distance vector approach. Here's a simplified overview of
how it might work:

 Initial Flood:

Similar to PIM Dense Mode, multicast traffic is initially flooded to all


connected networks.

 Distance Vector Routing:

Principles are applied to build a multicast distribution tree based on distance


vectors.

Routers exchange routing information using distance vector updates,


indicating the path and distance to multicast sources.

 Reverse Path Forwarding (RPF):

Routers use the RPF algorithm to determine the reverse path to the source
of the multicast traffic.

Multicast traffic is forwarded along the reverse path to ensure that it


reaches all interested routers.

PIET-DS(CE) Page 1
Advance ComputerNetwork (03606382) Enrollment No:

 Pruning:

Similar to PIM Dense Mode, routers can send Prune messages to upstream
routers if they are not interested in receiving multicast traffic.

The distribution tree is pruned dynamically based on the received Prune


messages, optimizing the delivery of multicast traffic.

 Application Of PIM :-

 Streaming Media Services.


 Content Delivery Networks (CDNs.
 Distance Learning and E-Learning.
 Financial Market Data Distribution.
 Video Conferencing and Teleconferencing

 PIM Sparse Mode.

PIM Sparse Mode (PIM-SM) is a multicast routing protocol designed on the


assumption that recipients for any particular multicast group will be
sparsely distributed throughout the network. In other words, it is assumed
that most subnets in the network will not want any given multicast packet.
In order to receive multicast data, routers must explicitly tell their upstream
neighbors about their interest in particular groups and sources. Routers use
PIM Join and Prune messages to join and leave multicast distribution trees.

PIET-DS(CE) Page 2
Advance ComputerNetwork (03606382) Enrollment No:

 PIM Dense Mode.

PIM Dense Mode (PIM-DM) is a multicast routing protocol designed with


the opposite assumption to PIM-SM, namely that the receivers for any
multicast group are distributed densely throughout the network. That is, it is
assumed that most (or at least many) subnets in the network will want any
given multicast packet. Multicast data is initially sent to all hosts in the
network. Routers that do not have any interested hosts then send PIM Prune
messages to remove themselves from the tree.

 DVMRP (Distance Vector Multicast Routing Protocol):

DVMRP is a specific multicast routing protocol that uses distance vector


algorithms, similar to traditional routing protocols like RIP (Routing
Information Protocol).

PIET-DS(CE) Page 3
Advance ComputerNetwork (03606382) Enrollment No:
DVMRP builds a distribution tree based on the reverse path forwarding (RPF)
algorithm. It forwards multicast traffic along the reverse path from the
destination back to the source.

 Working of DVMRP :

Distance Vector Multicast Routing Protocol (DVMRP) is a multicast


routing protocol that uses distance vector algorithms to efficiently forward
multicast traffic within a network. Here's a simplified overview of how
DVMRP works:

 Neighbor Discovery:

Like unicast routing protocols, DVMRP routers discover their


neighboring routers and exchange routing information. Neighbors in the
context of DVMRP are routers that are part of the multicast group.

 Building the Multicast Distribution Tree:

DVMRP builds a multicast distribution tree for each multicast group


within the network. The tree is constructed using a process similar to the
reverse path forwarding (RPF) algorithm.

 Distance Vector Updates:


Routers exchange distance vector updates containing information about
the multicast group memberships and paths to reach those groups.

Each router maintains a routing table that includes information about the
distance and direction (next hop) to reach multicast sources and group
members.

 Reverse Path Forwarding (RPF):

The RPF algorithm is used to determine the reverse path to the source of
multicast traffic. The router checks if the incoming interface of a
multicast packet is the interface that would be used to reach the source.

 Forwarding Multicast Traffic:

PIET-DS(CE) Page 4
Advance ComputerNetwork (03606382) Enrollment No:
Multicast traffic is forwarded along the branches of the multicast
distribution tree based on the information in the routing table.

Routers use the RPF check to ensure that the multicast traffic is
forwarded in the correct direction toward the interested receivers.

 Pruning:

If a router determines that there are no downstream routers interested in a


particular multicast group, it sends a Prune message to upstream routers.
This informs them to prune the distribution tree for that group and stop
forwarding traffic to the pruned branch.

 Periodic Refresh:
DVMRP routers periodically refresh their routing tables and distribution
trees to adapt to changes in network topology or multicast group
memberships.

PIET-DS(CE) Page 5

You might also like