2017/02/04 by Shuai Yuan, Qin Huang, Yuan, Shuai +3
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1702.01241
arxiv created 2017/02/04 · openalex publication_date 2017/02/04 · arxiv updated 2017/02/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper generalizes the piggybacking constructions for distributed storage systems by considering various protected instances and piggybacked instances. Analysis demonstrates that the proportion of protected instances determines the average repair bandwidth for a systematic node. By optimizing the proportion of protected instances, the repair ratio of generalized piggybacking codes approaches zero instead of 50% as the number of parity check nodes tends to infinity. Furthermore, the computational complexity for repairing a single systematic node cost by generalized piggybacking codes is less than that of the existing piggybacking designs.