General Sub-packetized Access-Optimal Regenerating Codes
Authors:
- 2 May 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 20 (10897798) , 1
Abstract
This letter presents a novel construction of (n, k, d = n - 1) access-optimal regenerating codes for an arbitrary sub-packetization level α for exact repair of any systematic node. We refer to these codes as general sub-packetized, because we provide an algorithm for constructing codes for any α less than or equal to r [(k/r)] , where (k/r) is not necessarily an integer. This leads to a flexible construction of codes for different code rates compared with existing approaches. We derive the lower and upper bounds of the repair bandwidth. The repair bandwidth depends on the code parameters and α. The repair process of a failed systematic node is linear and highly parallelized, which means that a set of [(α/r)] symbols is independently repaired first and used along with the accessed data from other nodes to recover the remaining symbols.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- A high-rate MSR code with polynomial sub-packetization level2015
- An alternate construction of an access-optimal regenerating code with optimal sub-packetization level2015
- A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centersACM SIGCOMM Computer Communication Review, 2014
- Zigzag Codes: MDS Array Codes With Optimal RebuildingIEEE Transactions on Information Theory, 2012
- Access vs. bandwidth in codes for storage2012
- Polynomial length MDS codes with optimal repair in distributed storage2011
- On codes for optimal rebuilding access2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Erasure Coding Vs. Replication: A Quantitative Comparison2002