2022/05/19 by Ke Wang, Zhifang Zhang, Wang, Ke +1
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2205.09659
openalex publication_date 2022/05/19 · openalex created_date 2022/05/23 · openalex updated_date 2026/07/28
Piggybacking design has been widely applied in distributed storage systems since it can greatly reduce the repair bandwidth with small sub-packetization. Compared with other existing erasure codes, piggybacking is more convenient to operate and the I/O cost is lower. In this paper, we propose a new efficient design which can further reduce the repair bandwidth with the sub-packetization l≤ r where r = n-k. Generally, we let l≤ 8. Compared with other analogous designs, our design has lower l and the value of l is more flexible. Moreover, our design can repair all nodes with small repair bandwidth. Therefore our piggybacking design is more feasible.