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

An evaluation of the Amoeba group communication system

TL;DR: It is concluded that sequencers-based group protocols achieve high performance (comparable to Amoeba's fast remote procedure call implementation), that the scalability of the authors' sequencer-based protocols is limited by message processing time, and that the flexibility and modularity of user-level implementations of protocols is likely to outweigh the potential performance loss.
Journal ArticleDOI

Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

TL;DR: A mobility-based multicast routing algorithm for wireless MANETs wherein the mobility characteristics are stochastic and unknown is proposed, and it is shown that the most stable multicast route is found with a probability as close as to unity by the proper choice of the parameters of the distributed learning automata.
Journal ArticleDOI

Multicast security and its extension to a mobile environment

TL;DR: Fundamental security issues in building a trusted multicast facility are considered, techniques for group-based data encryption, authentication of participants, and preventing unauthorized transmissions and receptions are discussed.
Journal ArticleDOI

Interactive distance learning over intranets

TL;DR: The Interactive Remote Instruction (IRI) system is built, which links sites over a high-speed intranet, allowing students at geographically dispersed satellite campuses and community colleges to take a class together.
Journal ArticleDOI

ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm

TL;DR: This work proposes and evaluates ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks and shows that ARIES provides the best balance among competitiveness, computational effort, and changes in the multicast tree after each update.
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.