Delayed path coupling and generating random permutations
Proceedings of the ninth international conference on on Random structures and algorithms
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Distributed Construction of a Fault-Tolerant Network from a Tree
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The flip markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing
Spanders: distributed spanning expanders
Proceedings of the 2010 ACM Symposium on Applied Computing
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
IEEE Transactions on Parallel and Distributed Systems
Xheal: localized self-healing using expanders
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A repair mechanism for fault-tolerance for tree-structured peer-to-peer systems
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
In this paper, we propose a new distributed construction of constant-degree expanders motivated by their application in P2P overlay networks and in particular in the design of robust tree overlays. Our key result can be stated as follows. Consider a complete binary tree T and construct a random pairing Π between leaf nodes and internal nodes. We prove that the graph GΠ obtained from T by contracting all pairs (leaf-internal nodes) achieves a constant node expansion with high probability. In the context of P2P overlays our result can be interpreted as follows: if each physical node participating to the tree overlay manages a random pair that couples one virtual internal node and one virtual leaf node then the physical-node layer exhibits a constant expansion with high probability. We encompass the difficulty of obtaining the random tree virtualization by proposing a local, self-organizing and churn resilient uniformly-random pairing algorithm with O(log2 n) running time. Our algorithm has the merit to not modify the original tree overlay (we just control the mapping between physical nodes and virtual nodes). Therefore, our scheme is general and can be easilly extended to a large class of overlays.