Strong robustness of randomized rumor spreading protocols

Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission failures? In this paper, we present a result precise up to (1+/-o(1)) factors. We limit ourselves to the network in which the vertices form a clique. Run-times accurate to their leading constants are unknown for all other non-trivial networks. We show that if each transmission reaches its destination with probability p@?(0,1], after (1+@e)(1log"2(1+p)log"2n+1plnn) rounds where @e>0 is fixed, the quasirandom protocol has informed all n nodes in the network with probability at least 1-n^-^p^@e^/^4^0. Note that this is slightly faster than the intuitively natural 1/p factor increase over the run-time of approximately log"2n+lnn for the non-corrupted case. We also provide a corresponding lower bound for the classical model. This demonstrates that the quasirandom model is at least as robust as the fully random model despite the greatly reduced degree of independent randomness.

[1]  Silvio Lattanzi,et al.  Almost tight bounds for rumour spreading with conductance , 2010, STOC '10.

[2]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[3]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4]  B. Pittel.  On spreading a rumor , 1987 .

[5]  Konstantinos Panagiotou,et al.  Tight Bounds for Quasirandom Rumor Spreading , 2009, Electron. J. Comb..

[6]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[7]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[8]  Anna Huber,et al.  Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading , 2009, SIAM J. Discret. Math..

[9]  Devavrat Shah,et al.  Computing separable functions via gossip , 2005, PODC '06.

[10]  Silvio Lattanzi,et al.  Rumor spreading in social networks , 2009, Theor. Comput. Sci..

[11]  Thomas Sauerwald,et al.  Rumor spreading and vertex expansion on regular graphs , 2011, SODA '11.

[12]  Mahmoud Fouz,et al.  Why rumors spread so quickly in social networks , 2012, Commun. ACM.

[13]  Silvio Lattanzi,et al.  Rumour spreading and graph conductance , 2010, SODA '10.

[14]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[15]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[16]  Benjamin Doerr,et al.  Quasirandom rumor spreading , 2008, SODA 2008.

[17]  Thomas Sauerwald,et al.  Ultra-fast rumor spreading in social networks , 2012, SODA.

[18]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[19]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[20]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[21]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[22]  Konstantinos Panagiotou,et al.  Reliable Broadcasting in Random Networks and the Effect of Density , 2010, 2010 Proceedings IEEE INFOCOM.

[23]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[24]  George Giakkoupis,et al.  Rumor spreading and vertex expansion , 2012, SODA.

[25]  Thomas Sauerwald,et al.  Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.

[26]  Mahmoud Fouz,et al.  Social Networks Spread Rumors in Sublogarithmic Time , 2011, Electron. Notes Discret. Math..

[27]  Thomas Sauerwald,et al.  On the runtime and robustness of randomized broadcasting , 2009, Theor. Comput. Sci..

[28]  Mahmoud Fouz,et al.  Asynchronous Rumor Spreading in Preferential Attachment Graphs , 2012, SWAT.

[29]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[30]  Thomas Sauerwald,et al.  On Mixing and Edge Expansion Properties in Randomized Broadcasting , 2007, Algorithmica.

[31]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[32]  George Giakkoupis,et al.  Tight bounds for rumor spreading in graphs of a given conductance , 2011, STACS.

[33]  Thomas Sauerwald,et al.  Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness , 2009, ICALP.

[34]  Thomas Sauerwald,et al.  Quasirandom rumor spreading: An experimental analysis , 2008, JEAL.