Efficient Byzantine-Tolerant Erasure-Coded Storage

Efficient Byzantine-Tolerant Erasure-Coded Storage (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Garth R. Goodson , Jay J. Wylie , Gregory R. Ganger , Michael K. Reiter

Venue:	PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, JUNE 2004
Citations:	73 - 12 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Efficient Byzantine-Tolerant Erasure-Coded Storage	user correction
AUTHOR NAME	Garth R. Goodson	user correction
AUTHOR AFFIL	Carnegie Mellon University	user correction
AUTHOR NAME	Jay J. Wylie	user correction
AUTHOR AFFIL	Carnegie Mellon University	user correction
AUTHOR NAME	Gregory R. Ganger	user correction
AUTHOR AFFIL	Carnegie Mellon University	user correction
AUTHOR NAME	Michael K. Reiter	user correction
AUTHOR AFFIL	Carnegie Mellon University	user correction
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.	user correction - Legacy Corrections
YEAR	2004	INFERENCE
VENUE	PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, JUNE 2004	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	135--144	INFERENCE
CITATIONS	31 found	ParsCit 1.0