Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Multicast Routing in Datagram Internetworks and Extended LANs Reviewer: Sayandeep Sen
 

Summary: Multicast Routing in Datagram Internetworks and Extended LANs
Reviewer: Sayandeep Sen
March 5, 2008
1 Summary
The goal of the paper is to extend the scope of (then)
popular multicast LAN applications over internet-
works of LANS. The authors stipulate the following
as the desirable characteristics of such extension pro-
tocols: 1. Group Addressing, 2. High probability
delivery, 3. Low delay. The authors then present
a set of modifications to unicast routing algorithms
(single-spanning tree, distance-vector, and link-state
routing) to make them multicast capable over an in-
ternetwork. The proposed modifications can be sum-
marized as follows:
a). For networks which have a spanning tree topol-
ogy to begin with, the authors propose Single Span-
ning Tree multicast protocol. This protocol works
by letting the interconnecting bridges learning the
group memberships of their connected nodes and

  

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

 

Collections: Computer Technologies and Information Sciences