Asynchronous gossip

Authors:
Chryssis Georgiou;Seth Gilbert;Rachid Guerraoui;Dariusz R. Kowalski
Affiliations:
University of Cyprus, Nicosia, Cyprus;National University of Singapore, Singapore;École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;University of Liverpool, Liverpool, United Kingdom
Venue:
Journal of the ACM (JACM)
Year:
2013

Citing 22
Cited 0

Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Fast asynchronous Byzantine agreement with optimal resilience

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Bounding Work and Communication in Robust Cooperative Computation

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
Randomized protocols for asynchronous consensus

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
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)

Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Efficient gossip and robust distributed computation

Theoretical Computer Science
Do-All Computing in Distributed Systems

Do-All Computing in Distributed Systems
Robust gossiping with an application to consensus

Journal of Computer and System Sciences
On the complexity of asynchronous gossip

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A gossip-style failure detection service

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Partial information spreading with application to distributed maximum coverage

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time and communication efficient consensus for crash failures

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Randomized gossip algorithms

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. The algorithmic techniques proposed in this article can be used for improving the message complexity of distributed algorithms that rely on an all-to-all message exchange paradigm and are designed for an asynchronous environment. As an example, we show how to improve the message complexity of asynchronous randomized consensus.