Multicast Routing in Datagram Internetworks and Extended LANs (1990)
Cached
Download Links
- [www.cs.rutgers.edu]
- [www-cse.ucsd.edu]
- [utdallas.edu]
- [www.cse.ucsc.edu]
- [www.soe.ucsc.edu]
- [www.cs.cmu.edu]
- [cs.wisc.edu]
- [www.cs.uccs.edu]
- [www.utdallas.edu]
- [cs.uccs.edu]
- [www.cs.cmu.edu]
- [www.utdallas.edu]
- [www.cs.columbia.edu]
- [www.cs.ucsd.edu]
- [www-cse.ucsd.edu]
- [ramp.ucsd.edu]
- [nms.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Computer Systems |
| Citations: | 919 - 6 self |
BibTeX
@ARTICLE{Deering90multicastrouting,
author = {Stephen E. Deering and David R. Cheriton},
title = {Multicast Routing in Datagram Internetworks and Extended LANs},
journal = {ACM Transactions on Computer Systems},
year = {1990},
volume = {8},
pages = {85--110}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store-and-forward routers, the multicast service is usually not offered across the resulting internetwork. To address this limitation, we specify extensions to two common internetwork routing algorithms-distance-vector routing and link-state routing-to support low-delay datagram multicasting beyond a single LAN. We also describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.
