Fast information spreading in graphs with large weak conductance

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 440-448

  Censor Hiller, Keren ^a   Shachnai, Hadas ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed computing; Information spreading; Leader election; Randomized algorithms; Weak conductance

Indexed keywords

DISTRIBUTED COMPUTING; INFORMATION SPREADING; LEADER ELECTION; RANDOMIZED ALGORITHMS; WEAK CONDUCTANCE;

GRAPHIC METHODS;

ALGORITHMS;

EID: 79955732925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle. Many random walks are faster than one. In Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (SPAA), pages 119-128, 2008.
2. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). John Wiley Interscience, March 2004.
3. C. Avin and G. Ercal. Bounds on the mixing time and partial cover of ad-hoc and sensor networks. In Wireless Sensor Networks, 2005. Proceeedings of the Second European Workshop on, pages 1-12, 2005. (Pubitemid 43861384)
4. M. Borokhovich, C. Avin, and Z. Lotker. Tight bounds for algebraic gossip on graphs. In Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT), pages 1758-1762, 2010.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE/ACM Trans. Netw., 14(S1):2508-2530, 2006. (Pubitemid 43898906)
6. M. Bradonjić, R. Elsässer, T. Friedrich, T. Sauerwald, and A. Stauffer. Efficient broadcast on random geometric graphs. In Proceedings of the 21st ACM-SIAM Symposium on Dis-crete Algorithms (SODA), pages 1412-1421, 2010.
7. K. Censor Hillel and H. Shachnai. Partial information spreading with application to distributed maximum coverage. In Proceedings of the 27th ACM symposium on Principles of Distributed Computing (PODC 2010).
8. F. Chierichetti, S. Lattanzi, and A. Panconesi. Almost tight bounds for rumour spreading with conductance. In Proceedings of the 42nd ACM Symposium on Theory of Computing (SrOC). pages 399-408, 2010.
9. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumour spreading and graph conductance. In Proceedings of the 21st ACM-SIAMSymposium on Discrete Algorithms (SODA), pages 1657-1663. 2010.
10. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proceedings of the sixth annual ACM Symposium on Principles of distributed computing (PODC), pages 1-12, 1987.
11. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In Proceedings of the nineteenth annual ACM- SIAM symposium on Discrete algorithms (SODA), pages 773-781, Philadelphia, PA, USA. 2008. Society for Industrial and Applied Mathematics.
12. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In 36th International Colloquium on Automata, Languages and Programming (ICALP)(1), pages 366-377, 2009.
13. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. In SIGAL International Symposium on Algorithms, pages 128-137, 1990.
14. N. Fountoulakis and A. Huber. Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading. SIAM Journal on Discrete Mathematics, 23(4): 1964-1991, 2009.
15. C. Georgiou, S. Gilbert, R. Guerraoui, and D. R. Kowalski. On the complexity of asynchronous gossip. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (PODC), pages 135-144, 2008.
16. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), page 565, Washington, DC, USA, 2000. IEEE Computer Society.
17. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), page 482, Washington, DC, USA, 2003. IEEE Computer Society.
18. G. L. Lann. Distributed systems - towards a formal approach. In IFIP Congress, pages 155-160, 1977.
19. D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC), pages 113-122, New York, NY, USA, 2006. ACM. (Pubitemid 44393699)
20. D. Peleg. Time-optimal leader election in general networks. Journal of Parallel and Distributed Computing, 8( 1 ):96 - 99, 1990. (Pubitemid 20646646)
21. D. Peleg and A. A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99-116, 1989.
22. D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAMJ. Comput., 18(4):740-747, 1989.
23. M. K. Ramanathan, R. A. Ferreira, S. Jagannathan, A. Grama, and W. Szpankowski. Randomized leader election. Distributed Computing, 19(5-6):403-418. 2007. (Pubitemid 46492247)
24. A. D. Sarwate and A. G. Dimakis. The impact of mobility on gossip algorithms. In 28th IEEE International Conference on Computer Communications (INFOCOM), pages 2088-2096, 2009.
25. A. Sinclair. Algorithms for random generation and counting; a Markov chain approach. Birkhauser Verlag, Basel, Switzerland, Switzerland. 1993.