Strong Robustness of Randomized Rumor Spreading Protocols
Benjamin Doerr, Anna Huber, and Ariel Levavi

TL;DR
This paper analyzes the robustness of quasirandom rumor spreading protocols in complete networks, showing they are nearly as resilient as fully random protocols under transmission failures with precise run-time bounds.
Contribution
It provides a detailed, tight analysis of the quasirandom rumor spreading protocol's robustness, including exact run-time bounds under transmission failures.
Findings
Quasirandom protocol remains robust with near-optimal run-time under transmission failures.
Run-time increases by a factor related to transmission success probability p.
Lower bounds confirm the quasirandom protocol's robustness matches that of fully random protocols.
Abstract
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission failures? In this paper, we present a result precise up to factors. We limit ourselves to the network in which every two vertices are connected by a direct link. Run-times accurate to their leading constants are unknown for all other non-trivial networks. We show that if each transmission reaches its destination with a probability of , after rounds the quasirandom protocol has informed all nodes in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpportunistic and Delay-Tolerant Networks · Complex Network Analysis Techniques · Peer-to-Peer Network Technologies
