Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness

Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor spreading model. We exhibit a natural expansion property for networks which suffices to make quasirandom rumor spreading inform 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˝os-R´enyi random graphs. For all network topologies, we show that if one of the push or pull model works well, so does the other. We also show that quasirandom rumor spreading is robust against transmission failures. If each message sent out gets lost with probability f, then the runtime increases only by a factor of O(1/(1 − f)).

• Type: Conference
• Year: 2009
• Where: ICALP
• Authors: Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
• Keywords: ICALP 2009, Quasirandom Rumor Spreading, Random Graphs, Rumor Spreading, Theoretical Computer Science