On the Push&Pull Protocol for Rumor Spreading

The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph G, is defined as follows. Independent exponential clocks of rate 1 are associated with the vertices of G, one to each vertex. Initially, one vertex of G knows the rumour. Whenever the clock of a vertex x rings, it calls a random neighbour y: if x knows the rumour and y does not, then x tells y the rumour (a push operation), and if x does not know the rumour and y knows it, y tells x the rumour (a pull operation). The average spread time of G is the expected time it takes for all vertices to know the rumour, and the guaranteed spread time of G is the smallest time t such that with probability at least 1 − 1∕n, after time t all vertices know the rumour. The synchronous variant of this protocol, in which each clock rings precisely at times 1, 2, …, has been studied extensively.

[1]  Amin Saberi,et al.  On the spread of viruses on the internet , 2005, SODA '05.

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

[3]  Béla Bollobás,et al.  Combinatorics, geometry, and probability : a tribute to Paul Erdős , 1997 .

[4]  Thomas Sauerwald,et al.  Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions , 2012, Algorithmica.

[5]  Konstantinos Panagiotou,et al.  Rumor spreading on random regular graphs and expanders , 2010, Random Struct. Algorithms.

[6]  Marc Lelarge,et al.  Flooding in Weighted Sparse Random Graphs , 2013, SIAM J. Discret. Math..

[7]  Yoshiharu Kohayakawa,et al.  On Richardsons model on the hypercube , 1997 .

[8]  Mahmoud Fouz,et al.  Experimental Analysis of Rumor Spreading in Social Networks , 2012, MedAlg.

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

[10]  Rick Durrett,et al.  STOCHASTIC GROWTH MODELS: RECENT RESULTS AND OPEN PROBLEMS , 1989 .

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

[12]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[13]  James Allen Fill,et al.  PERCOLATION, FIRST-PASSAGE PERCOLATION, AND COVERING TIMES FOR RICHARDSON'S MODEL ON THE n-CUBE (Short title: PERCOLATION ON THE CUBE) , 1993 .

[14]  George Giakkoupis.  Tight Bounds for Rumor Spreading with Vertex Expansion , 2014, SODA.

[15]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

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

[17]  Mahmoud Fouz,et al.  Social networks spread rumors in sublogarithmic time , 2011, STOC '11.

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

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

[20]  C. D. Howard,et al.  Models of First-Passage Percolation , 2004 .

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

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

[23]  Svante Janson,et al.  One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights , 1999, Combinatorics, Probability and Computing.

[24]  Mor Harchol-Balter,et al.  Resource discovery in distributed networks , 1999, PODC '99.

[25]  Konstantinos Panagiotou,et al.  Asynchronous Rumor Spreading on Random Graphs , 2013, ISAAC.

[26]  G. Grimmett,et al.  Probability and random processes , 2002 .

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