Byzantine-Tolerant Erasure-Coded Storage

Abstract

This paper describes a decentralized consistency protocol for survivable storage that exploits data versioning within storage-nodes. 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. Exploiting versioning storage-nodes, the protocol shifts most work to clients. Reads occur in a single round-trip unless clients observe concurrency or write failures. Measurements of a storage system using this protocol show that the protocol scales well with the number of failures tolerated, and that it outperforms a highly-tuned instance of Byzantine-tolerant state machine replication.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 2003
Accession Number
ADA490141

Entities

People

  • Garth R. Goodson
  • Gregory R. Ganger
  • Jay J. Wylie
  • Michael Reiter

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Cyber

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Authentication
  • Classification
  • Coding
  • Computations
  • Computer Programming
  • Computer Science
  • Consistency
  • Data Storage Systems
  • Detection
  • Intrusion Detection
  • Measurement
  • Models
  • Multithreading
  • Network Protocols
  • Validation

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Parallel and Distributed Computing.