Abstract
Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical code are two classes of codes proposed to reduce the repair bandwidth cost. Regenerating codes reduce the amount of data transferred by each helping node, while hierarchical codes reduce the number of nodes participating in the repair process. In this paper, we propose a “sub-code nesting framework” to combine them together. The resulting regenerating hierarchical code has low repair degree as hierarchical code and lower repair cost than hierarchical code. Our code can achieve exact regeneration of the failed node, and has the additional property of low updating complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Ghemawat, H. Gobioff, Leung Shun-Tak, et al.. The Google file system. ACM Symposium on Operating Systems Principles, New York, NY, USA, 2003, 29–43.
J. Kubiatowicz, D. Bindel, Y. Chen, et al.. OceanStore: an architecture for global-scale persistent storage. International Conference on Architectural Support for Programming Languages and Operating Systems, New York, NY, USA, 2000, 190–201.
A. Duminuco and E. Biersack. Hierarchical codes: how to make erasure codes attractive for peer-to-peer storage systems. International Conference on Peer-to-Peer Computing, Aachen, Germany, 2008, 89–98.
A. Duminuco and E. Biersack. Hierarchical codes: a flexible trade-off for erasure codes in peer-to-peer storage systems. Peer-to-Peer Networking and Applications, 3(2010)1, 52–66.
A. Dimakis, P. Godfrey, M. Wainwright, et al.. Network coding for distributed storage systems. IEEE International Conference on Computer Communications, Anchorage, AL, USA, 2007, 2000–2008.
R. Ahlswede, N. Cai, S. Y. Li, et al.. Network information flow. IEEE Transactions on Information Theory, 46(2000)4, 1204–1216.
Huang Zhen, E. Biersack, and Y. X. Peng. Reducing Repair traffic in P2P backup systems: exact regenerating codes on hierarchical codes. ACM Transactions on Storage, 7(2011)3, Article 10.
K. V. Rashmi, N. B. Shah, P. V. Kumar, et al.. Explicit construction of optimal exact regenerating codes for distributed storage. Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, USA, 2007, 1243–1249.
D. S. Papailioulos and A. G. Dimakis. Distributed storage codes through Hadamard designs. IEEE International Symposium on Information Theory, St. Petersburg, Russia, 2011, 1230–1234.
K. V. Rashmi, N. B. Shah, P. V. Kumar, et al.. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Transactions on Information Theory, 57(2011)8, 5227–5239.
C. Suh and K. Ramchandran. Exact-repair MDS code construction using interference alignment. IEEE Transactions on Information Theory, 57(2011)3, 1425–1442.
N. B. Shah, K. V. Rashmi, P. V. Kumar, et al.. Interference alignment in regenerating codes for distributed storage: Necessity and code constructions. IEEE Transactions on Information Theory, 58(2012)4, 2134–2158.
I. Tamo, Z. Y. Wang, and J. Bruck. MDS array codes with optimal rebuilding. IEEE International Symposium on Information Theory, St. Petersburg, Russia, 2011, 1240–1244.
V. R. Cadambe, C. Huang, J. Li, et al.. Permutation codes: optimal exact repair of a single failed node in MDS code based distributed storage systems. IEEE International Symposium on Information Theory, St. Petersburg, Russia, 2011, 1225–1229.
A. G. Dimakis, K. Ramchandran, Y. N. Wu, et al.. A survey on network codes for distributed storage. Proceedings of the IEEE, 99(2011)3, 476–489.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by 973 Project of China (No. 2012CB315803), Research Fund for the Doctoral Program of Higher Education of China (No. 20100002110033), and Open research Fund of National Mobile Communications Research Laboratory, Southeast University (No. 2011D11).
About this article
Cite this article
Hao, J., Lu, Y., Liu, X. et al. Design of exact regenerating hierarchical code for distributed storage system. J. Electron.(China) 30, 290–298 (2013). https://doi.org/10.1007/s11767-013-3019-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11767-013-3019-0