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
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics
Balls and bins: a study in negative dependence
Random Structures & Algorithms
ACM Transactions on Computer Systems (TOCS)
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The age of gossip: spatial mean field regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
Strong Robustness of Randomized Rumor Spreading Protocols
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient information exchange in the random phone-call model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Faster coupon collecting via replication with applications in gossiping
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call model (introduced by Karp et al. [1]), and we analyze two different notions of robustness: the ability to tolerate adaptive failures, and the ability to tolerate oblivious failures. For adaptive failures, we present a new gossip protocol, TrickleGossip, which achieves near-optimal O(n log3 n) message complexity. To the best of our knowledge, this is the first epidemic-style protocol that can tolerate adaptive failures. We also show a direct relation between resilience and message complexity, demonstrating that gossip protocols which tolerate a large number of adaptive failures need to use a super-linear number of messages with high probability. For oblivious failures, we present a new gossip protocol, CoordinatedGossip, that achieves optimal O(n) message complexity. This protocol makes novel use of the universe reduction technique to limit the message complexity.