Storage

Tree-Structured Data Regeneration in Distributed Storage Systems With Regenerating Codes

Download Now Free registration required

Executive Summary

Distributed storage systems provide large-scale reliable data storage by storing a certain degree of redundancy in a decentralized fashion on a group of storage nodes. To recover from data losses due to the instability of these nodes, whenever a node leaves the system, additional redundancy should be regenerated to compensate such losses. In this paper, the general objective is to minimize the volume of actual network traffic caused by such regenerations. A class of codes, called regenerating codes, has been proposed to achieve an optimal tradeoff curve between the amount of storage space required for storing redundancy and the network traffic during the regeneration. In this paper, the authors jointly consider the choices of regenerating codes and network topologies.

  • Format: PDF
  • Size: 224.9 KB