Access cost for asynchronous Byzantine quorum systems

Distributed Computing

Volumn 14, Issue 1, 2001, Pages 41-48

  Bazzi, R A ^a  

^a Arizona State University   (United States)

Author keywords

Access cost; Asynchronous; Byzantine failures; Distributed systems; Fault tolerance; Quorum

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS;

ACCESS COST; ASYNCHRONOUS SYSTEMS; BYZANTINE QUORUM SYSTEMS;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 0034881333     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008925     Document Type: Article

References (17)

1. An efficient and fault-tolerant solution for distributed mutual exclusion
2. Planar quorums
3. Synchronous Byzantine quorum systems
4. How to assign votes in a distributed system
5. Weighted voting for replicated data
6. Hierarchical quorum consensus: A new algorithm for managing replicated data
7. A performance study of general grid structures for replicated data
8. A √n algorithm for mutual exclusion in decentralized systems
9. Byzantine quorum systems
10. The load and availability of Byzantine quorum systems
11. A dynamic probe strategy for quorum systems
12. Quorum structures in distributed systems
13. The load capacity and availability of quorum systems
14. How to be an efficient snoop, or the probe complexity of quorum systems
15. The availability of quorum systems
16. A quorum-based commit protocol