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

A reservation-based multicast (RBM) routing protocol for mobile networks: overview of initial route construction

TL;DR: In this article, a combined multicast routing and resource reservation protocol, termed reservation-based multicast (RBM), is proposed for mobile operation and routes hierarchically-encoded data streams based on user-specified fidelity requirements, real-time delivery thresholds and prevailing network bandwidth constraints.

A Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocols

TL;DR: This paper provides the first head-to-head comparison of various tree-first ALM protocols in a single simulation environment and shows that depth-first searching technique in HMTP can achieve the lowest cost trees.
Journal ArticleDOI

An incentive scheduling mechanism for peer-to-peer video streaming

TL;DR: This paper designed and proposed a distributed and scalable incentive mechanism for mesh based P2P video streaming networks and proposed an incentive sending side scheduler in which peers are served based on their contribution in the network.
Dissertation

A methodology and software platform for building wearable communities

Z. Segall, +1 more
TL;DR: The goal of this dissertation is to develop a generic wearable software platform that enables spontaneous interactions in face-to-face settings, aids developers in the implementation of ad hoc collaborative applications and supports building of co-present communities.
Journal ArticleDOI

Capacity-aware multicast algorithms on heterogeneous overlay networks

TL;DR: Two capacity-aware multicast systems that focus on host heterogeneity, any source multicast, dynamic membership, and scalability are proposed that are based on Chord and Koorde and rigorously analyze the expected performance of multisource capacity- aware multicasting.
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.