A Protocol Family for Versatile Survivable Storage Infrastructures (CMU-PDL-03-103)
Garth R. Goodson
Jay J. Wylie
Gregory R. Ganger
Michael K. Reiter
10.1184/R1/6619370.v1
https://kilthub.cmu.edu/articles/journal_contribution/A_Protocol_Family_for_Versatile_Survivable_Storage_Infrastructures_CMU-PDL-03-103_/6619370
Survivable storage systems mask faults. A protocol family shifts the decision of which types of faults from implementation time to data-item creation time. If desired, each data-item can be protected from different types and numbers of faults. This paper describes and evaluates a family of storage access protocols that exploit data versioning to efficiently provide consistency for erasure-coded data. This protocol family supports a wide range of fault models with no changes to the client-server interface or server implementations. Its members also shift overheads to clients. Readers only pay these overheads when they actually observe concurrency or failures. Measurements of a prototype block-store show the efficiency and scalability of protocol family members.
2003-12-01 00:00:00
survivable storage
protocol family
Byzantine fault-tolerance
atomic registers
erasure codes