A protocol family approach to survivable storage infrastructures
暂无分享,去创建一个
[1] Marcos K. Aguilera,et al. Failure detection and consensus in the crash-recovery model , 1998, Distributed Computing.
[2] Michael Dahlin,et al. Minimal Byzantine Storage , 2002, DISC.
[3] Michael K. Reiter,et al. Efficient Byzantine-tolerant erasure-coded storage , 2004, International Conference on Dependable Systems and Networks, 2004.
[4] Michael K. Reiter,et al. The Safety and Liveness Properties of a Protocol Family for Versatile Survivable Storage Infrastructures (CMU-PDL-03-105) , 2004 .
[5] Arif Merchant,et al. FAB: Enterprise Storage Systems on a Shoestring , 2003, HotOS.
[6] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[7] Philip M. Thambidurai,et al. Interactive consistency with multiple failure modes , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.
[8] Sam Toueg,et al. Distributed agreement in the presence of processor and communication faults , 1986, IEEE Transactions on Software Engineering.
[9] Flaviu Cristian,et al. Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement , 1995, Inf. Comput..
[10] Gregory R. Ganger,et al. Self-* Storage: Brick-based Storage with Automated Administration (CMU-CS-03-178) , 2003 .
[11] Arif Merchant,et al. A decentralized algorithm for erasure-coded virtual disks , 2004, International Conference on Dependable Systems and Networks, 2004.
[12] Matti A. Hiltunen,et al. Supporting customized failure models for distributed software , 1999, Distributed Syst. Eng..
[13] Michael K. Reiter,et al. A Protocol Family for Versatile Survivable Storage Infrastructures (CMU-PDL-03-103) , 2003 .