A piggybacking design framework for read-and download-efficient distributed storage codes

KV Rashmi, NB Shah… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Erasure codes are being extensively deployed in distributed storage systems instead of
replication to achieve fault tolerance in a storage efficient manner. While traditional erasure …

A generic transformation to enable optimal repair in MDS codes for distributed storage systems

J Li, X Tang, C Tian - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
We propose a generic transformation that can convert any nonbinary (n= k+ r, k) maximum
distance separable (MDS) code into another (n, k) MDS code over the same field such that …

A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes

J Li, X Tang, C Tian - 2017 IEEE International Symposium on …, 2017 - ieeexplore.ieee.org
We propose a generic transformation on maximum distance separable (MDS) codes, which
can convert any non-binary (k+ r, k) MDS code into another (k+ r, k) MDS code with the …

Hashtag erasure codes: From theory to practice

K Kralevska, D Gligoroski, RE Jensen… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Minimum-Storage Regenerating (MSR) codes have emerged as a viable alternative to Reed-
Solomon (RS) codes as they minimize the repair bandwidth while they are still optimal in …

Bidirectional Piggybacking Design for All Nodes with Sub-Packetization 2 ≤ lr

K Wang, Z Zhang - IEEE Transactions on Communications, 2023 - ieeexplore.ieee.org
Piggybacking design has been applied extensively in distributed storage systems in recent
years, since it can reduce repair bandwidth significantly with small sub-packetization. In this …

A generic transformation to generate MDS array codes with δ-optimal access property

Y Liu, J Li, X Tang - IEEE Transactions on Communications, 2021 - ieeexplore.ieee.org
Recently, some high-rate maximum distance separable (MDS) array codes were designed
to optimally repair a single failed node by connecting all the surviving nodes. However, in …

An efficient piggybacking design with lower repair bandwidth and lower sub-packetization

Z Jiang, H Hou, YS Han, Z Huang… - … on Information Theory …, 2021 - ieeexplore.ieee.org
Piggybacking is a class of coding framework for MDS array codes that can achieve small
repair bandwidth with small sub-packetization. An (n,k,α) piggybacking code can be …

An efficient one-to-one piggybacking design for distributed storage systems

G Li, X Lin, X Tang - IEEE Transactions on Communications, 2019 - ieeexplore.ieee.org
As a kind of erasure code, piggybacking has been applied in practice since it can
significantly reduce the repair bandwidth of distributed storage systems. Currently, several …

A new piggybacking design with low-repair bandwidth and complexity

R Sun, L Zhang, J Liu - IEEE Communications Letters, 2021 - ieeexplore.ieee.org
Most of the piggybacking designs can only effectively repair systematic nodes. In this letter,
we propose a new piggybacking method for repairing parity nodes based on the existing …

A repair-efficient coding for distributed storage systems under piggybacking framework

S Yuan, Q Huang, Z Wang - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Piggybacking is an efficient framework to reduce the repair bandwidth of distributed storage
systems, especially, when the systems meet the settings-maximum distance separable …