Piggybacking is an efficient method to decrease the repair bandwidth of maximum distance separable codes. In this paper, in order to reduce the repair bandwidth of parity nodes of the known minimum storage regenerating (MSR) codes with high rate, which is usually the whole amount of the original data, i.e., the maximal, a new systematic piggybacking design is proposed through an in-depth analysis of the design of piggybacking. As a result, new MSR codes are obtained with almost optimal repair bandwidth of parity nodes while retaining the optimal repair bandwidth of systematic nodes. Furthermore, MSR codes with balanced download during node repair process are presented based on the new piggybacking design.
The limitation of the new piggyback design is that α is equal to r and r k. Yang et al. REF applied piggybacking to optimize the repair of parity nodes while retaining the optimal repair bandwidth for systematic nodes.
A Systematic Piggybacking Design for Minimum Storage Regenerating Codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Mathematics Computer Science