Efficient Consistency for Erasure-Coded Data via Versioning Servers

Abstract

This paper describes the design, implementation and performance of a family of protocols for survivable, decentralized data storage. These protocols exploit storage-node versioning to efficiently achieve strong consistency semantics. These protocols allow erasure-codes to be used that achieve network and storage efficiency (and optionally data confidentiality in the face of server compromise). The protocol family is general in that its parameters accommodate a wide range of fault and timing assumptions, up to asynchrony and Byzantine faults of both storage-nodes and clients, with no changes to server implementation or client-server interface. Measurements of a prototype storage system using these protocols show that the protocol performs well under various system model assumptions, numbers of failures tolerated, and degrees of reader-writer concurrency.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 2003
Accession Number
ADA461126

Entities

People

  • Garth R. Goodson
  • Gregory R. Ganger
  • Jay J. Wylie
  • Micahel K. Reiter

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Asynchronous Systems
  • Availability
  • Classification
  • Coding
  • Computer Programming
  • Computer Science
  • Consistency
  • Cryptography
  • Damage Detection
  • Data Storage Systems
  • Decoding
  • Detection
  • Efficiency
  • Intrusion Detection

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Networking