Scribd
Upload
7 views9 pages

Em o Ess Pee Eff

Uploaded by

rohansengupta22
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
7 views9 pages

Em o Ess Pee Eff

Uploaded by

rohansengupta22
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/ 9

MULTICAST LINK STATE

(MOSPF)
Risheeth G
OVERVIEW OF MOSPF

 Definition:
 MOSPF (Multicast Open Shortest Path First) is an
extension of the OSPF protocol, used for unicast
routing, but applied to multicast routing.

 Key Points:
• Uses a source-based tree approach for multicast
routing.
• Extends the concept of unicast link-state routing to
support multicasting.
THE ROLE OF LINK-STATE DATABASE
(LSDB)

• In unicast routing, OSPF routers use a Link-State


Database (LSDB) to create a shortest-path tree.
• MOSPF extends this to multicast routing by adding
another database for multicast group
memberships.
• This database tracks which router interfaces have
active group members, helping route packets
efficiently.
• Each router has a database containing the full
topology of the network (as in unicast routing).
STEP 1 - CREATING A SHORTEST-PATH
TREE
 Dijkstra’s Algorithm:
 The router uses Dijkstra’s algorithm to create a shortest-
path tree (SPT) with the source (S) as the root and all
potential destinations as leaves.
 Difference from Unicast:
 In unicast, the router itself is the root of the tree.
 In multicast, the root is the source (S), as defined by the
packet's source address.
 Unique Aspect:
 A separate tree is created for each source (S) in the
network.
STEP 2 - SHORTEST-PATH SUBTREE

 Router in the Tree:


 The router identifies its position in the SPT created in
Step 1.
 Subtree Creation:
 The router then forms a shortest-path subtree with
itself as the root and its connected networks as the
leaves.
 Purpose:
 This subtree will guide the router on how to forward
multicast traffic.
STEP 3 - PRUNING TO FORM A
MULTICAST TREE
 Initial Broadcast Subtree:
 The shortest-path subtree initially acts like a broadcast
tree, where the packet is forwarded to all networks.
 IGMP Protocol:
 The Internet Group Management Protocol (IGMP) is used to
gather information on active multicast group members at
the network's edges (leaves).
 Pruning:
 Using the IGMP data, the router prunes branches that do
not contain active members of the multicast group,
converting the broadcast tree into a multicast tree.
STEP 4 - FORWARDING MULTICAST
PACKETS
 Selective Forwarding:
 The router now forwards the multicast packet only
on interfaces that correspond to branches of the
pruned multicast tree.
 Goal:
 Ensures that multicast packets are only sent to
networks with active group members.
 Efficiency:
 Avoids unnecessary packet delivery to networks with
no interested members.
MOSPF IN ACTION
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