1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1145/2450142.2450147
DC FieldValue
dc.titleAsynchronous gossip
dc.contributor.authorGeorgiou, C.
dc.contributor.authorGilbert, S.
dc.contributor.authorGuerraoui, R.
dc.contributor.authorKowalski, D.R.
dc.date.accessioned2014-07-04T03:11:36Z
dc.date.available2014-07-04T03:11:36Z
dc.date.issued2013-04
dc.identifier.citationGeorgiou, 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
dc.identifier.issn00045411
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/78029
dc.description.abstractWe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/2450142.2450147
dc.sourceScopus
dc.subjectAdaptive versus oblivious adversary
dc.subjectAsynchrony
dc.subjectComplexity
dc.subjectConsensus
dc.subjectEpidemic
dc.subjectGossip
dc.subjectRandomization
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1145/2450142.2450147
dc.description.sourcetitleJournal of the ACM
dc.description.volume60
dc.description.issue2
dc.description.page-
dc.description.codenJOACF
dc.identifier.isiut000318628500005
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.