Interactive consistency with multiple failure modes
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 93-100
- https://doi.org/10.1109/reldis.1988.25784
Abstract
The authors address the problem of reaching Byzantine agreement in a distributed system in the presence of different types of faults and show that significant improvements in reliability and performance are possible if faults can be partitioned into disjoint classes. They show that, in a distributed system, to guarantee Byzantine agreement requires N>2a+2s+b+r where N is the total number of processors, a is the number of malicious asymmetric faults (a<or=r), s the number of malicious symmetric faults, b the number of nonmalicious or intercepted faults, and r an algorithm-dependent term. The practical value of this unified model in designing ultrareliable systems is demonstrated by examples.Keywords
This publication has 8 references indexed in Scilit:
- Consensus with dual failure modesIEEE Transactions on Parallel and Distributed Systems, 1991
- The MAFT architecture for distributed fault toleranceIEEE Transactions on Computers, 1988
- Simulating authenticated broadcasts to derive simple fault-tolerant algorithmsDistributed Computing, 1987
- Streets of Byzantium: Network Architectures for Fast Reliable BroadcastsIEEE Transactions on Software Engineering, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- SIFT: Design and analysis of a fault-tolerant computer for aircraft controlProceedings of the IEEE, 1978