Multicast routing in datagram internetworks and extended LANs

@article{Deering1990MulticastRI,
  title={Multicast routing in datagram internetworks and extended LANs},
  author={Stephen E. Deering and David R. Cheriton},
  journal={ACM Trans. Comput. Syst.},
  year={1990},
  volume={8},
  pages={85-110}
}
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… 

Figures from this paper

On multicasting in a communication network
  • K. Makki, N. Pissinou, O. Frieder
  • Computer Science
    Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95
  • 1995
TLDR
An efficient implementation of a widely used multicasting method that produces a solution no greater than twice that of an optimal solution is discussed and two efficient multicast tree constructions are presented for a general version of the multicasting problem in which a network consists of different classes of nodes.
The PIM architecture for wide-area multicast routing
TLDR
The protocol independent multicast (PIM) architecture maintains the traditional IP multicast service model of receiver-initiated membership, supports both shared and source-specific (shortest-path) distribution trees, and uses soft-state mechanisms to adapt to underlying network conditions and group dynamics.
A Protocol for Scalable Loop-Free Multicast Routing
TLDR
It is proved that MIP is loop-free at every instant, and that it is deadlock-free and obtains multicast routing trees within a finite time after the occurrence of an arbitrary sequence of topology or unicast changes.
An architecture for wide-area multicast routing
TLDR
The Protocol Independent Multicast (PIM) architecture maintains the traditional IP multicast service model of receiver-initiated membership and uses soft-state mechanisms to adapt to underlying network conditions and group dynamics, which make it well suited to large heterogeneous inter-networks.
The Design , Implementation , and PerformanceEvaluation of the On-Demand Multicast RoutingProtocol in Multihop Wireless Networks
TLDR
ODMRP is a mesh- based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding) and applies on-demand procedures to dynamically build routes and maintain multicast group membership.
Multicast Routing Algorithms: from the Internet to Wireless Networks
TLDR
A survey of multicasts routing algorithms in the wireline Internet and wireless multi-hop networks is presented and routing metrics and multicast routing implementation issues are reviewed.
Multicast Routing A:lgorithms in High Speed Networks
TLDR
The first algorithm, which provides multicasting and guaranteed QoS(Qua1ity-of-Service) services at the network layer, is a distributed routing algorithm where the reduced multicast tree is computed through a single round of message exchanges between network nodes, consequently reducing the number of messages and the accompanying computation time.
A Comprehensive Study of Multicast based Routing Protocols in Wired Networks ( LAN )
TLDR
This paper analyzes different Multicast Routing Protocols and their strategies on the basis of type and sub type and implemented model and makes a comprehensive study on existing multicast routing protocols.
Routing Protocols
TLDR
A network-layer view of multicast routing stability is presented and instabilities are characterized by evaluating temporal and spatial variations in the routing views by comparing views between them.
...
...

References

SHOWING 1-10 OF 41 REFERENCES
Host groups: a multicast extension for datagram internetworks
TLDR
This paper proposes a model of service for multicast in an internetwork, describes how this service can be used, and describes aspects of its implementation, including how it would fit into one existing internetwork architecture, namely the US DoD Internet Architecture.
Extended bridge algorithms for large networks
TLDR
The reduced broadcast bridge algorithm alleviates the problem of extraneous broadcasting in large networks built from bridges and packet switches and application to the broadband integrated services digital network (BISDN) is proposed.
Hierarchical Routing for Large Networks; Performance Evaluation and Optimization
Reverse path forwarding of broadcast packets
TLDR
Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks which can be implemented in existing networks with less complexity than that required for the known alternatives.
Internet broadcasting
TLDR
A directed broadcast, delivery of a packet to all hosts on any single network in an internet, is simpler to implement, closer to what most users need, and sufficient to construct many forms of broadcast-based interprocess communication, including an internet-wide broadcast.
Mechanisms for broadcast and selective broadcast
TLDR
This thesis deals with a problem in the effective use of a loosely-coupled store-and-forward network like the ARPANET, and discusses ways of adapting existing broadcast mechanisms to the more general problem of selective broadcast.
Distance Vector Multicast Routing Protocol
This RFC describes a distance-vector-style routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP), and implements multicasting
The New Routing Algorithm for the ARPANET
The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to
An algorithm for distributed computation of a spanningtree in an extended LAN
A protocol and algorithm are given in which bridges in an extended Local Area Network of arbitrary topology compute, in a distributed fashion, an acyclic spanning subset of the network. The algorithm
Internet Protocol
TLDR
Along with TCP, IP represents the heart of the Internet protocols and has two primary responsibilities: providing connectionless, best-effort delivery of datagrams through an internetwork; and providing fragmentation and reassembly of data links to support data links with different maximum transmission unit (MTU) sizes.
...
...