A Non-MDS Erasure Code Scheme For Storage Applications

Details A Non-MDS Erasure Code Scheme For Storage Applications A Non-MDS Erasure Code Scheme For Storage Applications

2011-09-21

arxiv.org/abs/1109.6646v1

Computer Science

Information Theory

6 pages, 2 figures

Scientific paper

This paper investigates the use of redundancy and self repairing against node failures in distributed storage systems, using various strategies. In replication method, access to one replication node is sufficient to reconstruct a lost node, while in MDS erasure coded systems which are optimal in terms of redundancy-reliability tradeoff, a single node failure is repaired after recovering the entire stored data. Moreover, regenerating codes yield a tradeoff curve between storage capacity and repair bandwidth. The current paper aims at investigating a new storage code. Specifically, we propose a non-MDS (2k, k) code that tolerates any three node failures and more importantly, it is shown using our code a single node failure can be repaired through access to only three nodes.

Affiliated with

Also associated with

No associations

Rating

A Non-MDS Erasure Code Scheme For Storage Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Non-MDS Erasure Code Scheme For Storage Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Non-MDS Erasure Code Scheme For Storage Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258364