Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 194

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Efficient Byzantine-tolerant erasure-coded storage

Goodson, G.R., Wylie, J.J., Ganger, G.R., Reiter, M.K. · 2004 · International Conference on Dependable Systems and Networks, 2004

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/dsn.2004.1311884

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 194

Metadata

Authors
Goodson, G. R., Wylie, J. J., Ganger, G. R., & Reiter, M. K.
Venue
International Conference on Dependable Systems and Networks, 2004
Publisher
IEEE
Published
2004
Pages
135-144
OpenAlex
W2171337572
Cited by
194
References
4
FWCI
9.99
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient Byzantine-tolerant erasure-coded storage. https://app.cochat.ai/papers/10.1109/dsn.2004.1311884
The paper
Goodson, G. R., Wylie, J. J., Ganger, G. R., & Reiter, M. K. (2004). Efficient Byzantine-tolerant erasure-coded storage. International Conference on Dependable Systems and Networks, 2004. https://doi.org/10.1109/dsn.2004.1311884

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.