Fault detection for Byzantine quorum systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 9, 2001, Pages 996-1007

  Alvisi, Lorenzo ^a,b   Malkhi, Dahlia ^c   Pierce, Evelyn ^d   Reiter, Michael K ^e  

^a IEEE   (United States)

^b University of Texas at Austin   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d EPFL   (Switzerland)

^e Bell Laboratories   (United States)

Author keywords

Byzantine fault tolerance; Fault detection; Quorum systems; Replicated data

Indexed keywords

BYZANTINE QUORUM SYSTEMS; FAILURE DETECTION;

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SYSTEM RECOVERY; NETWORK PROTOCOLS; SERVERS; SET THEORY; STATISTICAL METHODS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0035438917     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.954640     Document Type: Article

References (21)

1. Fault detection for byzantine quorum systems
2. Synchronous byzantine quorum systems
3. Distributed on-line diagnosis in the presence of arbitrary faults
4. Unreliable failure detectors for reliable distributed systems
5. Backoff protocols for distributed mutual exclusion and ordering
6. Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems
7. Solving consensus in a byzantine environment using an unreliable failure detector
8. On interprocess communication (Part II: Algorithms)
9. A √n algorithm for mutual exclusion in decentralized systems
10. A comparison connection assignment for self-diagnosis of multiprocessor systems
11. A comparison connection assignment for diagnosis of multiprocessor systems
12. An architecture for survivable coordination in large distributed systems
13. Byzantine quorum systems
14. Unreliable intrusion detection in distributed computation
15. The load and availability of byzantine quorum systems
16. Probabilistic byzantine quorum systems
17. Diagnosis of processors with byzantine faults in a distributed computing system