On the bit communication complexity of randomized rumor spreading

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 134-143

  Fraigniaud, Pierre ^a   Giakkoupis, George ^a  

^a CNRS   (France)

Author keywords

Bit communication complexity; Random phone call; Rumor spreading

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION PARTNERS; MESSAGE COMPLEXITY; OBLIVIOUS ALGORITHMS; OPTIMALITY; PHONE CALLS; RUMOR SPREADING; RUNNING TIME; TIME-OPTIMAL;

ALGORITHMS; OPTIMIZATION; TELEPHONE; TELEPHONE SETS;

COMMUNICATION;

EID: 77954900582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810505     Document Type: Conference Paper

References (18)

1. P. Berenbrink, R. Elsässer, and T. Friedetzky. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC), pages 155-164, 2008.
2. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
3. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2005.
4. 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 Proc. 6th ACM Symp. on Principles of Distributed Computing (PODC), pages 1-12, 1987.
5. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 773-781, 2008.
6. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In Proc. 36th Int. Colloq. on Automata, Languages and Programming (ICALP), pages 366-377, 2009.
7. D. Dubhashi and D. Ranjan. Balls and bins: A study in negative dependence. Random Struct. Algorithms, 13(2):99-124, 1998.
8. R. Elsässer. On randomized broadcasting in power law networks. In Proc. 20th Int. Symp. on Distributed Computing (DISC), pages 370-384, 2006.
9. R. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Proc. 18th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 148-157, 2006.
10. R. Elsässer and T. Sauerwald. The power of memory in randomized broadcasting. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 218-227, 2008.
11. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
12. P. Fraigniaud and E. Lazard. Methods and problems of communication in usual networks. Discrete Appl. Math., 53(1-3):79-133, 1994.
13. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math., 10:57-77, 1985. (Pubitemid 15475455)
14. S. Hedetniemi, T. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. NETWORKS, 18:319-349, 1988.
15. J. Hromkovic, R. Klasing, B. Monien, and R. Piene. Dissemination of information in interconnection networks (broadcasting & gossiping). In Combinatorial Network Theory, pages 125-212. Springer, 1995.
16. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), pages 565-574, 2000.
17. B. Pittel. On spreading a rumor. SIAM J. Appl. Math., 47(1):213-223, 1987.
18. J. H. van Lint. Introduction to Coding Theory. Springer Verlag, 3rd edition, 1998.