Quasirandom Rumor Spreading on Expanders

Abstract Randomized rumor spreading is an efficient way to distribute information in networks. Recently, a quasirandom version of this protocol has been proposed. It was proven that it works equally well or even better in many settings. In this work, we exhibit a natural expansion property for networks, which ensures that quasirandom rumor spreading informs all nodes of the network in logarithmic time with high probability. This expansion property is satisfied, among others, by many expander graphs, random regular graphs, and Erdős-Renyi random graphs.

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

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

[3]  Thomas Sauerwald,et al.  Quasirandom rumor spreading , 2008, SODA '08.

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

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

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

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

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