Sciweavers

1503 search results - page 86 / 301
» Self-optimizing distributed trees
Sort
View
HPCC
2005
Springer
14 years 3 months ago
On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyu...
SPAA
2010
ACM
14 years 2 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
VLDB
1990
ACM
166views Database» more  VLDB 1990»
14 years 2 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
COMBINATORICS
2000
112views more  COMBINATORICS 2000»
13 years 9 months ago
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
Alan M. Frieze, Miklós Ruszinkó, Lub...
DAM
2002
67views more  DAM 2002»
13 years 9 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble