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
Proceedings ArticleDOI

The MASC/BGMP architecture for inter-domain multicast routing

TL;DR: An architecture for inter-domain multicast routing that consists of two complementary protocols that forms the basis for a hierarchical address allocation architecture and is intended as a framework in which to solve the problems facing the current multicast addressing and routing infrastructure.
Proceedings ArticleDOI

WebOS: operating system services for wide area applications

TL;DR: WebOS is built that provides the basic operating systems services needed to build applications that are geographically distributed, highly available, incrementally scalable and dynamically reconfigurable and uses Rent-A-Server to implement dynamic replication of overloaded Web services across the wide area in response to client demands.
Journal ArticleDOI

Efficient topology-aware overlay network

TL;DR: Mithos is introduced, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing.
Proceedings ArticleDOI

Scaling of multicast trees: comments on the Chuang-Sirbu scaling law

TL;DR: The asymptotic form for L(m) in k-ary trees is derived and this results suggest one possible explanation for the universality of the Chuang-Sirbu scaling behavior.
Proceedings ArticleDOI

Multicasting for multimedia applications

TL;DR: The authors investigate multicast routing for high-bandwidth delay-sensitive applications in a point-to-point network as an optimization problem and present an efficient approximation algorithm.
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.