Reaching Agreement in the Presence of Faults

@article{Pease1980ReachingAI,
  title={Reaching Agreement in the Presence of Faults},
  author={Marshall C. Pease and Robert E. Shostak and Leslie Lamport},
  journal={J. ACM},
  year={1980},
  volume={27},
  pages={228-234}
}
The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that… 
A LOWER BOUND FOB THE TIME TO ASSUBE INTEBACTIVE CONSiSTENCV
TLDR
It is shown that any algorithm which assures interactive consistency in the presence of m faulty processors requires at least m + 1 rounds of communication, and is answered in the negative.
Distributed Function Evaluation in the Presence of Transmission Faults
TLDR
The maximum number of transmission faults per clock cycle that can be tolerated for the computation of arbitrary or specific functions, with several types of faults, is characterized.
Agreement under Faulty Interfaces
Byzantine agreement and network failures
TLDR
A new Byzantine Agreement algorithm is presented which uses fewer messages than other currently known algorithms under a certain range of parameters and terminates in an optimal number of rounds of message exchanges.
A new solution for the Byzantine agreement problem
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
TLDR
This paper presents the first known agreement and leader election algorithm for asynchronous complete networks in which the processors are reliable but some channels may be Byzantine faulty and shows that the bound on the number of faulty channels is optimal.
New Approach to Improve the Generalized Byzantine Agreement Problem
TLDR
This study proposes a novel and efficient protocol that can compare and replace the messages received from other processors to find out the reliable processors and replaceThe value sent by the un-reliable processors through four rounds of message exchange even when the total number of faulty components or the total of processors in the system is large.
The Agreement Problem in Unreliable Scale-Free Networks
TLDR
A new BA protocol is proposed that adapts to the scale-free network (SFN) environment and derives its limit of allowable faulty components while maintaining the minimum number of message exchanges.
...
...

References

SHOWING 1-10 OF 11 REFERENCES
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
TLDR
SIFT (Software Implemented Fault Tolerance) is an ultrareliable computer for critical aircraft control applications that achieves fault tolerance by the replication of tasks among processing units by using a novel fault-tolerant synchronization method.
Synchronization and Matching in Redundant Systems
TLDR
A novel mutual feedback technique, called "synchronization voting," is introduced that does not have vulnerability to common-point failures and is described in the appendix—a fault-tolerant crystal-controlled clock.
New directions in cryptography
TLDR
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
RECEIVED NOVEMBER REVISED APRIL
  • RECEIVED NOVEMBER REVISED APRIL
  • 1978
Synchronization and matching m redundant systems IEEE Trans on Comptrs
    Synchronization and matching m redundant systems IEEE Trans on Comptrs
    • Synchronization and matching m redundant systems IEEE Trans on Comptrs
    SIFT: design and analysis of a fault-tolerant computer for atrcrafl control Proc
    • IEEE
    • 1978
    L A A method for obtaming dtgltal signatures and pubh ¢key c ~ rptosystems
    • Comm . ACM
    A method for obtaming dtgltal signatures and pubh¢-key c~rptosystems
    • Comm. ACM
    • 1978
    Journal of the Agsoctatton for Computing Machinery
    • Journal of the Agsoctatton for Computing Machinery
    • 1980
    ...
    ...