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 efficient approach for load-shared and fault-tolerant multicore shared tree multicasting

TL;DR: In this paper, novel and efficient schemes for load shared multicore multicasting are presented and multiple cores are selected statically, that is, independent of any existing multicast groups and also the selection process isindependent of any underlying unicast protocol.
Journal ArticleDOI

Multicast Routing Problem in Communication Networks: State of the Art

TL;DR: This state-of-the-art paper aims to provide a tutorial that is easy to follow for readers who are not already familiar with the subject, and make a comprehensive survey and comparisons of different techniques employed in or proposed for routing problem.
Proceedings ArticleDOI

Strategies for using multicasting to locate resources

TL;DR: The article investigates the use of a technique called multicasting for location of such distributed information through three different strategies for using the resources contained by a machine to dynamically compute the multicast addresses on which the machine should listen for requests of the information.
Book ChapterDOI

Prediction-Based multicast mobility management in mobile internet

TL;DR: A novel multicast mobility management algorithm using the proposed RingNet hierarchy, which takes advantage of the designed four states for mobility management, and two kinds of ranges which are closely related to a Mobile Host’s attached device called the Access Proxy.
Dissertation

Algorithmes de routage dans les réseaux mobile ad hoc tactique à grande échelle

TL;DR: Two multicast routing protocols adapted to the MANET are defined: firstly STAMP that is in charge of the multicast communications within each cluster and secondly SAFIR that handles multicast flows between the clusters.
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.