Fast distributed random walks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 161-170

  Sarma, Atish Das ^a   Nanongkai, Danupon ^a   Pandurangan, Gopal ^b  

^a Georgia Institute of Technology   (United States)

^b Purdue University   (United States)

Author keywords

Distributed algorithm; Metropolis Hastings sampling; Random sampling; Random walks

Indexed keywords

BANDWIDTH CONSTRAINT; DISTRIBUTED ALGORITHM; DISTRIBUTED COMPUTING; DISTRIBUTED NETWORKS; IN-NETWORK; LOWER BOUNDS; METROPOLIS-HASTINGS SAMPLING; METROPOLIS-HASTINGS SAMPLINGS; MIXING TIME; RANDOM SAMPLING; RANDOM WALK; RANDOM WALKS; RUNNING TIME; UNDERLYING GRAPHS;

COMPUTER SCIENCE; CONTROL THEORY; PARALLEL ALGORITHMS;

GRAPH THEORY;

EID: 70350680800     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582745     Document Type: Conference Paper

References (36)

1. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical Review, 64, 2001.
2. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In FOCS, pages 218-223, 1979.
3. N. Alon, C. Avin, M. Koucký, G. Kozma, Z. Lotker, and M. R. Tuttle. Many random walks are faster than one. In SPAA, pages 119-128, 2008.
4. B. Awerbuch, A. Baratz, and D. Peleg. Cost-sensitive analysis of communication protocols. In 9th ACM PODC, pages 177-187, 1990.
5. H. Baala, O. Flauzac, J. Gaber, M. Bui, and T. El-Ghazawi. A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. J. Parallel Distrib. Comput., 63(1):97-104, 2003.
6. J. Bar-Ilan and D. Zernik. Random leaders and random spanning trees. In Proceedings of the 3rd International Workshop on Distributed Algorithms, pages 1-12, London, UK, 1989. Springer-Verlag.
7. T. Bernard, A. Bui, and O. Flauzac. Random distributed self-stabilizing structures maintenance. In ISSADS, pages 231-240, 2004.
8. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, pages 353-366, 2004.
9. A. Z. Broder. Generating random spanning trees. In FOCS, pages 442-447, 1989.
10. M. Bui, T. Bernard, D. Sohier, and A. Bui. Random walks in distributed computing: A survey. In IICS, pages 1-14, 2004.
11. F. Chung. Spectral Graph Theory. American Mathematical Society, Providence, RI, USA, 1997.
12. B. F. Cooper. Quickly routing searches without having to move content. In IPTPS, pages 163-172, 2005.
13. D. Coppersmith, P. Tetali, and P. Winkler. Collisions among random walks on a graph. SIAM J. Discret. Math., 6(3):363-374, 1993.
14. A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating pagerank on graph streams. In PODS, pages 69-78, 2008.
15. S. Dolev, E. Schiller, and J. L. Welch. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput., 5(7):893-905, 2006. also in PODC'02.
16. S. Dolev and N. Tzachar. Spanders: Distributed spanning expanders. Dept. of Computer Science, Ben-Gurion University, TR-08-02, 2007.
17. A. J. Ganesh, A.-M. Kermarrec, and L. Massoulié. Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput., 52(2):139-149, 2003.
18. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In INFOCOM, pages 1526-1537, 2005.
19. N. Goyal, L. Rademacher, and S. Vempala. Expanders via random spanning trees. In SODA, pages 576-585, 2009.
20. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97-109, April 1970.
21. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC, pages 119-131, 1990.
22. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA, pages 36-43, 2004.
23. D. Kempe, J. M. Kleinberg, and A. J. Demers. Spatial gossip and resource location protocols. In STOC, pages 163-172, 2001.
24. J. M. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, pages 163-170, 2000.
25. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In INFOCOM, 2003.
26. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In SIGCOMM, pages 395-406, 2003.
27. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS, pages 84-95, 2002.
28. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6):1087-1092, 1953.
29. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York, NY, USA, 2005.
30. R. Morales and I. Gupta. Avmon: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. In ICDCS, page 55, 2007.
31. G. Pandurangan and M. Khan. Theory of communication networks. In Algorithms and Theory of Computation Handbook, Second Edition. CRC Press, 2009.
32. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
33. R. Sami and A. Twigg. Lower bounds for distributed markov chain problems. CoRR, abs/0810.5263, 2008.
34. D. B. Wilson. Generating random spanning trees more quickly than the cover time. In STOC, pages 296-303, 1996.
35. M. Zhong and K. Shen. Random walk based node sampling in self-organizing networks. Operating Systems Review, 40(3):49-55, 2006.
36. M. Zhong, K. Shen, and J. I. Seiferas. Non-uniform random membership management in peer-to-peer networks. In INFOCOM, pages 1151-1161, 2005.