Lazy verification in fault-tolerant distributed storage systems

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2005, Pages 179-190

  Abd El Malek, Michael ^a   Ganger, Gregory R ^a   Goodson, Garth R ^b   Reiter, Michael K ^a   Wylie, Jay J ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Network Appliance Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT OPERATIONS; STORAGE SYSTEMS; STORAGE-NODES; VERIFICATION;

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION TECHNOLOGY; NETWORK PROTOCOLS; STORAGE ALLOCATION (COMPUTER);

FAULT TOLERANT COMPUTER SYSTEMS;

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

References (27)

1. R. A. Bazzi and Y. Ding. Non-skipping timestamps for Byzantine data storage systems. DISC, 2004.
2. B. Becker, S. Gschwind, T. Ohler, P. Widmayer, and B. Seeger. An asymptotically optimal multiversion b-tree. VLDB Journal, 5(4):264-275, 1996.
3. T. Blackwell, J. Harris, and M. Seltzer. Heuristic cleaning algorithms in log-structured file systems. USENIX Annual Technical Conference, pages 277-288. USENIX Association, 1995.
4. C. Cachin and S. Tessaro. Asynchronous verifiable infromation dispersal. Symposium on Reliable Distributed Systems. IEEE, 2005.
5. C. Cachin and S. Tessaro. Brief announcement: Optimal resilience for erasure-coded Byzantine distributed storage. International Symposium on Distributed Computing. Springer, 2005.
6. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398-461, November 2002.
7. W. Dai. Crypto++. http://www.cryptopp.com/.
8. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. IEEE Symposium on Foundations of Computer Science, pages 427-437. IEEE, 1987.
9. R. Golding, P. Bosch, C. Staelin, T. Sullivan, and J. Wilkes. Idleness is not sloth. Winter USENIX Technical Conference, pages 201-212. USENIX Association, 1995.
10. L. Gong. Securely replicating authentication services. International Conference on Distributed Computing Systems, pages 85-91. IEEE Computer Society Press, 1989.
11. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. International Conference on Dependable Systems and Networks, 2004.
12. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. The safety and liveness properties of a protocol family for versatile survivable storage infrastructures. Technical report CMU-PDL-03-105. Parallel Data Laboratory, Carnegie Mellon University, Pittsburgh, PA, March 2004.
13. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages, 13(1): 124-149. ACM Press, 1991.
14. M. Herlihy, V. Luchangco, and M. Moir. Obstructionfree synchronization: double-ended queues as an example. International Conference on Distributed Computing Systems, pages 522-529. IEEE, 2003.
15. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492. ACM, July 1990.
16. [ 16] L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401. ACM, July 1982.
17. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering, 12(2): 187-202. IEEE, April 2000.
18. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. International Symposium on Distributed Computing, 2002.
19. T. P. Pedersen. Non-interactive and informationtheoretic secure verifiable secret sharing. Advances in Cryptology - CRYPTO, pages 129-140. SpringerVerlag, 1991.
20. M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335-348. ACM, April 1989.
21. M. K. Reiter. The Rampart toolkit for building high-integrity services. Theory and Practice in Distributed Systems (Lecture Notes in Computer Science 938), pages 99-110, 1995.
22. M. Rosenblum and J. K. Ousterhout. The design and implementation of a log-structured file system. ACM Transactions on Computer Systems, 10(1):2652. ACM Press, February 1992.
23. C. Ruemmler and J. Wilkes. UNIX disk access patterns. Winter USENIX Technical Conference, pages 405-420, 1993.
24. C. Ruemmler and J. Wilkes. A trace-driven analysis of disk working set sizes. HPL-OSR-93-23. Hewlett-Packard Company, April 1993.
25. C. A. N. Soules, G. R. Goodson, J. D. Strunk, and G. R. Ganger. Metadata efficiency in versioning file systems. Conference on File and Storage Technologies, pages 43-58. USENIX Association, 2003.
26. J. D. Strunk, G. R. Goodson, M. L. Scheinholtz, C. A. N. Soules, and G. R. Ganger. Sell-securing storage: protecting data in compromised systems. Symposium on Operating Systems Design and Implementation, pages 165-180. USENIX Association, 2000.
27. J. J. Wylie, G. R. Goodson, G. R. Ganger, and M. K. Reiter. A protocol family approach to survivable storage infrastructures. FuDiCo II: S.O.S. (Survivability: Obstacles and Solutions), 2nd Bertinoro Workshop on Future Directions in Distributed Computing, 2004.