Abstract
In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dimakis, A.G., Godfrey, P.B., Wainwright, M.J., Ramchandran, K.: Network Coding for distributed storage systems. In: Proc. IEEE INFOCOM (May 2007)
Wu, Y., Dimakis, A.G., Ramchandran, K.: Deterministic Regenerating codes for Distributed Storage. In: Allerton Conference on Control, Computing and Communication, Urbana-Champaign (September 2007)
Rashmi, K.V., Shah, N.B., Kumar, P.V., Ramchandran, K.: Explicit construction of optimal exact regenerating codes for distributed storage. In: Proc. Allerton Conference on Control, Computing and Communication, Urbana-Champaign (September 2009)
Shah, N.B., Rashmi, K.V., Kumar, P.V., Ramchandran, K.: Explicit codes minimizing repair bandwidth for distributed storage. In: Proc. IEEE Information Theory Workshop, Cairo (January 2010)
Rashmi, K.V., Shah, N.B., Kumar, P.V., Ramchandran, K.: Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage. In: Proc. IEEE International Symposium on Information Theory, Austin (June 2010)
Cadambe, V.R., Jafar, S.A.: Interference alignment and the degree of freedom for the K user interference channel. IEEE Transactions on Information Theory 54(8), 3425–3441 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shah, N.B., Rashmi, K.V., Kumar, P.V., Ramchandran, K. (2010). Regenerating Codes for Distributed Storage Networks. In: Hasan, M.A., Helleseth, T. (eds) Arithmetic of Finite Fields. WAIFI 2010. Lecture Notes in Computer Science, vol 6087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13797-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-13797-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13796-9
Online ISBN: 978-3-642-13797-6
eBook Packages: Computer ScienceComputer Science (R0)