Storage and repair bandwidth tradeoff for distributed storage systems with clusters and separate nodes

• DOI: 10.1007/s11432-018-9499-0
• Publication Date: 2018-08-22T02:04:38Z
• Authors: Jingzhao Wang; Tinghan Wang; Yuan Luo
• Keywords: FOS: Computer and information sciences; Computer Science - Distributed, Parallel, and Cluster Computing; Computer Science - Information Theory; Information Theory (cs.IT); Distributed, Parallel, and Cluster Computing (cs.DC)

The optimal tradeoff between node storage and repair bandwidth is an important issue for distributed storage systems (DSSs). As for realistic DSSs with clusters, when repairing a failed node, it is more efficient to download more data from intra-cluster nodes than from cross-cluster nodes. Therefore, it is meaningful to differentiate the repair bandwidth from intra-cluster and cross-cluster. For cluster DSSs the tradeoff has been considered with special repair assumptions where all the alive nodes are utilized to repair a failed node. In this paper, we investigate the optimal tradeoff for cluster DSSs under more general storage/repair parameters. Furthermore, a regenerating code construction strategy achieving the points in the optimal tradeoff curve is proposed for cluster DSSs with specific parameters as a numerical example. Moreover, the influence of separate nodes for the tradeoff is also considered for DSSs with clusters and separated nodes.