We survey the recent results on applying error control coding to distributed storage systems. In such systems, errors often happen in a burst manner, or maybe only one storage node in the whole distributed system fails. Therefore, only a small amount of information, e.g., one data fragment, has to be recovered. Therefore, accessing the whole data is unnecessary. Especially, we focus on regenera...

In a distributed storage environment the data file is not placed in just one but in more than one devices which are connected through a network. There are many examples such as RAID systems and Internet storage applications. When data needs to be stored, there is usually one issue it needs to be faced: the availability of such data. Basically, this data needs to be persistent over time and resi...

In a distributed storage system, recovering from multiple failures is a critical and frequent task that is crucial for maintaining the system’s reliability and fault-tolerance. In this work, we focus on the problem of repairing multiple failures in a centralized way, which can be desirable in many data storage configurations, and we show that a significant repair traffic reduction is possible. ...

It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundancy and reliability; under this criterion, an Maximum Distance Separable (MDS) code is optimal. However, practical storage systems call for additional considerations. In particular,...

The rate region of the (5, 4, 4) exact-repair regenerating codes is provided. The outer bound is obtained through extension of the computational approach developed in an earlier work, and this region is indeed achievable using the canonical layered codes. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.

data and to be protected against corruptions. To preserves this outsourced data against error it becomes critical to add fault tolerance along with failure reparation and integrity checking of data to cloud storage. Newly regenerating codes because of its lower repair bandwidth have acquired popularity which also provides fault tolerance. The existing method for regenerating-codes that is remot...

We study the problem of erasure correction (node repair) for regenerating codes defined on graphs wherein cost transmitting information to failed node depends graphical distance from this helper vertices graph. The passed helpers traverses several graph, and savings in communication complexity can be attained if intermediate process rather than simply relaying it toward node. derive simple info...