Multicast routing in internetworks and extended LANs
- 1 August 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 18 (4) , 55-64
- https://doi.org/10.1145/52325.52331
Abstract
Multicasting is used within local-area networks to make distributed applications more robust and more efficient. The growing need to distribute applications across multiple, interconnected networks, and the increasing availability of high-performance, high-capacity switching nodes and networks, lead us to consider providing LAN-style multicasting across an internetwork. In this paper, we propose extensions to two common internetwork routing algorithms—distance-vector routing and link-state routing—to support low-delay datagram multicasting. We also suggest 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 show how different link-layer and network-layer multicast routing algorithms can be combined hierarchically to support multicasting across large, heterogeneous internetworks.Keywords
This publication has 7 references indexed in Scilit:
- Extended bridge algorithms for large networksIEEE Network, 1988
- Distributed process groups in the V KernelACM Transactions on Computer Systems, 1985
- Multicast Communication on Network ComputersIEEE Software, 1985
- An algorithm for distributed computation of a spanningtree in an extended LANPublished by Association for Computing Machinery (ACM) ,1985
- The ethernet: a local area networkACM SIGCOMM Computer Communication Review, 1981
- Pup: An Internetwork ArchitectureIEEE Transactions on Communications, 1980
- Reverse path forwarding of broadcast packetsCommunications of the ACM, 1978