Results 1 - 10 of 79,797

Tree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching

by Honge Wang, Douglas M. Blough
"... A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links with ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links

A Fault-Tolerant Tree-Based Multicasting in Mesh Multicomputers

by Jie Wu, Xiao Chen
"... We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional #2-D# meshes based on the concept of the extended safety level whichisavector associated with eachnode to capture fault information in the neighborhood. In this approach each destination is reached through a minimum numb ..."
Abstract - Add to MetaCart
We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional #2-D# meshes based on the concept of the extended safety level whichisavector associated with eachnode to capture fault information in the neighborhood. In this approach each destination is reached through a minimum

Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination

by Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, John D. Kubiatowicz , 2001
"... The demand for streaming multimedia applications is growing at an incredible rate. In this paper, we propose Bayeux, an efficient application-level multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. Bayeux also includes specific ..."
Abstract - Cited by 466 (12 self) - Add to MetaCart
The demand for streaming multimedia applications is growing at an incredible rate. In this paper, we propose Bayeux, an efficient application-level multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. Bayeux also includes specific

Overcast: Reliable Multicasting with an Overlay Network

by John Jannotti, David K. Gifford, Kirk L. Johnson, M. Frans Kaashoek, James W. O'Toole, Jr. , 2000
"... Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations in a ..."
Abstract - Cited by 563 (10 self) - Add to MetaCart
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations

SplitStream: High-Bandwidth Multicast in Cooperative Environments

by Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Animesh Nandi, Antony Rowstron, Atul Singh - SOSP '03 , 2003
"... In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly available, d d cated infrastructure routers but it poses a problem for application-level multicast in peer-to-peer systems. ..."
Abstract - Cited by 570 (17 self) - Add to MetaCart
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly available, d d cated infrastructure routers but it poses a problem for application-level multicast in peer-to-peer systems

Fault-Tolerant Multicast Communication in Multicomputers

by Rajendra Boppana, Suresh Chalasani - Proceedings of the 1995 International Conference on Parallel Processing , 1995
"... . We describe fault-tolerant routing of multicast messages in mesh-based wormhole-switched multicomputers. With the proposed techniques, multiple convex faults can be tolerated. The fault information is kept locally--- each fault-free processor needs to know the status of the links incident on it on ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
. We describe fault-tolerant routing of multicast messages in mesh-based wormhole-switched multicomputers. With the proposed techniques, multiple convex faults can be tolerated. The fault information is kept locally--- each fault-free processor needs to know the status of the links incident

Lightweight causal and atomic group multicast

by Kenneth Birman, Andre Schiper, Pat Stephenson - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1991
"... ..."
Abstract - Cited by 622 (49 self) - Add to MetaCart
Abstract not found

Scalable Application Layer Multicast

by Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy , 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract - Cited by 719 (21 self) - Add to MetaCart
We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data

Receiver-driven Layered Multicast

by Steven McCanne, Van Jacobson, Martin Vetterli , 1996
"... State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate — the conflicti ..."
Abstract - Cited by 749 (22 self) - Add to MetaCart
State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate

SCRIBE: A large-scale and decentralized application-level multicast infrastructure

by Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Antony Rowstron - IEEE Journal on Selected Areas in Communications (JSAC , 2002
"... This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, ..."
Abstract - Cited by 648 (29 self) - Add to MetaCart
Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared to IP multicast.
Results 1 - 10 of 79,797