Search

We study the communication cost of a distributed data storage system using Maximum Distance Separable (MDS) erasure codes. Our focus is reducing the cost of one-to-many communication used in data reconstruction/repair initialization and update operations. We compare two different communication approaches for the above operations; Steiner tree approach and multi-shortest path approach. Our simulations show that while Steiner tree approach has lower message usage, multi-shortest path approach has lower time usage for data reconstruction/repair initialization operations. On the other hand, Steiner tree approach has better message and time metrics for the data update process. Thus, we enable users to choose between the two approaches depending on their needs and priorities. [ABSTRACT FROM AUTHOR]

Distributed storage systems (DSS) play an important role in data storage applications, since they provide high reliability for huge data storage requirement. As node failures are frequent in a large distributed storage system, the performance of repairing node failure causes many researchers' interests. In this paper, we propose a distributed storage code to minimize the coding complexity during the repairing process, at a cost of inducing larger redundancy. Our code construction is based on regular graphs and exploits simple look-up repair. We analyze the performance of the proposed code, and compare them with existing distributed storage codes. Analytical results show that the proposed code outperforms the others in terms of low repair complexity and disk I/O overhead. [ABSTRACT FROM PUBLISHER]

Recently, regenerating codes, a special network coding technique, were discovered for fault-tolerant storage systems with the promising advantage of efficient data recovery in the case of a single node failure and replacement (regeneration case). From the perspective of coding theory, regenerating codes are extensively studied, but there exists no reference on how to implement these codes in storage systems. We provide a comparison of Reed-Solomon codes and regenerating codes from an implementation point of view. The comparison includes the experimental evaluation of the encoding and the regeneration data throughput. [ABSTRACT FROM PUBLISHER]