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 …

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 …

We study a generalization of the setting of regenerating codes, motivated by applications to
storage systems consisting of clusters of storage nodes. There are n clusters in total, with m …

The paper is devoted to the problem of erasure coding in distributed storage. We consider a
model of storage that assumes that nodes are organized into equally sized groups, called …

Erasure codes offer a storage-efficient redundancy mechanism for maintaining data
availability guarantees in storage clusters, yet also incur high network traffic consumption …

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 …

A novel coding scheme for exact repair-regenerating codes is presented in this paper. The
codes proposed in this work can trade between the repair bandwidth of nodes (number of …

The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating
codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware …

Clustered storage systems are dominant solutions for the era of data-intensive computing.
Ceph represents a sustainable clustered storage solution, supporting object, block, and file …

With the exponentially growing earth observation data of specific sensor-determined
resolutions and update frequencies, earth observation has irreversibly arrived in the Big …