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 …

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 …

A new system model reflecting the clustered structure of distributed storage is suggested to
investigate interplay between storage overhead and repair bandwidth as storage node …

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 …

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 …

Rack-aware regenerating codes (RRCs) achieve the optimal repair bandwidth for single
node failures in the hierarchical data center where nodes are organized into racks and the …

In this paper, we address the node repair problem of Reed-Solomon (RS) coded distributed
storage systems. Specifically, to overcome the challenges of multiple-node failures of RS …

Modern data centers often organize storage nodes in racks, in which the cross-rack
communication cost is typically much higher than the intra-rack communication cost. Rack …