Please use this identifier to cite or link to this item:
|Keywords:||Adaptive versus oblivious adversary|
|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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jun 18, 2018
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.