Name
Abstract | ||
|---|---|---|
This paper describes a decentralized consistency protocolfor survivable storage that exploits local data versioningwithin each storage-node. Such versioning enables the protocolto efficiently provide linearizability and wait-freedomof read and write operations to erasure-coded data in asynchronousenvironments with Byzantine failures of clientsand servers. By exploiting versioning storage-nodes, theprotocol shifts most work to clients and allows highly optimisticoperation: reads occur in a single round-trip unlessclients observe concurrency or write failures. Measurementsof a storage system prototype using this protocolshow that it scales well with the number of failures tolerated,and its performance compares favorably with an efficientimplementation of Byzantine-tolerant state machine replication. |
Year | Venue | Keywords |
|---|---|---|
2004 | DSN | byzantine failure,clientsand server,storage system prototype,versioning storage-nodes,local data,erasure-coded data,theprotocol shift,single round-trip unlessclients,byzantine-tolerant state machine replication,decentralized consistency protocolfor survivable,efficient byzantine-tolerant erasure-coded storage,encoding,protocols,col,state machine,erasure code,storage system,byzantine failures,configuration management |
Field | DocType | ISBN |
Linearizability,Asynchronous communication,State machine replication,Concurrency,Computer science,Server,Computer network,Byzantine fault tolerance,Real-time computing,Quantum Byzantine agreement,Software versioning,Distributed computing | Conference | 0-7695-2052-9 |
Citations | PageRank | References |
105 | 5.53 | 45 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Garth R. Goodson | 1 | 679 | 43.14 |
| Jay J. Wylie | 2 | 685 | 44.29 |
| Gregory R. Ganger | 3 | 4560 | 383.16 |
| Michael K. Reiter | 4 | 8695 | 764.03 |