Conference Proceeding

Efficient Byzantine-tolerant erasure-coded storage

Carnegie Mellon Univ., Pittsburgh, PA, USA;
DOI:10.1109/DSN.2004.1311884 ISBN: 0-7695-2052-9 pp.135- 144 In proceeding of: Dependable Systems and Networks, 2004 International Conference on
Source: IEEE Xplore

ABSTRACT This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol to efficiently provide linearizability and wait-freedom of read and write operations to erasure-coded data in asynchronous environments with Byzantine failures of clients and servers. By exploiting versioning storage-nodes, the protocol shifts most work to clients and allows highly optimistic operation: reads occur in a single round-trip unless clients observe concurrency or write failures. Measurements of a storage system prototype using this protocol show that it scales well with the number of failures tolerated, and its performance compares favorably with an efficient implementation of Byzantine-tolerant state machine replication.

0 0
 · 
0 Bookmarks
 · 
22 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

Byzantine failures
 
Byzantine-tolerant state machine replication
 
concurrency
 
decentralized consistency protocol
 
erasure-coded data
 
exploiting versioning storage-nodes
 
exploits local data versioning
 
failures
 
linearizability
 
optimistic operation
 
protocol shifts
 
single round-trip
 
storage-node
 
versioning enables
 
wait-freedom