Multicast Routing in Datagram Internetworks and Extended LANs

Multicast Routing in Datagram Internetworks and Extended LANs (1990)

by Stephen E. Deering , David R. Cheriton

Venue:	ACM Transactions on Computer Systems
Citations:	919 - 6 self

Datum	Value	Source
TITLE	Multicast Routing in Datagram Internetworks and Extended LANs	INFERENCE
AUTHOR NAME	Stephen E. Deering	SVM HeaderParse 0.2
AUTHOR AFFIL	Stanford University	SVM HeaderParse 0.2
AUTHOR NAME	David R. Cheriton	SVM HeaderParse 0.2
AUTHOR AFFIL	Stanford University	SVM HeaderParse 0.2
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.	SVM HeaderParse 0.2
YEAR	1990	INFERENCE
VENUE	ACM Transactions on Computer Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	85--110	INFERENCE
VOLUME	8	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	30 found	ParsCit 1.0