On the Complexity of Asynchronous Gossip

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the latter case, we present three randomized algorithms for achieving gossip, each offering a different trade-off between time and message complexity. We then show how to use these gossip algorithms to develop message-efficient asynchronous (randomized) consensus protocols.


Published in:
Proceedings of the 27th Annual Symposium on Principles of Distributed Computing
Presented at:
27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008
Year:
2008
Keywords:
Laboratories:




 Record created 2008-06-05, last modified 2018-09-13

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)