A New Piggybacking Design With Low-Repair Bandwidth and Complexity

摘要

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 piggybacking design. By elaborately designing piggyback functions and making full use of each parity node, the improved piggybacking design reduces the repair bandwidth of parity nodes while retaining the repair bandwidth of systematic nodes. Compared with the existing designs, the proposed method has lower complexity, fewer substripes and better comprehensive repair properties in large-scale distributed storage systems.