Download:
|
by Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani
In Proceedings STOC
http://www.cc.gatech.edu/fac/Vijay.Vazirani/peer.ps
Add To MetaCart
Abstract:
Consider the following stochastic process executed on a graph G = (V, E) whose nodes are initially uncovered. In each step, pick a node at random and if it is uncovered, cover it. Otherwise, if it has an uncovered neighbor, cover a random uncovered neighbor. Else, do nothing. This can be viewed as a structured coupon collector process. We show that for a large family of graphs, O(n) steps su#ce to cover all nodes of the graph with high probability, where n is the number of vertices. Among these graphs are d-regular graphs with d =#118 n log log n), random d-regular graphs with d =#906 n) and the k-dimensional hypercube where n = 2
Citations
|
2113
|
Chord: A scalable peer-to-peer lookup service for internet applications
– Stoica, Morris, et al.
|
|
1749
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
1289
|
The Probabilistic Method
– Alon, Spencer
- 1992
|
|
1137
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
768
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
375
|
Accessing nearby copies of replicated objects in a distributed environment
– Plaxton, Rajaraman, et al.
- 1997
|
|
214
|
Viceroy: A scalable and dynamic emulation of the butterfly
– Malkhi, Naor, et al.
|
|
163
|
Balanced allocations
– Azar, Broder, et al.
- 1999
|
|
126
|
Distributed object location in a dynamic network
– Hildrum, Kubiatowicz, et al.
|
|
39
|
The power of two random choices: A survey of the techniques and results
– Mitzenmacher, Richa, et al.
- 2001
|
|
31
|
The tail of the hypergeometric distribution
– Chvátal
- 1979
|
|
10
|
auf der Heide. Ecient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|