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
ReportDOI

Measurements and analysis of end-to-end Internet dynamics

Vern Paxson
TL;DR: This work describes the resulting characterizations of Internet packet loss and delay, including general assessments of queueing time scales and available bandwidth, using a distributed framework developed for conducting end-to-end measurements.
Book ChapterDOI

SCRIBE: The Design of a Large-Scale Event Notification Infrastructure

TL;DR: Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization and locality properties.
Patent

Optimized network resource location

TL;DR: In this article, a client makes the request of the selected best repeater and the client is possibly rewritten to replace at least some of the resource identifiers contained therein with modified resource identifiers designating the repeater instead of the origin server.
Patent

Performing multicast communication in computer networks by using overlay routing

TL;DR: In this article, an overlay protocol and a system for allowing multicast routing in the Internet to be performed at the application level is presented, where overlay routers are placed at each of several local area networks, Internet service provider's point of presence, enterprise, or other cohesively managed locations.
Proceedings ArticleDOI

A performance comparison study of ad hoc wireless multicast protocols

TL;DR: This study simulates a set of representative wireless ad hoc multicast protocols and evaluates them in various network scenarios, finding the relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations.
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.