Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Review of Multicast Routing in Datagram Internetworks and Extended LANs
 

Summary: Review of Multicast Routing in Datagram Internetworks
and Extended LANs
Gwendolyn Stockman
March 7, 2007
This paper introduces several algorithms for multicast routing based on different methods
of unicast routing including single-spanning tree, distance-vector, and link-state routing. The
algorithms proposed use the data structures already present in the existing unicast routing
protocols and attempt to ensure that the delivery characteristics of multicast packets are
the same as those of unicast packets. In Single Spanning Tree multicast, Truncated Reverse
Path Broadcasting (TRPB), and Reverse Path Multicasting (RPM) routers and bridges learn
which branches lead to members of particular groups through periodic membership reports
from those members. Once no membership reports for a specific group are received for a
certain amount of time the entries expire. A distance-vector multicast routing protocol was
developed in several stages. They started by modifying Reverse Path Flooding (RPF) where
a router forwards broadcast packet (on all other links) from a source S if and only if it arrived
via the shortest path back to S to fix the problem of packets being able to be transmitted
multiple times on the same link. To do this Reverse Path Broadcasting (RPB) only forwards
broadcast packets along child links on the shortest path back to S. A new algorithm requiring
no new information was created to find the child links. For a given link, the router with the
minimum distance to S is considered the parent, and hence the link is a child of the parent.

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences