RSS
Twitter
Facebook
v
The
first multicast routing protocol used in the Internet and the most widely
supported multicast routing algorithm is the distance vector multicast routing
protocol (DVMRP) DVMRP implements source-based trees with reverse path
forwarding, pruning, and grafting.
v
DVMRP
is based on combination of RIP and RPM.
v
DVMRP
uses a distance vector algorithm that allows each router to compute the
outgoing link (next hop) that is on its shortest path back to each possible
source.
v
This
information is then used in the RPF algorithm.
v
In
addition to computing next hop information, DVMRP also computes a list of dependent
downstream routers for pruning purposes.
v
When
a router has received a prune message from all of its dependent downstream
routers for a given group, it will propagate a prune message upstream to the
router from which it receives its multicast traffic for that group.
v
A
DVMRP prune message contains a prune lifetime (with a default value of two
hours) that indicates how long a pruned branch will remain pruned before being
automatically restored.
v
DVMRP
graft messages are sent by a router to its upstream neighbor to force a previously-pruned
branch to be added back on to the multicast tree.
0 comments