A reconfigurable Byzantine quorum approach for the agile store

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2003, Pages 219-228

  Kong, Lei ^a   Subbiah, Arun ^b   Ahamad, Mustaque ^a   Blough, Douglas M ^b  

^a Georgia Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGILE STORE; BYZANTINE QUORUMS; FAULTY SERVERS; QUORUM-BASED PROTOCOLS;

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; DATA HANDLING; FAULT TOLERANT COMPUTER SYSTEMS; SERVERS; SYSTEMS ANALYSIS;

NETWORK PROTOCOLS;

EID: 27644582892     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2003.1238071     Document Type: Conference Paper

References (14)

1. L. Alvisi, D. Malkhi, E. Pierce, M. Reiter, and R. N. Wright. Dynamic byzantine quorum systems. In Proc. Intl. Conf. on Dependable Systems and Networks, pages 283-292, 2000.
2. L. Alvisi, D. Malkhi, E. Pierce, and M. K. Reiter. Fault detection for byzantine quorum systems. IEEE Trans. on Parallel and Distributed Systems, 12(9):996-1007, Sep. 2001.
3. F. Barsi, F. Grandoni, and P. Maestrini. A theory of diagnosability of digital systems. IEEE Trans. Computers, pages 585-593, June 1976.
4. S. Y. Cheung, M. H. Ammar, and M. Ahamad. The grid protocol: A high performance scheme for maintaining replicated data. Knowledge and Data Engineering, 4(6):582-592, 1992.
5. D. K. Gifford. Weighted voting for replicated data. In Proc. of the 7th SOSP, pages 150-162, 1979.
6. S. Lakshmanan, M. Ahamad, and H. Venkateswaran. A secure and highly available distributed store for meeting diverse data storage needs. In Proc. Intl Conf. on Dependable Systems and Networks, pages 251-260, 2001.
7. S. Lakshmanan, M. Ahamad, and H. Venkateswaran. Responsive security for stored data. In Proc.Intl. Conf. on Distributed Computing Systems, pages 146-154, May 2003.
8. L. Lamport. On interprocess communication, part I: Basic formalism. Distr Comp., 1(2):77-85, 1986.
9. M. Malek. A comparison connection assignment for diagnosis of multiprocessor systems. In Proc. of the 7th Annual Symp. on Computer Architecture, pages 31-36, 1980.
10. D. Malkhi, Y. Mansour, and M. K. Reiter. On diffusing updates in a byzantine environment. In Symp. on Reliable Distributed Systems, pages 134-143, 1999.
11. D. Malkhi and M. Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203-213, 1998.
12. J. Martin, L. Alvisi, and M. Dahlin. Small Byzantine quorum systems. In Proc. of the Intl. Conf. on Dependable Systems & Networks, pages 374-383, 2002.
13. F. P. Preparata, G. Metze, and R. T. Chien. On the connection assignment problem of diagnosable systems. IEEE Trans. Electronic Computers, pages 848-854, Dec 1967.
14. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4), Dec 1990.