• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Efficient Byzantine-Tolerant Erasure-Coded Storage (2004)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.pdl.cmu.edu]
  • [www.ece.cmu.edu]
  • [www.pdl.cmu.edu]
  • [www.hpl.hp.com]
  • [www.pdl.cs.cmu.edu]
  • [www.pdl.cmu.edu]
  • [www.ece.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.hpl.hp.com]
  • [www.pdl.cmu.edu]
  • [www.pdl.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.hpl.hp.com]
  • [www.ece.cmu.edu]
  • [www.ssrc.ucsc.edu]
  • [www.pdl.cs.cmu.edu]
  • [www.pdl.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
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
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Goodson04efficientbyzantine-tolerant,
    author = {Garth R. Goodson and Jay J. Wylie and Gregory R. Ganger and Michael K. Reiter},
    title = {Efficient Byzantine-Tolerant Erasure-Coded Storage},
    booktitle = {PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, JUNE 2004},
    year = {2004},
    pages = {135--144},
    publisher = {}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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.

Citations

1404 How to share a secret - Shamir - 1979
1300 Impossibility of distributed consensus with one faulty process - Fischer, Lynch, et al. - 1985
1069 The byzantine generals problem - Lamport, Shostak, et al. - 1982
847 Oceanstore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
777 Wide-area cooperative storage with CFS - Dabek, Kaashoek, et al. - 2001
774 Linearizability: A correctness condition for concurrent objects - Herlihy, Wing - 1990
760 Scale and performance in a distributed file system - Howard, Kazar, et al. - 1988
716 Implementing fault-tolerant services using the state machine approach: a tutorial - Schneider - 1990
660 Wait-free synchronization - Herlihy - 1991
607 Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility - Rowstron, Druschel - 2001
581 Kerberos: An authentication service for open network systems - Steiner, Neuman, et al. - 1988
476 Practical Byzantine fault tolerance - Castro, Liskov - 1999
412 cient Dispersal of Information for Security Load Balancing and Fault Tolerance - Rabin, \E - 1989
404 Keying hash functions for message authentication - Bellare, Canetti, et al. - 1996
400 Consensus in the presence of partial synchrony - Dwork, Lynch, et al. - 1988
399 Measurements of a distributed file system - Baker, Hartman, et al. - 1991
366 Byzantine quorum systems - Malkhi, Reiter - 1997
336 FARSITE: Federated, available, and reliable storage for an incompletely trusted environment - Adya, Bolosky, et al. - 2002
248 Practical Byzantine Fault Tolerance and Proactive Recovery - Castro, Liskov
210 Atomic broadcast: from simple message diffusion to Byzantine agreement - Cristian, Aghili, et al. - 1995
196 A Practical Scheme for Non-interactive Verifiable Secret Sharing - Feldman - 1987
164 et al. Oceanstore: an architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al.
118 Self-securing storage: Protecting data in compromised systems - Strunk, Goodson, et al. - 2000
90 Implementing atomic actions on decentralized data - Reed - 1983
75 Metadata efficiency in versioning file systems. Conference on File and Storage Technologies (San Francisco - Soules, Goodson, et al. - 2000
73 Interactive Consistency with Multiple Failure Modes - Thambidurai, Park - 1988
65 et al. Scale and performance in a distributed file system - Howard - 1988
62 Minimal byzantine storage - Martin, Alvisi, et al. - 2002
59 Secure and efficient asynchronous broadcast protocols - Cachin, Kursawe, et al. - 2001
57 Fault-tolerant wait-free shared objects - Jayanti, Chandra, et al. - 1998
56 Survivable information storage systems - Wylie, Bigrigg, et al. - 2000
44 The load and availability of Byzantine quorum systems - Malkhi, Reiter, et al.
43 How to make replicated data secure - Herlihy, Tygar - 1987
43 Storage-based intrusion detection: watching storage activity for suspicious behavior - Pennington, Strunk, et al. - 2003
42 Self-* storage: Brick-based storage with automated administration - Ganger, Strunk, et al. - 2003
42 A distributed file service based on optimistic concurrency control - Mullender, Tanenbaum - 1985
41 How to securely replicate services - Reiter, Birman - 1994
31 Fab: enterprise storage systems on a shoestring - Frølund, Merchant, et al.
30 An emperical study of a highly available file system - Noble, Satyanarayanan - 1994
26 The SecureRing group communication system - Kihlstrom, Moser, et al. - 2001
22 A continuum of failure models for distributed computing - Garay, Perry - 1992
21 Veitch: A decentralized algorithm for erasure-coded virtual disks - Frølund, Merchant, et al.
20 Reliable scheduling in a TMR database system - Pittelli, Garcia-Molina - 1989
16 Principal features of the voltan family of reliable node architectures for distributed systems - Shrivastava, Ezhilchelvan, et al. - 1992
16 Erasure coding vs. replication: a quantitative approach - Weatherspoon, Kubiatowicz - 2002
15 Securely replicating authentication services - Gong - 1989
12 Integrating security with fault-tolerant distributed databases - Agrawal, Abbadi - 1990
11 Intrusion Detection, Diagnosis, and Recovery with SelfSecuring Storage - Strunk, Goodson, et al. - 2002
10 The safety and liveness properties of a protocol family for versatile survivable storage infrastructures - Goodson, Wylie, et al. - 2004
9 Secure and Scalable Replication - Malkhi, Reiter - 1998
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University