Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes

Abstract—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 context, 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, we jointly consider the choices of regenerating codes and network topologies. We propose a new design, referred to as RCTREE, that combines the advantage of regenerating codes with a tree-structured regeneration topology. Our focus is the efficient utilization of network links, in addition t...

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Jun Li, Shuang Yang, Xin Wang, Baochun Li
• Keywords: Communications, INFOCOM 2010, Network Traffic, Storage Nodes, Tree-structured Regeneration Topology