scispace - formally typeset
Journal ArticleDOI

Multicast routing in datagram internetworks and extended LANs

TLDR
In this paper, the authors specify extensions to two common internetwork routing algorithms (distancevector routing and link-state routing) to support low-delay datagram multicasting beyond a single LAN, and discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.
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.

read more

Content maybe subject to copyright    Report

Citations
More filters

On the Performance & Feasibility of Multicast Core Selection Heuristics

TL;DR: In this article, the authors proposed and compared the simulated performances of simple heuristics to efficiently support dynamic multicast group, and more generally, multicast core management by allowing the core to migrate.
Journal ArticleDOI

IP multicast group management for point-to-point local distribution

TL;DR: This work proposes alternative mechanisms that preserve the IP multicasting model, but employ join-leave messages to track group membership, demonstrating that the join- leave approach is uniformly superior for this environment.
Proceedings ArticleDOI

A utility-aware middleware architecture for decentralized group communication applications

TL;DR: GroupCast as discussed by the authors is a utility-aware middleware architecture for scalable and efficient P2P group communications, which dynamically creates and maintains group communication channels by optimizing the utility value of the group communication spanning trees.

Linguistic Support for Large-Scale Distributed Programming

TL;DR: These operators support a publish/subscribe-based interaction scheme, leading to a distributed object programming model merging the benefits of objects and events, and for the integration of these operators into a strongly typed object-oriented language is identified.
Proceedings ArticleDOI

Making Application Layer Multicast Reliable is Feasible

TL;DR: In this paper, the authors proposed a new tree construction algorithm and demonstrated that making ALM reliable is achievable, even when a single-tree based multicast structure is used, and exploited the property that participating users' lifetime follow a Pareto distribution which has the used better than new (UBTN) feature, and dynamically adjusted the multicast tree.
References
More filters
Book

Dynamic Programming

TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Book

Flows in networks

TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI

Flows in Networks.

TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Book

Data Structures and Algorithms

TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.

Internet Protocol

J. Postel
TL;DR: 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.