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
A guided tour of Chernoff bounds
Information Processing Letters
Adaptive broadcasting with faulty nodes
Parallel Computing
Time Bound for Broadcasting in Bounded Degree Graphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
On the fault tolerance of some popular bounded-degree networks
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On randomized broadcasting in star graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The Weighted Coupon Collector's Problem and Applications
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
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 mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Efficient broadcasting in random power law networks
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Quasirandom rumor spreading: An experimental analysis
Journal of Experimental Algorithmics (JEA)
Coalescing random walks and voting on graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Direction-reversing quasi-random rumor spreading with restarts
Information Processing Letters
Hi-index | 0.00 |
One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol. At some time t an information r is placed at one of the nodes of a graph. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it. In this work, we develop tight bounds on the runtime of the algorithm described above, and analyze its robustness. First, it is shown that on Δ-regular graphs this algorithm requires at least $\log_{2-\frac{1}{\Delta}} N + \log_{ (\frac{\Delta}{\Delta-1})^{\Delta}} N -- o(\log N)$ rounds to inform all N nodes. For general graphs, we prove a slightly weaker lower bound and improve the upper bound of Feige et. al. [8] to (1+o(1)) N ln N which implies that K1,N−−1 is the worst-case graph. Furthermore, we determine the worst-case-ratio between the runtime of a fastest deterministic algorithm and the randomized one. This paper also contains an investigation of the robustness of this broadcasting algorithm against random node failures. We show that if the informed nodes are allowed to fail in some step with probability 1–p, then the broadcasting time increases by a factor of at most 6/p. Finally, the previous result is applied to state some asymptotically optimal upper bounds for the runtime of randomized broadcasting in Cartesian products of graphs and to determine the performance of agent based broadcasting [6] in graphs with good expansion properties.