.png){kind=icon}
.png){kind=icon}
Return
Distributed Storage Codes Based on Double- Layered Piggybacking Framework
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3002824.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Piggybacking codes are a class of distributed storage codes adopted in distributed storage systems, which received much attention in recent years. Two novel piggybacking constructions based on the double-layered piggybacking framework are proposed. They can reduce the repair bandwidth of both the systematic nodes and the parity nodes efficiently. The average repair bandwidth ratio for the two constructions approaches to zero asymptotically as the number of systematic nodes and parity nodes tends to infinity. Compared with other piggybacking codes, the two proposed double-layered piggybacking codes, especially the second one, not only require less design constraints, but also obtain the optimal comprehensive repair efficiency, which further save the amount of data read and downloaded.
Keywords:
Maintenance engineering
Bandwidth
Systematics
Fault tolerance
Fault tolerant systems
Complexity theory
Distributed storage
piggybacking codes
MDS
repair bandwidth ratio
edge computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.