Regenerating Codes for Distributed Storage Networks

  • Nihar B. Shah
  • K. V. Rashmi
  • P. Vijay Kumar
  • Kannan Ramchandran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6087)

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.

Keywords

Distributed storage MDS codes Regenerating codes Repair bandwidth Interference alignment 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dimakis, A.G., Godfrey, P.B., Wainwright, M.J., Ramchandran, K.: Network Coding for distributed storage systems. In: Proc. IEEE INFOCOM (May 2007)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Nihar B. Shah
    • 1
  • K. V. Rashmi
    • 1
  • P. Vijay Kumar
    • 1
  • Kannan Ramchandran
    • 2
  1. 1.Indian Institute of ScienceBangalore
  2. 2.University of CaliforniaBerkeley

Personalised recommendations