Quasirandom rumor spreading: An experimental analysis

2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009

Volumn , Issue , 2009, Pages 145-153

  Doerr, Benjamin ^a   Friedrich, Tobias ^b   Künnemann, Marvin ^c   Sauerwald, Thomas ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS;

ASYMPTOTIC PERFORMANCE; ASYNCHRONOUS MODELS; CLASSICAL MODEL; COMMUNICATION MODELING; EXPERIMENTAL ANALYSIS; EXPONENTIAL DISTRIBUTIONS; QUASI-RANDOM PROCESS; RANDOM POSITION;

GRAPH THEORY;

EID: 67651200435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.14     Document Type: Conference Paper

References (14)

1. B. Bollobas and Y. Kohayakawa. On Richardson's model on the hypercube. In B. Bollobas and A. Thomason, editors, Combinatorics, Geometry and Probability, pp. 129-137. Cambridge University Press, 1997.
2. C. Cooper and A. Frieze. The Cover Time of Random Regular Graphs. SIAM Journal of Discrete Mathematics, 18:728-740, 2005.
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 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1-12, 1987.
4. B. Doerr and A. Huber. Tight bounds for quasirandom rumor spreading. Submitted.
5. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom Rumor Spreading. In 19th ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 773-781, 2008.
6. R. Elsasser and T. Sauerwald. On the Runtime and Robustness of Randomized Broadcasting. In 17th International Symposium on Algorithms and Computation (ISAAC), pp. 349-358, 2006.
7. P. Erdos and A. Renyi. On random graphs. Publ. Math. Debrecen, 6:290-297, 1959.
8. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1:447-460, 1990.
9. J. Fill and R. Pemantle. Percolation, first-passage percolation and covering times for Richardson's model on the n-cube. Annals of Applied Probability, 3:593-629, 1993.
10. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Dis- crete Applied Mathematics, 10:57-77, 1985.
11. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized Rumor Spreading. In 41st IEEE Symposium on Foundations of Com- puter Science (FOCS), pp. 565-574, 2000.
12. J. Matousek. Geometric Discrepancy. Springer- Verlag, Berlin, 1999.
13. H. Niederreiter. Random number generation and quasi-Monte Carlo methods, Vol. 63 of CBMS-NSF Regional Conference Series in Applied Mathemat- ics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992.
14. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47:213-223, 1987.