Near-optimal random walk sampling in distributed networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 2906-2910

  Das Sarma, Atish ^a   Molla, Anisur Rahaman ^b   Pandurangan, Gopal ^b  

^a GOOGLE INC   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED NETWORKS; MEMBERSHIP MANAGEMENT; NETWORK TOPOLOGY; PEER TO PEER; RANDOM WALK;

COMMUNICATION SYSTEMS; ELECTRIC NETWORK TOPOLOGY; RANDOM PROCESSES;

PEER TO PEER NETWORKS;

EID: 84861619817     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195727     Document Type: Conference Paper

References (32)

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'asz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In FOCS, pages 218-223, 1979.
3. 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. (Pubitemid 36610307)
4. 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.
5. T. Bernard, A. Bui, and O. Flauzac. Random distributed self-stabilizing structures maintenance. In ISSADS, pages 231-240, 2004.
6. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, pages 353-366, 2004.
7. A. Z. Broder. Generating random spanning trees. In FOCS, pages 442- 447, 1989.
8. M. Bui, T. Bernard, D. Sohier, and A. Bui. Random walks in distributed computing: A survey. In IICS, pages 1-14, 2004.
9. B. F. Cooper. Quickly routing searches without having to move content. In IPTPS, pages 163-172, 2005.
10. D. Coppersmith, P. Tetali, and P. Winkler. Collisions among random walks on a graph. SIAM J. Discret. Math., 6(3):363-374, 1993.
11. A. Das Sarma, A. R. Molla, and G. Pandurangan. Nearoptimal random walk sampling in distributed networks. URL:http://arxiv.org/abs/1201.1363, 2012.
12. A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In PODC, 2009.
13. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Efficient distributed random walks with applications. In PODC, pages 201-210, 2010.
14. 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.
15. S. Dolev and N. Tzachar. Spanders: Distributed spanning expanders. Dept. of Computer Science, Ben-Gurion University, TR-08-02, 2007.
16. 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.
17. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In INFOCOM, 2005.
18. C. Gkantsidis, Milena, and A. Saberi. Random walks in peer-to-peer networks. In INFOCOM, 2004.
19. N. Goyal, L. Rademacher, and S. Vempala. Expanders via random spanning trees. In SODA, pages 576-585, 2009.
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. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA, pages 36-43, 2004.
22. D. Kempe, J. M. Kleinberg, and A. J. Demers. Spatial gossip and resource location protocols. In STOC, pages 163-172, 2001.
23. J. M. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, pages 163-170, 2000.
24. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In INFOCOM, 2003.
25. 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.
26. 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.
27. D. Nanongkai, A. Das Sarma, and G. Pandurangan. A tight unconditional lower bound on distributed randomwalk computation. In PODC, pages 257-266, 2011.
28. G. Pandurangan and M. Khan. Theory of communication networks. In Algorithms and Theory of Computation Handbook, Second Edition. CRC Press, 2009.
29. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
30. D. B. Wilson. Generating random spanning trees more quickly than the cover time. In STOC, pages 296-303, 1996.
31. M. Zhong and Kai. Random walk based node sampling in selforganizing networks. Operating Systems Review, 40(3):49-55, 2006.
32. M. Zhong, K. Shen, and J. I. Seiferas. Non-uniform random membership management in peer-to-peer networks. In INFOCOM, 2005.