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
Book ChapterDOI

Improving Performance of ALM Systems with Bayesian Estimation of Peers Dynamics

TL;DR: This paper proposes a probabilistic approach based on Bayesian inference to anticipate users' departures and let peers react proactively and proves that this approach improves significantly the performance of ALM systems with a low overhead.
Proceedings Article

Fractional spanning tree packing problem with survivability constraints for throughput maximization in overlay multicast networks

TL;DR: This paper compares optimal results of the tree packing model with a general formulation based on conceptual flows dedicated to maximizing throughput in an overlay multicast system with node capacity constraints and employs the fractional spanning tree packing problem.
Book ChapterDOI

PeerTR: a peer-to-peer terrain roaming architecture

TL;DR: A kind of architecture for terrain data transmission in peer-to-peer environment, called PeerTR, is proposed, which realizes the large-scale terrainData transmission based on P2P by means of the broadband and storage resources of spatial application nodes.
Patent

Digital content delivery system

TL;DR: In this article, a server divides digital contents held therein into a plurality of packets, and transmits packets of a minimum unit for constructing the digital contents to the second network, where the clients include means for holding the contents therein by use of the packets of the minimum unit received from the server and packets received from other clients constructing the second networks.
Journal ArticleDOI

Ppssm: push/pull smooth video streaming multicast protocol design and implementation for an overlay network

TL;DR: A novel ALM protocol based Push/Pull Smooth video Streaming Multicast (PPSSM) protocol is proposed, to increase the throughput and reduce the packet loss rate and the performance of the proposed PPSSM protocol shows improvement in respect of throughput, packet loss, and average decoding time.
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.