Agile store: Experience with quorum-based data replication techniques for adaptive Byzantine fault tolerance

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2005, Pages 143-154

  Kong, Lei ^a   Manohar, Deepak J ^a   Subbiah, Arun ^b   Sun, Michael ^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

CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL METHODS; COMPUTER OPERATING SYSTEMS; DATABASE SYSTEMS; INFORMATION TECHNOLOGY; NETWORK PROTOCOLS; PARAMETER ESTIMATION; SOFTWARE PROTOTYPING;

FAULT THRESHOLD; PROBABILISTIC HASHING; QUORUM PROTOCOLS; RECONFIGURABLE QUORUM TECHNIQUES;

FAULT TOLERANT COMPUTER SYSTEMS;

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

References (23)

1. Ntp v3 rfc 1305. http://www.faqs.org/rfcs/rfc1305.html, Mar. 1992.
2. The aware home research initiative, college of computing, georgia tech. http://www.cc.gatech.edu/fce/ahri/, 2000.
3. th OSDI, Dec. 2002.
4. L. Alvisi and et al. Dynamic byzantine quorum systems. In Proc. DSN, 2000.
5. L. Alvisi, D. Malkhi, E. Pierce, and M. Reiter. Fault detection for byzantine quorum systems. IEEE Trans. on Parallel and Distr. Sys., 12(9), 2001.
6. R. J. Anderson. The eternity service. Proc. of 1st Intl. Conf. on Theory and Appln of Cryptography (Pragocrypt), 1996.
7. M. Castro and B. Liskov. Proactive recovery in a byzantine fault tolerant system. In Proc. 4th OSDI, 2000.
8. th ACM Intl. Conf. on Digital Libraries, pages 28-37, Aug. 1999.
9. S. Frolund and et al. A decentralized algorithm for erasurecoded virtual disks. In Proc. DSN, 2004.
10. D. K. Gifford. Weighted voting for replicated data. In Proceedings of the 7th SOSP, pages 150-162, 1979.
11. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient byzantine-tolerant erasure-coded storage. In Proc. DSN, 2004.
12. M. Herlihy and J. Tygar. How to make replicated data secure. In Advances in Cryptology, 1987.
13. J. H. Howard and et al. Scale and performance in a distributed file system. ACM Trans. on Comp. Sys., Feb. 1988.
14. L. Kong, A. Subbiah, M. Ahamad, and D. Blough. A reconfigurable byzantine quorum approach for the agile store. In Proc. 22nd SRDS, pages 219-228, 2003.
15. S. Lakshmanan, D. Manohar, M. Ahamad, and H. Venkateswaran. Collective endorsement and the dissemination problem in malicious environments. In Proc. DSN, 2004.
16. L. Lamport. On interprocess communication, part 1: Basic formalism. Distributed Computing, 1:77-85, 1986.
17. D. Malkhi and et al. Persistent objects in the fleet system. In Proceedings of the 2nd DARPA Information Survivability Conference and Exposition, 2004.
18. D. Malkhi and M. Reiter. Byzantine quorum systems. Distributed Computing, 11(4), 1998.
19. th SRDS, Oct. 1998.
20. J. P. Martin and L. Alvisi. A framework for dynamic byzantine storage. In Proc. DSN, 2004.
21. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4), Dec. 1990.
22. D. Tulone. Enhancing efficiency of byzantine-tolerant coordination protocols via hash functions. In Euro-Par, 2004.
23. White, Lepreau, Stoller, Ricci, Guruprasad, Newbold, Hibler, Barb, and Joglekar. An integrated experimental environment for distributed systems and networks. In Proc. OSDI, Dec. 2002.