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 …

Erasure coding is a low-cost redundancy mechanism for distributed storage systems by
storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the …

With increase in scale, the number of node failures in a data center increases sharply. To
ensure availability of data, failure-tolerance schemes such as Reed-Solomon (RS) or more …

We propose repair pipelining, a technique that speeds up the repair performance in general
erasure-coded storage. By carefully scheduling the repair of failed data in small-size units …

Minimum-storage regenerating (MSR) codes are provably optimal erasure codes that
minimize the repair bandwidth (ie, the amount of traffic being transferred during a repair …

Erasure coding is widely used for massive storage in data centers to achieve high fault
tolerance and low storage redundancy. Since the cross-rack communication cost is often …

Repair performance in hierarchical data centers is often bottlenecked by cross-rack network
transfer. Recent theoretical results show that the cross-rack repair traffic can be minimized …

The traditional means of ensuring reliability in data storage is to store multiple copies of the
same file in different storage units. Such a replication strategy is clearly inefficient in terms of …

As a common choice for fault tolerance in today's storage systems, erasure coding is still
hampered by the induced substantial traffic in repair. A variety of erasure codes and repair …

To repair a failed block in the erasure-coded storage system, multiple related blocks have to
be retrieved from other storage nodes across the network. Such a process can lead to …