New constructions of cooperative MSR codes: Reducing node size to (O(n))

11/28/2019
by   Min Ye, et al.
0

We consider the problem of multiple-node repair in distributed storage systems under the cooperative model, where the repair bandwidth includes the amount of data exchanged between any two different storage nodes. Recently, explicit constructions of MDS codes with optimal cooperative repair bandwidth for all possible parameters were given by Ye and Barg (IEEE Transactions on Information Theory, 2019). The node size (or sub-packetization) in this construction scales as (Θ(n^h)), where h is the number of failed nodes and n is the code length. In this paper, we give new explicit constructions of optimal MDS codes for all possible parameters under the cooperative model, and the node size of our new constructions only scales as (O(n)) for any number of failed nodes. Furthermore, it is known that any optimal MDS code under the cooperative model (including, in particular, our new code construction) also achieves optimal repair bandwidth under the centralized model, where the amount of data exchanged between failed nodes is not included in the repair bandwidth. We further show that the node size of our new construction is also much smaller than that of the best known MDS code constructions for the centralized model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2018

Optimal MDS codes for cooperative repair

Two widely studied models of multiple-node repair in distributed storage...
research
01/17/2022

A New Cooperative Repair Scheme with k + 1 Helper Nodes for (n, k) Hadamard MSR codes with Small Sub-packetization

Cooperative repair model is an available technology to deal with multipl...
research
01/14/2019

Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model

The paper is devoted to the problem of erasure coding in distributed sto...
research
08/08/2022

Constructing MSR codes with subpacketization 2^n/3 for k+1 helper nodes

Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 20...
research
09/15/2020

Partial MDS Codes with Regeneration

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cor...
research
10/10/2018

Scalar MSCR Codes via the Product Matrix Construction

An (n,k,d) cooperative regenerating code provides the optimal-bandwidth ...
research
05/05/2021

Cooperative Network Coding for Distributed Storage using Base Stations with Link Constraints

In this work, we consider a novel distributed data storage/caching scena...

Please sign up or login with your details

Forgot password? Click here to reset