Distributed random walks

Journal of the ACM

Volumn 60, Issue 1, 2013, Pages

  Das Sarma, Atish ^a   Nanongkai, Danupon ^b   Pandurangan, Gopal ^b,c   Tetali, Prasad ^d  

^a EBAY INC   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c Brown Univerity   (United States)

^d GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

BANDWIDTH CONSTRAINT; DECENTRALIZED ALGORITHMS; DISTRIBUTED NETWORKS; METROPOLIS-HASTINGS SAMPLINGS; POLY-LOGARITHMIC FACTORS; RANDOM SPANNING TREE; RANDOM WALK ALGORITHMS; THEORY;

ALGORITHMS; RANDOM PROCESSES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84874879187     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2432622.2432624     Document Type: Conference Paper

References (57)

1. Adamic, L. A., Lukose, R. M., Puniyani, A. R., and Huberman, B. A. 2001. Search in power-law networks. Phys. Rev. 64.
2. Aldous, D. 1990. The random walk construction of uniform spanning trees and uniform la belled trees. SIAM J. Disc. Math. 3, 4, 450-465.
3. th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, Washington, DC, 218-223.
4. Alon, N., Avin, C., Koucḱy, M., Kozma, G., Lotker, Z., and Tuttle, M. R. 2011. Many random walks are faster than one. Combin. Probab. Comput. 20, 4, 481-502.
5. Baala, H., Flauzac, O., Gaber, J., Bui, M., and El-Ghazawi, T. A. 2003. A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. J. Paral. Distrib. Comput. 63, 1, 97-104. (Pubitemid 36610307)
6. Bar-Ilan, J. and Zernik, D. 1989. Random leaders and random spanning trees. In Proceedings of the 3rd International Workshop on Distributed Algorithms (WDAG; later called DISC). 1-12.
7. Batu, T., Fortnow, L., Fischer, E., Kumar, R., Rubinfeld, R., and White, P. 2001. Testing random variables for independence and identity. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS). 442-451. (Pubitemid 33068405)
8. Bernard, T., Bui, A., and Flauzac, O. 2004. Random distributed self-stabilizing structures maintenance. In Proceedings of the 3rd International School and Symposium Advanced Distributed Systems (ISSADS). 231-240.
9. Bharambe, A. R., Agrawal, M., and Seshan, S. 2004. Mercury: Supporting scalable multi-attribute range queries. In Proceedings of the ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM). 353-366. (Pubitemid 40954893)
10. Broder, A. Z. 1989. Generating random spanning trees. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). 442-447.
11. Bui, M., Bernard, T., Sohier, D., and Bui, A. 2004. Random walks in distributed computing: A survey. In Proceedings of the 4th International Workshop on Innovative Internet Community Systems (IICS). 1-14.
12. Cooper, B. F. 2005. Quickly routing searches without having to move content. In Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS). 163-172.
13. Cooper, C., Frieze, A. M., and Radzik, T. 2009. Multiple random walks in random regular graphs. SIAM J. Discrete Math. 23, 4, 1738-1761.
14. Coppersmith, D., Tetali, P., and Winkler, P. 1993. Collisions among random walks on a graph. SIAM J. Discret. Math. 6, 3, 363-374.
15. Das Sarma, A., Nanongkai, D., and Pandurangan, G. 2009. Fast distributed random walks. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC). 161-170.
16. Das Sarma, A., Nanongkai, D., Pandurangan, G., and Tetali, P. 2010. Efficient distributed random walks with applications. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC). 201-210.
17. Das Sarma, A., Gollapudi, S., and Panigrahy, R. 2011a. Estimating page rank on graph streams. J. ACM 58, 3, 13.
18. rd ACM Symposium on Theory of Computing (STOC). 363-372.
19. th International Symposium on Distributed Computing (DISC).
20. Das Sarma, A., Molla, A. R., and Pandurangan, G. 2012b. Near-optimal random walk sampling in distributed networks. In Proceedings of the IEEE INFOCOM. 2906-2910.
21. Dolev, S., Schiller, E., and Welch, J. L. 2006. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5, 7, 893-905. (Pubitemid 44143938)
22. Dolev, S. and Tzachar, N. 2010. Spanders: Distributed spanning expanders. In Proceedings of the ACM Symposium on Applied Computing (SAC). 1309-1314.
23. Dubhashi, D. P., Grandoni, F., and Panconesi, A. 2007. Distributed Algorithms via LP Duality and Randomization. In Handbook of Approximation Algorithms and Meta heuristics. Chapman and Hall/CRC.
24. Elkin, M. 2004. An overview of distributed approximation. ACM SIGACT News Distrib. Comput. Column 35, 4, 40-57.
25. Els̈asser, R. and Sauerwald, T. 2011. Tight bounds for the cover time of multiple random walks. Theoret. Comput. Sci. 412, 24, 2623-2641.
26. Ganesh, A. J., Kermarrec, A.-M., and Massoulíe, L. 2003. Peer-to-peer membership management for gossip based protocols. IEEE Trans. Comput. 52, 2, 139-149.
27. Garay, J., Kutten, S., and Peleg, D. 1998. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27, 302-316. (Pubitemid 128596830)
28. th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 1526-1537. (Pubitemid 41390670)
29. th IEEE International Conference on Computer Communications (INFOCOM). 2591-2595. (Pubitemid 47334527)
30. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 576-585.
31. Hastings, W. K. 1970. Monte Carlo sampling methods using markov chains and their applications. Biometrika 57, 1, 97-109.
32. th Annual ACM Symposium on Principles of Distributed Computing (PODC). 119-131.
33. Jerrum, M. and Sinclair, A. 1989. Approximating the permanent. SIAM J. Comput. 18, 6, 1149-1178. (Pubitemid 20613573)
34. Karger, D. R. and Ruhl, M. 2006. Simple efficient load-balancing algorithms for peer-to-peer systems. Theory Comput. Syst. 39, 6, 787-804. (Pubitemid 44878426)
35. th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 13-21.
36. Kempe, D., Kleinberg, J. M., and Demers, A. J. 2004. Spatial gossip and resource location protocols. J. ACM 51, 6, 943-967. (Pubitemid 40818311)
37. Kempe, D. and McSherry, F. 2008. A decentralized algorithm for spectral analysis. J. Comput. Syst. Sci. 74, 1, 70-83. (Pubitemid 47625406)
38. Khan, M. and Pandurangan, G. 2008. A fast distributed approximation algorithm for minimum spanning trees. Distrib. Comput. 20, 6, 391-402. (Pubitemid 351464295)
39. Khan, M., Kuhn, F., Malkhi, D., Pandurangan, G., and Talwar, K. 2012. Efficient distributed approximation algorithms via probabilistic tree embeddings. Distrib. Comput. 25, 3, 189-205.
40. Kleinberg, J. M. 2000. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC). ACM, 163-170.
41. Law, C. and Siu, K.-Y. 2003. Distributed construction of random expander networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE, Cambridge, MA, USA.
42. Loguinov, D., Kumar, A., Rai, V., and Ganesh, S. 2003. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In Proceedings of the ACM SIGCOMM 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM). ACM, New York, 395-406.
43. Lv, Q., Cao, P., Cohen, E., Li, K., and Shenker, S. 2002. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 2002 International Conference on Supercomputing (ICS). ACM, New York, 84-95. (Pubitemid 35039987)
44. Lynch, N. A. 1996. Distributed Algorithms. Morgan-Kaufmann, San Francisco, CA.
45. Lyons, R. 2005. Asymptotic enumeration of spanning trees. Combinat. Probab. Comput. 14, 4, 491-522. (Pubitemid 41165660)
46. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. 1953. Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 6, 1087-1092.
47. Mitzenmacher, M. and Upfal, E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York.
48. Morales, R. and Gupta, I. 2007. Avmon: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. In Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS). 55.
49. Muthukrishnan, S. and Pandurangan, G. 2010. Thresholding random geometric properties motivated by ad hoc sensor networks. J. Comput. Syst. Sci. 76 7, 686-696.
50. Nanongkai, D., Das Sarma, A., and Pandurangan, G. 2011. A tight unconditional lower bound on distributed random walk computation. In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC). 257-266.
51. Pandurangan, G. and Khan, M. 2010. Algorithms and theory of computation handbook. Chapman & Hall/CRC, Chapter Theory of communication networks, 27-27.
52. Peleg, D. 2000. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA.
53. Sami, R. and Twigg, A. 2008. Lower bounds for distributed markov chain problems. CoRR abs/0810.5263.
54. Vitter, J. S. 1985. Random sampling with a reservoir. ACM Trans. Math. Softw. 11, 1, 37-57.
55. Wilson, D. B. 1996. Generating random spanning trees more quickly than the cover time. In Proceedings of the 28th ACM Symposium on Theory of Computing (STOC). 296-303.
56. Zhong, M., and Shen, K. 2006. Random walk based node sampling in self-organizing networks. Operating Systems Review 40, 3, 49-55. (Pubitemid 44299046)
57. Zhong, M., Shen, K., and Seiferas, J. I. 2005. Non-uniform random membership management in peer-to-peer networks. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 1151-1161. (Pubitemid 41390768)