Optimally simulating crash failures in a byzantine environment

Rida Bazzi, Gil Neiger

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

4 Citations (Scopus)

Abstract

The difficulty of designing of fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate. Researchers have simplified this task by developing methods that automatically translate protocols tolerant of “benign” failures into ones tolerant of more “severe” failures. In addition to simplifying the design task, these translations can provide insight into the relative impact of different models of faulty behavior on the ability to provide fault-tolerant applications. Such insights can be gained by examining the properties of the translations. The roundcomplexity of a translation is such a property; it is the number of rounds of communication that the translation uses to simulate one round of the original algorithm. This paper considers synchronous systems and examines the problem of developing translations from simple stopping (crash) failures to completely arbitrary behavior with round-complexities 2, 3, and 4, respectively. In each case, we show a lower bound on the number of processors that must remain correct. We show matching upper bounds for all of these by developing three new translation techniques that are each optimal in the number of processors required. These results fully characterize the optimal translations between crash and arbitrary failures.

Original languageEnglish (US)
Title of host publicationDistributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings
PublisherSpringer Verlag
Pages108-128
Number of pages21
Volume579 LNCS
ISBN (Print)9783540552369
DOIs
StatePublished - 1992
Externally publishedYes
Event5th International Workshop on Distributed Algorithms, WDAG 1991 - Delphi, Greece
Duration: Oct 7 1991Oct 9 1991

Publication series

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

Other

Other5th International Workshop on Distributed Algorithms, WDAG 1991
CountryGreece
CityDelphi
Period10/7/9110/9/91

Fingerprint

Crash
Parallel algorithms
Network protocols
Fault-tolerant
Communication
Synchronous Systems
Arbitrary
Distributed Algorithms
Lower bound
Upper bound

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bazzi, R., & Neiger, G. (1992). Optimally simulating crash failures in a byzantine environment. In Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings (Vol. 579 LNCS, pp. 108-128). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 579 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0022441

Optimally simulating crash failures in a byzantine environment. / Bazzi, Rida; Neiger, Gil.

Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings. Vol. 579 LNCS Springer Verlag, 1992. p. 108-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 579 LNCS).

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

Bazzi, R & Neiger, G 1992, Optimally simulating crash failures in a byzantine environment. in Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings. vol. 579 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 579 LNCS, Springer Verlag, pp. 108-128, 5th International Workshop on Distributed Algorithms, WDAG 1991, Delphi, Greece, 10/7/91. https://doi.org/10.1007/BFb0022441
Bazzi R, Neiger G. Optimally simulating crash failures in a byzantine environment. In Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings. Vol. 579 LNCS. Springer Verlag. 1992. p. 108-128. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0022441
Bazzi, Rida ; Neiger, Gil. / Optimally simulating crash failures in a byzantine environment. Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings. Vol. 579 LNCS Springer Verlag, 1992. pp. 108-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6920a0b830e24c35995ff6341a146b15,
title = "Optimally simulating crash failures in a byzantine environment",
abstract = "The difficulty of designing of fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate. Researchers have simplified this task by developing methods that automatically translate protocols tolerant of “benign” failures into ones tolerant of more “severe” failures. In addition to simplifying the design task, these translations can provide insight into the relative impact of different models of faulty behavior on the ability to provide fault-tolerant applications. Such insights can be gained by examining the properties of the translations. The roundcomplexity of a translation is such a property; it is the number of rounds of communication that the translation uses to simulate one round of the original algorithm. This paper considers synchronous systems and examines the problem of developing translations from simple stopping (crash) failures to completely arbitrary behavior with round-complexities 2, 3, and 4, respectively. In each case, we show a lower bound on the number of processors that must remain correct. We show matching upper bounds for all of these by developing three new translation techniques that are each optimal in the number of processors required. These results fully characterize the optimal translations between crash and arbitrary failures.",
author = "Rida Bazzi and Gil Neiger",
year = "1992",
doi = "10.1007/BFb0022441",
language = "English (US)",
isbn = "9783540552369",
volume = "579 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "108--128",
booktitle = "Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Optimally simulating crash failures in a byzantine environment

AU - Bazzi, Rida

AU - Neiger, Gil

PY - 1992

Y1 - 1992

N2 - The difficulty of designing of fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate. Researchers have simplified this task by developing methods that automatically translate protocols tolerant of “benign” failures into ones tolerant of more “severe” failures. In addition to simplifying the design task, these translations can provide insight into the relative impact of different models of faulty behavior on the ability to provide fault-tolerant applications. Such insights can be gained by examining the properties of the translations. The roundcomplexity of a translation is such a property; it is the number of rounds of communication that the translation uses to simulate one round of the original algorithm. This paper considers synchronous systems and examines the problem of developing translations from simple stopping (crash) failures to completely arbitrary behavior with round-complexities 2, 3, and 4, respectively. In each case, we show a lower bound on the number of processors that must remain correct. We show matching upper bounds for all of these by developing three new translation techniques that are each optimal in the number of processors required. These results fully characterize the optimal translations between crash and arbitrary failures.

AB - The difficulty of designing of fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate. Researchers have simplified this task by developing methods that automatically translate protocols tolerant of “benign” failures into ones tolerant of more “severe” failures. In addition to simplifying the design task, these translations can provide insight into the relative impact of different models of faulty behavior on the ability to provide fault-tolerant applications. Such insights can be gained by examining the properties of the translations. The roundcomplexity of a translation is such a property; it is the number of rounds of communication that the translation uses to simulate one round of the original algorithm. This paper considers synchronous systems and examines the problem of developing translations from simple stopping (crash) failures to completely arbitrary behavior with round-complexities 2, 3, and 4, respectively. In each case, we show a lower bound on the number of processors that must remain correct. We show matching upper bounds for all of these by developing three new translation techniques that are each optimal in the number of processors required. These results fully characterize the optimal translations between crash and arbitrary failures.

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

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

U2 - 10.1007/BFb0022441

DO - 10.1007/BFb0022441

M3 - Conference contribution

AN - SCOPUS:85029503324

SN - 9783540552369

VL - 579 LNCS

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

SP - 108

EP - 128

BT - Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings

PB - Springer Verlag

ER -