SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Search in JXTA and Other Distributed Networks
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Strong Robustness of Randomized Rumor Spreading Protocols
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Rumor spreading on random regular graphs and expanders
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Communication complexity of quasirandom rumor spreading
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Why rumors spread so quickly in social networks
Communications of the ACM
A scheduling method considering heterogeneous clients for NVoD systems
Proceedings of the 10th International Conference on Advances in Mobile Computing & Multimedia
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
| Hi-index | 0.02 |
Broadcasting algorithms are of fundamental importance for distributed systems engineering. In this paper we revisit the classical and well-studied push protocol for message broadcasting and we investigate a faulty version of it. Assuming that initially only one node has some piece of information, at each stage every one of the informed nodes chooses randomly and independently one of its neighbors and passes the message to it with some probability q; that is, it fails to do so with probability 1 - q. The performance of the push protocol on a fully connected network, where each node is joined by a link to every other node, with q = 1 is very well understood. In particular, Frieze and Grimmett proved that with probability 1 - o(1) the push protocol completes the broadcasting of the message within (1 ± Ɛ)(log2 n + ln n) stages, where n is the number of nodes in the network. However, there are no tight bounds for the broadcast time on networks that are significantly sparser than the complete graph. In this work we consider random networks on n nodes, where every edge is present with probability p, independently of every other edge. We show that if p ≥ α(n) ln n/n, where α(n) is any function that tends to infinity as n grows, then the push protocol with faulty transmissions broadcasts the message within (1 ± Ɛ) (log1+q n + 1/q ln n) stages with probability 1 - o(1). In other words, in almost every network of density d such that d ≥ α(n) ln n, the push protocol broadcasts a message as fast as in a fully connected network and the speed is only affected by the success probability q. This is quite surprising in the sense that the time needed remains essentially unaffected by the fact that most of the links are missing. Our results are accompanied by experimental evaluation.