Locally Repairable Regenerating Code Constructions
Imad Ahmad, Chih-Chun Wang
TL;DR
This paper introduces new locally repairable regenerating code constructions that enhance data protection efficiency at the minimum-bandwidth-regenerating point, based on graph analysis of the MFHS scheme.
Contribution
It provides novel LRRC constructions that achieve optimal file size protection under the MFHS scheme at the MBR point.
Findings
Achieves optimal file size protection with new LRRC constructions.
Supports the MFHS scheme at the MBR point.
Improves data repair efficiency in distributed storage systems.
Abstract
In this work, we give locally repairable regenerating code (LRRC) [1]-[3], [5], [6] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidth-regenerating (MBR) point.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Caching and Content Delivery · Cryptography and Data Security