(Enter summary)
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... (Update)
Cited by: More
Ursa Minor: versatile cluster-based storage - Michael Abd-El-Malek William
(Correct)
Stardust: Tracking Activity in a Distributed Storage.. - Michael Abd-El-Malek..
(Correct)
Informed Data Distribution Selection in a - Self-Predicting Storage System
(Correct)
Active bibliography (related documents): More All
1.9: Appears in the Proceedings of the International.. - Efficient..
(Correct)
1.1: Efficient Byzantine-tolerant erasure-coded storage - Garth Goodson Jay (2003)
(Correct)
0.7: A Protocol Family for Versatile Survivable Storage - Infrastructures Garth Goodson
(Correct)
Similar documents based on text: More All
0.6: Byzantine-Tolerant Erasure-Coded Storage - Garth Goodson Jay (2003)
(Correct)
0.5: The Safety and Liveness Properties of a Protocol.. - Goodson, Wylie.. (2004)
(Correct)
0.5: A Protocol Family for Versatile Survivable Storage.. - Goodson, Wylie.. (2003)
(Correct)
Related documents from co-citation: More All
13: Linearizability: A correctness condition for concurrent objects (context) - Herlihy, Wing - 1992
11: Efficient dispersal of information for security (context) - Rabin - 1989
11: Survivable information storage systems
- Wylie, Bigrigg et al. - 2000
BibTeX entry: (Update)
G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. Technical report CMU-PDL-03-104. CMU, December 2003. http://citeseer.ist.psu.edu/article/goodson04efficient.html More
@misc{ goodson03efficient,
author = "G. Goodson and J. Wylie and G. Ganger and M. Reiter",
title = "Efficient Byzantine-tolerant erasure-coded storage",
text = "G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant
erasure-coded storage. Technical report CMU-PDL-03-104. CMU, December 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/goodson04efficient.html" }
Citations (may not include all citations):
739
Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
539
Scale and performance in a distributed file system (context) - Howard - 1988
449
OceanStore: an architecture for globalscale persistent stora..
- Kubiatowicz - 2000
350
Implementing fault-tolerant services using the state machine..
- Schneider - 1990
326
Linearizability: a correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
317
Kerberos: an authentication service for open network systems
- Steiner, Schiller et al. - 1988
189
Keying hash functions for message authentication
- Bellare, Canetti et al. - 1996
163
Efficient dispersal of information for security (context) - Rabin - 1989
57
Self-securing storage: protecting data in compromised system..
- Strunk, Goodson et al. - 2000
55
Interactive consistency with multiple failure modes (context) - Thambidurai, Park - 1988
48
How to make replicated data secure
- Herlihy, Tygar - 1987
46
Survivable information storage systems
- Wylie - 2000
46
Fault-tolerant waitfree shared objects
- Jayanti, Chandra et al. - 1998
26
Practical Byzantine fault tolerance and proactive recovery (context) - Castro, Liskov - 2002
25
An empirical study of a highly available file system
- Noble, Satyanarayanan - 1994
24
Metadata efficiency in versioning file systems
- Soules, Goodson et al. - 2003
20
Securely replicating authentication services (context) - Gong - 1989
20
Storage: brick-based storage with automated administration (context) - Ganger, Strunk et al. - 2003
20
Efficient Byzantine-tolerant erasure-coded storage
- Goodson, Wylie et al. - 2003
19
Persistent objects in the Fleet system
- Malkhi, Reiter et al. - 2001
18
International Symposium on Distributed Computing (context) - Martin, Alvisi et al. - 2002
16
ACM Transactions on Programming Languages (context) - Herlihy - 1991
15
FAB: enterprise storage systems on a shoestring (context) - Frlund, Merchant et al. - 2003
10
The safety and liveness properties of a protocol family for ..
- Goodson, Wylie et al. - 2004
9
Storage: from atoms to people (context) - Morris - 2002
8
ACM Symposium on Operating System Principles (context) - Baker, Hartman et al. - 1991
4
Byzantine fault tolerance can be fast (context) - Castro, Liskov - 2001
4
ACM Symposium on Theory of Computing (context) - Malkhi, Reiter et al. - 1997
2
centralized algorithm for erasure-coded virtual disks (context) - Frlund, Merchant et al. - 2004
http://www.pmg.lcs.mit.edu/bft/#sw
http://cryptopp.sourceforge.net/docs/ref/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ece.cmu.edu/~reiter/papers/): More
Two-Party Generation of DSA Signatures (Extended Abstract) - MacKenzie, Reiter (2001)
(Correct)
Efficient Update Diffusion in Byzantine Environments - Malkhi, Reiter, al. (2001)
(Correct)
Alternatives to Non-malleability: Definitions.. - MacKenzie, Reiter, Yang (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC