Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and
liveness guarantees for distributed systems that must operate in the presence of arbitrary …

In a distributed storage system, code symbols are dispersed across space in nodes or
storage units as opposed to time. In settings such as that of a large data center, an important …

Codes are widely used in many engineering applications to offer robustness against noise.
In large-scale systems, there are several types of noise that can affect the performance of …

Windows Azure Storage (WAS) is a cloud storage system that provides customers the ability
to store seemingly limitless amounts of data for any duration of time. WAS customers have …

Distributed storage systems for large clusters typically use replication to provide reliability.
Recently, erasure codes have been used to reduce the large storage overhead of three …

A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the
encoding is a function of a small number (at most r) other symbols. We present a family of …

We present BEAT, a set of practical Byzantine fault-tolerant (BFT) protocols for completely
asynchronous environments. BEAT is flexible, versatile, and extensible, consisting of five …

Consider a linear [n, k, d] q code C. We say that the i th coordinate of C has locality r, if the
value at this coordinate can be recovered from accessing some other r coordinates of C …

Distributed storage systems for large-scale applications typically use replication for
reliability. Recently, erasure codes were used to reduce the large storage overhead, while …

Distributed storage systems provide reliable access to data through redundancy spread over
individually unreliable nodes. Application scenarios include data centers, peer-to-peer …