article

Quasirandom rumor spreading: An experimental analysis

Authors:

Benjamin Doerr,

Tobias Friedrich,

Marvin Künnemann,

Thomas SauerwaldAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 16

Article No.: 3.3, Pages 3.1 - 3.13

https://doi.org/10.1145/1963190.2025379

Published: 16 November 2008 Publication History

Abstract

We empirically analyze two versions of the well-known “randomized rumor spreading” protocol to disseminate a piece of information in networks. In the classical model, in each round, each informed node informs a random neighbor. In the recently proposed quasirandom variant, each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on informs its neighbors in the order of the list.

While for sparse random graphs a better performance of the quasirandom model could be proven, all other results show that, independent of the structure of the lists, the same asymptotic performance guarantees hold as for the classical model.

In this work, we compare the two models experimentally. Not only does this show that the quasirandom model generally is faster, but it also shows that the runtime is more concentrated around the mean. This is surprising given that much fewer random bits are used in the quasirandom process.

These advantages are also observed in a lossy communication model, where each transmission does not reach its target with a certain probability, and in an asynchronous model, where nodes send at random times drawn from an exponential distribution. We also show that typically the particular structure of the lists has little influence on the efficiency.

References

[1]

Bollobás, B. and Kohayakawa, Y. 1997. On Richardson's model on the hypercube. In Combinatorics, Geometry and Probability, B. Bollobás and A. Thomason, Eds. Cambridge University Press, Cambridge, UK, 129--137.

[2]

Cooper, C. and Frieze, A. 2005. The cover time of random regular graphs. SIAM J. Discrete Math. 18, 728--740.

Digital Library

[3]

Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., and Terry, D. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 1--12.

Digital Library

[4]

Diks, K. and Pelc, A. 1998. Broadcasting with universal lists. Networks 27, 183--196.

[5]

Doerr, B., Friedrich, T., and Sauerwald, T. 2008. Quasirandom Rumor Spreading. In Proceedings of the 19th ACM SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 773--781.

Digital Library

[6]

Doerr, B., Friedrich, T., and Sauerwald, T. 2009. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP). Springer, Berlin, 366--377.

Digital Library

[7]

Elsässer, R. and Sauerwald, T. 2006. On the Runtime and Robustness of Randomized Broadcasting. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC). Springer, Berlin, 349--358.

Digital Library

[8]

Erdős, P. and Rényi, A. 1959. On random graphs. Publ. Math. Debrecen 6, 290--297.

[9]

Feige, U., Peleg, D., Raghavan, P., and Upfal, E. 1990. Randomized broadcast in networks. Random Struct. Algorithms 1, 447--460.

[10]

Fill, J. and Pemantle, R. 1993. Percolation, first-passage percolation and covering times for Richardson's model on the n-cube. Ann. Appl. Probab. 3, 593--629.

[11]

Fountoulakis, N. and Huber, A. 2009. Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading. SIAM J. Discrete Math. 23, 1964--1991.

Digital Library

[12]

Frieze, A. and Grimmett, G. 1985. The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10, 57--77.

[13]

Karp, R., Schindelhauer, C., Shenker, S., and Vöcking, B. 2000. Randomized Rumor Spreading. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, Los Alamitos, CA, 565--574.

Digital Library

[14]

Kim, J. and Chwa, K. 2005. Optimal broadcasting with universal lists based on competitive analysis. Networks 45, 224--231.

Digital Library

[15]

Matoušek, J. 1999. Geometric Discrepancy. Springer-Verlag, Berlin.

[16]

Niederreiter, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.

Digital Library

[17]

Steger, A. and Wormald, N. C. 1999. Generating random regular graphs quickly. Comb. Prob. Comput. 8, 377--396.

Digital Library

[18]

Wormald, N. C. 1999. Models of random regular graphs. Surv. Comb. 267, 239--298.

Cited By

Wang ZZhao HNie H(2019)Bibliometric Analysis of Rumor Propagation Research Through Web of Science from 1989 to 2019Journal of Statistical Physics10.1007/s10955-019-02440-y178:2(532-551)Online publication date: 20-Nov-2019
https://doi.org/10.1007/s10955-019-02440-y
Shiraga TYamauchi YKijima SYamashita M(2018)Deterministic Random Walks for Rapidly Mixing ChainsSIAM Journal on Discrete Mathematics10.1137/16M108766732:3(2180-2193)Online publication date: 30-Aug-2018
https://doi.org/10.1137/16M1087667
Avin CElsässer R(2018)Breaking the $$\log n$$logn barrier on rumor spreadingDistributed Computing10.1007/s00446-017-0312-431:6(503-513)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00446-017-0312-4
Show More Cited By

Index Terms

Quasirandom rumor spreading: An experimental analysis
1. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Quasirandom Rumor Spreading

We propose and analyze a quasirandom analogue of the classical push model for disseminating information in networks (“randomized rumor spreading”). In the classical model, in each round, each informed vertex chooses a neighbor at random and informs it, ...
Research on Explosion Model of Network Rumor Spreading
IMMS '19: Proceedings of the 2nd International Conference on Information Management and Management Sciences

With the wide application of mobile social networks, rumor spreading is more explosive, more quickly, and has a bad impact. Therefore, exploring the law of rumor spreading has always been a hot topic of current research. Inspired by the explosion ...
Quasirandom rumor spreading
SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading").

In the classical model, in each round each informed node chooses a neighbor at random and informs it. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 16, Issue

2011

411 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/1963190

Issue’s Table of Contents

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 November 2008

Published in JEA Volume 16

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
215
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang ZZhao HNie H(2019)Bibliometric Analysis of Rumor Propagation Research Through Web of Science from 1989 to 2019Journal of Statistical Physics10.1007/s10955-019-02440-y178:2(532-551)Online publication date: 20-Nov-2019
https://doi.org/10.1007/s10955-019-02440-y
Shiraga TYamauchi YKijima SYamashita M(2018)Deterministic Random Walks for Rapidly Mixing ChainsSIAM Journal on Discrete Mathematics10.1137/16M108766732:3(2180-2193)Online publication date: 30-Aug-2018
https://doi.org/10.1137/16M1087667
Avin CElsässer R(2018)Breaking the $$\log n$$logn barrier on rumor spreadingDistributed Computing10.1007/s00446-017-0312-431:6(503-513)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00446-017-0312-4
Giakkoupis GNazari YWoelfel PGiakkoupis G(2016)How Asynchrony Affects Rumor Spreading TimeProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933117(185-194)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933117
Berenbrink PElsässer RFriedetzky T(2016)Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systemsDistributed Computing10.1007/s00446-016-0264-029:5(317-339)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s00446-016-0264-0
Doerr BWahlström M(2016)How to Generate Randomized Roundings with Dependencies and How to Derandomize ThemAlgorithm Engineering10.1007/978-3-319-49487-6_5(159-184)Online publication date: 11-Nov-2016
https://doi.org/10.1007/978-3-319-49487-6_5
Haeupler BPandurangan GPeleg DRajaraman RSun Z(2016)Discovery Through GossipRandom Structures & Algorithms10.1002/rsa.2062148:3(565-587)Online publication date: 6-Jan-2016
https://doi.org/10.1002/rsa.20621
Kijima SKoga KMakino K(2015)Deterministic random walks on finite graphsRandom Structures & Algorithms10.1002/rsa.2053346:4(739-761)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1002/rsa.20533
Doerr BFriedrich TSauerwald T(2014)Quasirandom Rumor SpreadingACM Transactions on Algorithms10.1145/265018511:2(1-35)Online publication date: 30-Oct-2014
https://dl.acm.org/doi/10.1145/2650185
Doerr BHuber ALevavi A(2013)Strong robustness of randomized rumor spreading protocolsDiscrete Applied Mathematics10.1016/j.dam.2012.10.014161:6(778-793)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1016/j.dam.2012.10.014
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents