Distributed process groups in the V Kernel
ACM Transactions on Computer Systems (TOCS)
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Reverse path forwarding of broadcast packets
Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
Dynamic Programming
Mechanisms for broadcast and selective broadcast
Mechanisms for broadcast and selective broadcast
The ethernet: a local area network: data link layer and physical layer specifications
ACM SIGCOMM Computer Communication Review
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
An empirical study of reliable multicast protocols over Ethernet-connected networks
Performance Evaluation
| Hi-index | 0.00 |
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.