On the randomness requirements of rumor spreading

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 449-461

  Giakkoupis, George ^a   Woelfelt, Philipp ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

CONNECTED GRAPH; GATE MODELS; GENERAL CLASS; HIGH PROBABILITY; LOWER BOUNDS; NON-UNIFORM; QUASI-RANDOM; RUMOR SPREADING;

GRAPH THEORY;

EID: 79955707179     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.36     Document Type: Conference Paper

References (22)

1. S. Angelopoulos, B. Doerr, A. Huber, and K. Pana-giotou. Tight bounds for quasi-random rumor spreading. The Electronic Journal of Combinatorics, 16(1), 2009.
2. P. Berenbrink, R. Elsässer, and T. Friedetzky. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), pages 155-164, 2008.
3. 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 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 1-12, 1987.
4. B. Doerr and M. Fouz. A time-randomness tradeoff for quasi-random rumour spreading. Electronic Notes in Discrete Mathematics, 34:335-339, 2009.
5. B. Doerr and M. Fouz. Quasi-random rumor spreading: Reducing randomness can be costly. CoRR, abs/1008.0501, 2010.
6. B. Doerr, T. Friedrich, M. Künnemann, and T. Sauerwald. Quasirandom rumor spreading: An experimental analysis. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pages 145-153, 2009.
7. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In Proceedings of the 19th ACM- SIAM Symposium on Discrete Algorithms (SODA), pages 773-781, 2008.
8. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 366-377, 2009.
9. B. Doerr, A. Huber, and A. Levavi. Strong robustness of randomized rumor spreading protocols. CoRR, abs/1001.3056, 2010.
10. R. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 148-157, 2006. (Pubitemid 44535641)
11. R. Elsässer, U. Lorenz, and T. Sauerwald. On randomized broadcasting in star graphs. Discrete Applied Mathematics, 157(1):126-139, 2009.
12. R. Elsässer and T. Sauerwald. Broadcasting vs. mixing and information dissemination on Cayley graphs. In Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS), pages 163-174, 2007.
13. R. Elsässer and T. Sauerwald. The power of memory in randomized broadcasting. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 218-227, 2008.
14. R. Elsässer and T. Sauerwald. On the runtime and robustness of randomized broadcasting. Theoretical Computer Science, 410(36):3414-3427, 2009.
15. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
16. 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.
17. P. Fraigniaud and G. Giakkoupis. On the bit communication complexity of randomized rumor spreading. In Proceedings of the 22nd ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 134-143, 2010.
18. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985. (Pubitemid 15475455)
19. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 565-574, 2000. (Pubitemid 32075925)
20. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
21. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
22. T. Sauerwald. On mixing and edge expansion properties in randomized broadcasting. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), pages 196-207, 2007.