Fractional repetition (FR) codes are a family of repair-efficient storage codes that provide exact and uncoded node repair at the minimum bandwidth regenerating point. The advantageous repair properties are achieved by a tailor-made two-layer encoding scheme which concatenates an outer maximum-distance-separable (MDS) code and an inner repetition code. In this study, the authors generalise the application of FR codes and propose heterogeneous fractional repetition (HFR) code, which is adaptable to the scenario where the repetition degrees of coded packets are different. The authors provide explicit code constructions by utilising group divisible designs, which allow the design of HFR codes over a large range of parameters. The constructed codes achieve the system storage capacity under random access repair and have multiple repair alternatives for node failures. Further, the authors take advantage of the systematic feature of MDS codes and present a novel design framework of HFR codes, in which storage nodes can be wisely partitioned into clusters such that data reconstruction time can be reduced when contacting nodes in the same cluster.
CITATION STYLE
Zhu, B., Li, H., Shum, K. W., & Li, S. Y. R. (2015). HFR code: A flexible replication scheme for cloud storage systems. IET Communications, 9(17), 2095–2100. https://doi.org/10.1049/iet-com.2014.1225
Mendeley helps you to discover research relevant for your work.