Abstract-When there are multiple node failures in a distributed storage system, regenerating the failed storage nodes individually in a one-by-one manner is suboptimal as far as repair-bandwidth minimization is concerned. If data exchange among the newcomers is enabled, we can get a better tradeoff between repair bandwidth and the storage per node. An explicit and optimal construction of cooperative regenerating code is illustrated.
REF proved that by allowing data exchange among the replacement nodes, a better tradeoff between repair bandwidth γ and per node storage α can be achieved.
Cooperative Regenerating Codes for Distributed Storage Systems
2011 IEEE International Conference on Communications (ICC)
2011 IEEE International Conference on Communications (ICC)
Computer Science Mathematics