A tight unconditional lower bound on distributed randomwalk computation

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 257-266

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

^a UNIVERSITY OF VIENNA   (Austria)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c GOOGLE INC   (United States)

^d NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^e BROWN UNIVERSITY   (United States)

Author keywords

communication complexity; distributed algorithms; lower bound; randomwalk; time complexity

Indexed keywords

COMMUNICATION COMPLEXITY; DISTRIBUTED ALGORITHM; LOWER BOUNDS; RANDOMWALK; TIME COMPLEXITY;

ALGORITHMS; RANDOM PROCESSES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79959870943     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993853     Document Type: Conference Paper

References (35)

1. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical Review, 64, 2001.
2. 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.
3. 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.
4. T. Bernard, A. Bui, and O. Flauzac. Random distributed self-stabilizing structures maintenance. In ISSADS, pages 231-240, 2004.
5. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, pages 353-366, 2004.
6. A. Z. Broder. Generating random spanning trees. In FOCS, pages 442-447, 1989.
7. B. F. Cooper. Quickly routing searches without having to move content. In IPTPS, pages 163-172, 2005.
8. D. Coppersmith, P. Tetali, and P. Winkler. Collisions among random walks on a graph. SIAM J. Discret. Math., 6(3):363-374, 1993.
9. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed Verification and Hardness of Distributed Approximation. In STOC, 2011.
10. A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In PODC, pages 161-170, 2009.
11. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Efficient distributed random walks with applications. In PODC, pages 201-210, 2010.
12. S. Dolev and N. Tzachar. Spanders: distributed spanning expanders. In SAC, pages 1309-1314, 2010.
13. M. Elkin. Distributed approximation: a survey. SIGACT News, 35(4):40-57, 2004.
14. M. Elkin. An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem. SIAM J. Comput., 36(2):433-456, 2006. Also in STOC'04. (Pubitemid 46627295)
15. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Z. 0004. Graph Distances in the Data-Stream Model. SIAM J. Comput., 38(5):1709-1727, 2008.
16. Also in SODA'05.
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. J. A. Garay, S. Kutten, and D. Peleg. A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM J. Comput., 27(1):302-316, 1998. Also in FOCS '93. (Pubitemid 128596830)
19. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In INFOCOM, pages 1526-1537, 2005.
20. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC, pages 119-131, 1990.
21. D. Kempe, J. M. Kleinberg, and A. J. Demers. Spatial gossip and resource location protocols. In STOC, pages 163-172, 2001.
22. J. M. Kleinberg. The small-world phenomenon: an algorithmic perspective. In STOC, pages 163-170, 2000.
23. L. Kor, A. Korman, and D. Peleg. Tight bounds for distributed mst verification. In STACS, pages 69-80, 2011.
24. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, NY, USA, 1997.
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. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for constant diameter graphs. Distributed Computing, 18(6):453-460, 2006. Also in PODC'01. (Pubitemid 43824395)
28. 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.
29. D. Nanongkai, A. Das Sarma, and G. Pandurangan. A tight lower bound on distributed random walk computation. CoRR, abs/1102.2906, 2011.
30. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM J. Comput., 22(1):211-219, 1993.
31. Also in STOC'91.
32. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
33. D. Peleg and V. Rubinovich. A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. SIAM J. Comput., 30(5):1427-1442, 2000. Also in FOCS'99. (Pubitemid 33099783)
34. M. Zhong and K. Shen. Random walk based node sampling in self-organizing networks. Operating Systems Review, 40(3):49-55, 2006. (Pubitemid 44299046)
35. M. Zhong, K. Shen, and J. I. Seiferas. Non-uniform random membership management in peer-to-peer networks. In INFOCOM, pages 1151-1161, 2005.