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.
Original language | English (US) |
---|---|
Article number | 11 |
Journal | Journal of the ACM |
Volume | 60 |
Issue number | 2 |
DOIs | |
State | Published - Apr 2013 |
Externally published | Yes |
Keywords
- Adaptive versus oblivious adversary
- Asynchrony
- Complexity
- Consensus
- Epidemic
- Gossip
- Randomization
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence