Asymptotically optimal randomized rumor spreading

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6756 LNCS, Issue PART 2, 2011, Pages 502-513

  Doerr, Benjamin ^a   Fouz, Mahmoud ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CONSTANT FACTORS; FUNDAMENTAL PROBLEM; NEW PROTOCOL; NODE FAILURE; PUSH OPERATION; RUMOR SPREADING; RUNNING TIME; RUNTIMES; WHOLE PROCESS; WORKING NODES;

ALGORITHMS;

OPTIMIZATION;

EID: 79960021239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22012-8_40     Document Type: Conference Paper

References (16)

1. Berenbrink, P., Elsässer, R., Friedetzky, T.: Efficient randomized broadcasting in random regular networks with applications in peer-to-peer systems. In: Proc. of 27th ACM Symposium on Principles of Distributed Computation (PODC), pp. 155-164 (2008)
2. Bradonjic, M., Elsässer, R., Friedrich, T., Sauerwald, T., Stauffer, A.: Efficient broadcast on random geometric graphs. In: Proc. of the 21st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1412-1421 (2010)
3. Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of the 42th ACM Symposium on Theory of Computing (STOC), pp. 399-408 (2010)
4. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1-12 (1987)
5. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: Proc. of the 19th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 773-781 (2008)
6. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: Expanders, push vs. Pull, and robustness. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 366-377. Springer, Heidelberg (2009)
7. Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: To appear in the Proceedings of the 43th ACM Symposium on Theory of Computing, STOC (2011)
8. Elsässer, R.: 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), pp. 148-157 (2006)
9. Elsässer, R., Sauerwald, T.: Broadcasting vs. Mixing and information dissemination on cayley graphs. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 163-174. Springer, Heidelberg (2007)
10. Elsässer, R., Sauerwald, T.: On the Power of Memory in Randomized Broadcasting. In: Proceedings of the 19th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 218-227 (2008)
11. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithms 1, 447-460 (1990)
12. Fountoulakis, N., Huber, A.: Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading. SIAM Journal on Discrete Mathematics 23, 1964-1991 (2009)
13. Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics 10, 57-77 (1985)
14. Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized Rumor Spreading. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 565-574 (2000)
15. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS), pp. 482-491 (2003)
16. Sauerwald, T.: On mixing and edge expansion properties in randomized broadcasting. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 196-207. Springer, Heidelberg (2007)