Please use this identifier to cite or link to this item:
https://doi.org/10.1145/2450142.2450147
| Title: | Asynchronous gossip | Authors: | Georgiou, C. Gilbert, S. Guerraoui, R. Kowalski, D.R. |
Keywords: | Adaptive versus oblivious adversary Asynchrony Complexity Consensus Epidemic Gossip Randomization |
Issue Date: | Apr-2013 | Citation: | Georgiou, C., Gilbert, S., Guerraoui, R., Kowalski, D.R. (2013-04). Asynchronous gossip. Journal of the ACM 60 (2) : -. ScholarBank@NUS Repository. https://doi.org/10.1145/2450142.2450147 | 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. © 2013 ACM. | Source Title: | Journal of the ACM | URI: | http://scholarbank.nus.edu.sg/handle/10635/78029 | ISSN: | 00045411 | DOI: | 10.1145/2450142.2450147 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.