Asynchronous gossip

Chryssis Georgiou; Seth Gilbert; Rachid Guerraoui; Dariusz R. Kowalski

doi:10.1145/2450142.2450147

Asynchronous gossip

Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

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	https://doi.org/10.1145/2450142.2450147
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

Access to Document

10.1145/2450142.2450147

Cite this

@article{06aea270fa1742e6b9fdb74e7cd07d5c,

title = "Asynchronous gossip",

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.",

keywords = "Adaptive versus oblivious adversary, Asynchrony, Complexity, Consensus, Epidemic, Gossip, Randomization",

author = "Chryssis Georgiou and Seth Gilbert and Rachid Guerraoui and Kowalski, {Dariusz R.}",

year = "2013",

month = apr,

doi = "10.1145/2450142.2450147",

language = "English (US)",

volume = "60",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Asynchronous gossip

AU - Georgiou, Chryssis

AU - Gilbert, Seth

AU - Guerraoui, Rachid

AU - Kowalski, Dariusz R.

PY - 2013/4

Y1 - 2013/4

N2 - 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.

AB - 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.

KW - Adaptive versus oblivious adversary

KW - Asynchrony

KW - Complexity

KW - Consensus

KW - Epidemic

KW - Gossip

KW - Randomization

UR - http://www.scopus.com/inward/record.url?scp=84877918789&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877918789&partnerID=8YFLogxK

U2 - 10.1145/2450142.2450147

DO - 10.1145/2450142.2450147

M3 - Article

AN - SCOPUS:84877918789

SN - 0004-5411

VL - 60

JO - Journal of the ACM

JF - Journal of the ACM

IS - 2

M1 - 11

ER -

Asynchronous gossip

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this