Product Matrix Minimum Storage Regenerating Codes with Flexible Number of Helpers

TL;DR

This paper introduces a new class of minimum storage regenerating codes for distributed storage that adaptively operate at optimal repair bandwidth with varying numbers of helper nodes, enhancing flexibility and efficiency.

Contribution

It proposes a novel class of regenerating codes that support flexible helper node counts while maintaining optimal repair bandwidth and minimum storage.

Findings

Supports a wide range of helper node configurations

Achieves optimal repair bandwidth across different helper counts

Maintains minimum storage requirements

Abstract

In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of helper nodes participating in a repair process, are predetermined. However, depending on the state of the system and network traffic, it is desirable to adapt such parameters accordingly in order to minimize the cost of repair. In this work a class of regenerating codes with minimum storage is introduced that can simultaneously operate at the optimal repair bandwidth, for a wide range of exact repair mechanisms, based on different number of helper nodes.