Storage and Repair Bandwidth Tradeoff for Distributed Storage Systems with Clusters and Separate Nodes
Authors:
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage SystemsIEEE Transactions on Information Theory, 2018
- Repair Tree: Fast Repair for Single Failure in Erasure-Coded Distributed Storage SystemsIEEE Transactions on Parallel and Distributed Systems, 2017
- Beehive: Erasure Codes for Fixing Multiple Failures in Distributed Storage SystemsIEEE Transactions on Parallel and Distributed Systems, 2016
- Tradeoff between storage cost and repair cost in heterogeneous distributed storage systemsTransactions on Emerging Telecommunications Technologies, 2014
- Capacity and Security of Heterogeneous Distributed Storage SystemsIEEE Journal on Selected Areas in Communications, 2013
- A Survey on Network Codes for Distributed StorageProceedings of the IEEE, 2011
- Cost-bandwidth tradeoff in distributed storage systemsComputer Communications, 2010
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Linear network codingIEEE Transactions on Information Theory, 2003
- Network information flowIEEE Transactions on Information Theory, 2000