License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2021.59
URN: urn:nbn:de:0030-drops-148617
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14861/
Livshits, Ariel ;
Shadmi, Yonatan ;
Tamir (Averbuch), Ran
Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication
Abstract
In this work, we consider a synchronous model of n faultless agents, with a complete communication graph and messages that are lost with some constant probability q ∈ (0,1). In this model we show that there exists a protocol, called the Simple Majority Protocol, that solves consensus in 3 communication rounds with probability of agreement converging to 1 as n → ∞. We also prove that 3 communication rounds are necessary for the SMP to achieve consensus, with high probability.
BibTeX - Entry
@InProceedings{livshits_et_al:LIPIcs.DISC.2021.59,
author = {Livshits, Ariel and Shadmi, Yonatan and Tamir (Averbuch), Ran},
title = {{Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {59:1--59:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14861},
URN = {urn:nbn:de:0030-drops-148617},
doi = {10.4230/LIPIcs.DISC.2021.59},
annote = {Keywords: Majority consensus, probabilistic message loss, distributed systems}
}
|
Keywords: |
|
Majority consensus, probabilistic message loss, distributed systems |
|
Collection: |
|
35th International Symposium on Distributed Computing (DISC 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
04.10.2021 |
