Network coding for distributed storage systems

  • Authors:

  • Alexandros G. Dimakis;P. Brighten Godfrey;Yunnan Wu;Martin J. Wainwright;Kannan Ramchandran

  • Affiliations:

  • Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Computer Science Department, University of Illinois at Urbana-Champaign, Urbana, IL;Microsoft Research, Redmond, WA;Department of Statistics, University of California, Berkeley, CA;Wireless Foundations, Department of EECS, University of California, Berkeley, CA

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redundancy than simple replication for the same level of reliability. However, since fragments must be periodically replaced as nodes fail, a key question is how to generate encoded fragments in a distributed way while transferring as little data as possible across the network. For an erasure coded system, a common practice to repair from a single node failure is for a new node to reconstruct the whole encoded data object to generate just one encoded block. We show that this procedure is sub-optimal. We introduce the notion of regenerating codes, which allow a new node to communicate functions of the stored data from the surviving nodes. We show that regenerating codes can significantly reduce the repair bandwidth. Further, we show that there is a fundamental tradeoff between storage and repair bandwidth which we theoretically characterize using flow arguments on an appropriately constructed graph. By invoking constructive results in network coding, we introduce regenerating codes that can achieve any point in this optimal tradeoff.