A fault-scalable service can be configured to tolerate increasing numbers of faults without
significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that …

The emerging use of the Internet for remote storage and backup has led to the problem of
verifying that storage sites in a distributed system indeed store the data; this must often be …

In the past few years, all manner of storage applications, ranging from disk array systems to
distributed and wide-area systems, have started to grapple with the reality of tolerating …

This paper considers replication strategies for storage systems that aggregate the disks of
many nodes spread over the Internet. Maintaining replication in such systems can be …

Reliability and availability are increasingly important in large-scale storage systems built
from thousands of individual storage devices. Large systems must survive the failure of …

Erasure codes provide space-optimal data redundancy to protect against data loss. A
common use is to reliably store data in a distributed system, where erasure-coded data are …

Failures of any type are common in current datacenters, partly due to the higher scales of the
data stored. As data scales up, its availability becomes more complex, while different …

In 1997, SPE published a tutorial by Plank [19] on implementing Reed-Solomon codes for
erasure correction in redundant data storage systems. The motivation of this tutorial was to …

Various techniques have been proposed in the literature to improve erasure code
computation efficiency, including optimizing bitmatrix design and computation schedule …

As peer-to-peer and widely distributed storage systems proliferate, the need to perform
efficient erasure coding, instead of replication, is crucial to performance and efficiency. Low …