On the complexity of fault-tolerant consensus

Dariusz R. Kowalski, Jarosław Mirek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by Constrained adversaries - a Weakly-Adaptive adversary, who has to fix, in advance, the set of f crash-prone processes, and a k-Chain-Ordered adversary, who orders all the processes into k disjoint chains and has to follow this order when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used Strongly-Adaptive adversaries model attacks and Non-Adaptive ones - pre-defined faults, Constrained adversaries model more realistic scenarios when there are fault-prone dependent processes, e.g., in hierarchical or dependable software/hardware systems. In this view, our approach helps to understand better the crash-tolerant consensus in more realistic executions. We propose time-efficient consensus algorithms against such adversaries. We complement our algorithmic results with (almost) tight lower bounds, and extend the one for Weakly-Adaptive adversaries to hold also for (syntactically) weaker Non-Adaptive adversaries. Together with the consensus algorithm against Weakly-Adaptive adversaries (which automatically translates to the Non-Adaptive adversaries), these results extend the state-of-the-art of the popular class of Non-Adaptive adversaries, in particular, the result of Chor, Meritt and Shmoys [7], and prove separation gap between Constrained adversaries (including Non-Adaptive ones) and Strongly-Adaptive adversaries, analyzed by Bar-Joseph and Ben-Or [3] and others.

Original languageEnglish (US)
Title of host publicationNetworked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers
EditorsMohamed Faouzi Atig, Alexander A. Schwarzmann
PublisherSpringer
Pages19-31
Number of pages13
ISBN (Print)9783030312763
DOIs
StatePublished - Jan 1 2019
Event7th International Conference on Networked Systems, NETYS 2019 - Marrakech, Morocco
Duration: Jun 19 2019Jun 21 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11704 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Networked Systems, NETYS 2019
CountryMorocco
CityMarrakech
Period6/19/196/21/19

Fingerprint

Fault-tolerant
Crash
Message passing
Hardware
Fault
Message Passing
Disjoint
Complement
Attack
Lower bound
Scenarios
Software
Dependent
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kowalski, D. R., & Mirek, J. (2019). On the complexity of fault-tolerant consensus. In M. F. Atig, & A. A. Schwarzmann (Eds.), Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers (pp. 19-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11704 LNCS). Springer. https://doi.org/10.1007/978-3-030-31277-0_2

On the complexity of fault-tolerant consensus. / Kowalski, Dariusz R.; Mirek, Jarosław.

Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers. ed. / Mohamed Faouzi Atig; Alexander A. Schwarzmann. Springer, 2019. p. 19-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11704 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kowalski, DR & Mirek, J 2019, On the complexity of fault-tolerant consensus. in MF Atig & AA Schwarzmann (eds), Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11704 LNCS, Springer, pp. 19-31, 7th International Conference on Networked Systems, NETYS 2019, Marrakech, Morocco, 6/19/19. https://doi.org/10.1007/978-3-030-31277-0_2
Kowalski DR, Mirek J. On the complexity of fault-tolerant consensus. In Atig MF, Schwarzmann AA, editors, Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers. Springer. 2019. p. 19-31. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-31277-0_2
Kowalski, Dariusz R. ; Mirek, Jarosław. / On the complexity of fault-tolerant consensus. Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers. editor / Mohamed Faouzi Atig ; Alexander A. Schwarzmann. Springer, 2019. pp. 19-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{eca1fefe2876402bbde1a3c15a4e10de,
title = "On the complexity of fault-tolerant consensus",
abstract = "We consider the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by Constrained adversaries - a Weakly-Adaptive adversary, who has to fix, in advance, the set of f crash-prone processes, and a k-Chain-Ordered adversary, who orders all the processes into k disjoint chains and has to follow this order when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used Strongly-Adaptive adversaries model attacks and Non-Adaptive ones - pre-defined faults, Constrained adversaries model more realistic scenarios when there are fault-prone dependent processes, e.g., in hierarchical or dependable software/hardware systems. In this view, our approach helps to understand better the crash-tolerant consensus in more realistic executions. We propose time-efficient consensus algorithms against such adversaries. We complement our algorithmic results with (almost) tight lower bounds, and extend the one for Weakly-Adaptive adversaries to hold also for (syntactically) weaker Non-Adaptive adversaries. Together with the consensus algorithm against Weakly-Adaptive adversaries (which automatically translates to the Non-Adaptive adversaries), these results extend the state-of-the-art of the popular class of Non-Adaptive adversaries, in particular, the result of Chor, Meritt and Shmoys [7], and prove separation gap between Constrained adversaries (including Non-Adaptive ones) and Strongly-Adaptive adversaries, analyzed by Bar-Joseph and Ben-Or [3] and others.",
author = "Kowalski, {Dariusz R.} and Jarosław Mirek",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-31277-0_2",
language = "English (US)",
isbn = "9783030312763",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "19--31",
editor = "Atig, {Mohamed Faouzi} and Schwarzmann, {Alexander A.}",
booktitle = "Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers",

}

TY - GEN

T1 - On the complexity of fault-tolerant consensus

AU - Kowalski, Dariusz R.

AU - Mirek, Jarosław

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We consider the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by Constrained adversaries - a Weakly-Adaptive adversary, who has to fix, in advance, the set of f crash-prone processes, and a k-Chain-Ordered adversary, who orders all the processes into k disjoint chains and has to follow this order when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used Strongly-Adaptive adversaries model attacks and Non-Adaptive ones - pre-defined faults, Constrained adversaries model more realistic scenarios when there are fault-prone dependent processes, e.g., in hierarchical or dependable software/hardware systems. In this view, our approach helps to understand better the crash-tolerant consensus in more realistic executions. We propose time-efficient consensus algorithms against such adversaries. We complement our algorithmic results with (almost) tight lower bounds, and extend the one for Weakly-Adaptive adversaries to hold also for (syntactically) weaker Non-Adaptive adversaries. Together with the consensus algorithm against Weakly-Adaptive adversaries (which automatically translates to the Non-Adaptive adversaries), these results extend the state-of-the-art of the popular class of Non-Adaptive adversaries, in particular, the result of Chor, Meritt and Shmoys [7], and prove separation gap between Constrained adversaries (including Non-Adaptive ones) and Strongly-Adaptive adversaries, analyzed by Bar-Joseph and Ben-Or [3] and others.

AB - We consider the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by Constrained adversaries - a Weakly-Adaptive adversary, who has to fix, in advance, the set of f crash-prone processes, and a k-Chain-Ordered adversary, who orders all the processes into k disjoint chains and has to follow this order when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used Strongly-Adaptive adversaries model attacks and Non-Adaptive ones - pre-defined faults, Constrained adversaries model more realistic scenarios when there are fault-prone dependent processes, e.g., in hierarchical or dependable software/hardware systems. In this view, our approach helps to understand better the crash-tolerant consensus in more realistic executions. We propose time-efficient consensus algorithms against such adversaries. We complement our algorithmic results with (almost) tight lower bounds, and extend the one for Weakly-Adaptive adversaries to hold also for (syntactically) weaker Non-Adaptive adversaries. Together with the consensus algorithm against Weakly-Adaptive adversaries (which automatically translates to the Non-Adaptive adversaries), these results extend the state-of-the-art of the popular class of Non-Adaptive adversaries, in particular, the result of Chor, Meritt and Shmoys [7], and prove separation gap between Constrained adversaries (including Non-Adaptive ones) and Strongly-Adaptive adversaries, analyzed by Bar-Joseph and Ben-Or [3] and others.

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

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

U2 - 10.1007/978-3-030-31277-0_2

DO - 10.1007/978-3-030-31277-0_2

M3 - Conference contribution

AN - SCOPUS:85075608827

SN - 9783030312763

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 31

BT - Networked Systems - 7th International Conference, NETYS 2019, Revised Selected Papers

A2 - Atig, Mohamed Faouzi

A2 - Schwarzmann, Alexander A.

PB - Springer

ER -