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

Reputation based mesh-tree-mesh cluster hybrid architecture for P2P live streaming

TL;DR: Simulation results exhibit the characteristics of the proposed three-layer hybrid video streaming architecture and its performance with respect to end to end delay.
Journal ArticleDOI

Concurrent asynchronous broadcast on the MetaNet

TL;DR: The problem solved in this work is how multiple nodes in a network with an arbitrary topology can broadcast concurrently, in an asynchronous manner, to all other nodes, and the method used is the only one with broadcast capability.
Proceedings ArticleDOI

Multicast routing in internetworks using dynamic core based trees

TL;DR: A modification to the CBT tree building algorithm so that minimal spanning trees are built when needed and packets are routed through nearly optimal paths and this helps reduce the multicast delay.
Proceedings ArticleDOI

Scalable and topologically-aware application-layer multicast

TL;DR: The results on performance evaluation show that constructing topologically-aware data paths can reduce unnecessary high latency and redundant network resource usage with low overhead over existing scalable approaches.
Journal ArticleDOI

Protecting against malicious and selective forwarding attacks for P2P search & retrieval system

TL;DR: A dynamic adaptive algorithm that can tackle the censorship and security issues, determine the proportion of subverted and selfish nodes, and defend against malicious and selective forwarding attacks is proposed, which can guarantee robustness and scalability even with different random networks and varied network sizes.
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.