Sciweavers

1498 search results - page 5 / 300
» Collection tree protocol
Sort
View
WSS
1997
112views Control Systems» more  WSS 1997»
13 years 9 months ago
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
Jorge Arturo Cobb, Mohamed Waris
ICT
2004
Springer
120views Communications» more  ICT 2004»
14 years 29 days ago
Scalable End-to-End Multicast Tree Fault Isolation
We present a novel protocol, M3L, for multicast tree fault isolation based purely upon end-to-end information. Here, a fault is a link with a loss rate exceeding a specified thres...
Timur Friedman, Donald F. Towsley, James F. Kurose
EUROPAR
2007
Springer
14 years 1 months ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
GRID
2005
Springer
14 years 1 months ago
Collective operations for wide-area message passing systems using adaptive spanning trees
Abstract— We propose a method for wide-area message passing systems to perform collective operations using dynamically created spanning trees. In our proposal, broadcasts and red...
Hideo Saito, Kenjiro Taura, Takashi Chikayama
NGC
2000
Springer
115views Communications» more  NGC 2000»
13 years 11 months ago
Hierarchical reliable multicast
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
Athina Markopoulou, Fouad A. Tobagi