Quasirandom rumor spreading: Expanders, Push vs. Pull, and robustness

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

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 366-377

  Doerr, Benjamin ^a   Friedrich, Tobias ^a,b   Sauerwald, Thomas ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANDER GRAPHS; EXPANSION PROPERTIES; HIGH PROBABILITY; IN-NETWORK; LOGARITHMIC TIME; NETWORK TOPOLOGY; QUASI-RANDOM; RANDOM GRAPHS; RANDOM REGULAR GRAPH; RUNTIMES; TRANSMISSION FAILURES;

AUTOMATA THEORY; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; LINGUISTICS; TRANSLATION (LANGUAGES);

NETWORK PROTOCOLS;

EID: 70449092001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_31     Document Type: Conference Paper

References (17)

1. Berenbrink, P., Elsässer, R., Friedetzky, T.: Efficient randomized broadcasting in random regular networks with applications in peer-to-peer systems. In: 27th ACM Symposium on Principles of Distributed Computing (PODC), pp. 155-164 (2008)
2. Cooper, C., Frieze, A.M.: The cover time of sparse random graphs. Random Struct. Algorithms 30, 1-16 (2007)
3. Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H.E., Swinehart, D.C., Terry, D.B.: Epidemic algorithms for replicated database maintenance. Operating Systems Review 22, 8-32 (1988)
4. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 773-781 (2008)
5. Doerr, B., Friedrich, T., Künnemann, M., Sauerwald, T.: Quasirandom rumor spreading: An experimental analysis. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 145-153 (2009)
6. Elsässer, R., Sauerwald, T.: On the Runtime and Robustness of Randomized Broadcasting. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 349-358. Springer, Heidelberg (2006)
7. Erdos, P., Rényi, A.: On random graphs. Publ. Math. Debrecen 6, 290-297 (1959)
8. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithms 1, 447-460 (1990)
9. Friedman, J.: On the second eigenvalue and random walks in random d-regular graphs. Combinatorica 11, 331-362 (1991)
10. Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics 10, 57-77 (1985)
11. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319-349 (1988)
12. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bulletin of the American Mathematical Society 43, 439-561 (2006)
13. Hromkovič, J., Klasing, R., Pelc, A., Ružička, P., Unger, W.: Dissemination of Information in Communication Networks (2005)
14. Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized Rumor Spreading. In: 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: 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482-491 (2003)
16. Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics 47, 213-223 (1987)
17. 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)