Load-Balanced Fractional Repetition Codes

We introduce load-balanced fractional repetition (LBFR) codes, which are a strengthening of fractional repetition (FR) codes. LBFR codes have the additional property that multiple node failures can be sequentially repaired by downloading no more than one block from any other node. This allows for better use of the network, and can additionally reduce the number of disk reads necessary to repair multiple nodes. We characterize LBFR codes in terms of their adjacency graphs, and use this characterization to present explicit constructions of LBFR codes with storage capacity comparable to existing FR codes. Surprisingly, in some parameter regimes, our constructions of LBFR codes match the parameters of the best constructions of FR codes.

[1]  Felix Lazebnik,et al.  New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles , 1994, J. Comb. Theory, Ser. B.

[2]  Yi-Sheng Su,et al.  Pliable Fractional Repetition Codes for Distributed Storage Systems: Design and Analysis , 2018, IEEE Transactions on Communications.

[3]  Chi Wan Sung,et al.  Irregular Fractional Repetition Code Optimization for Heterogeneous Cloud Storage , 2014, IEEE Journal on Selected Areas in Communications.

[4]  Kenneth W. Shum,et al.  Heterogeneity-Aware Codes With Uncoded Repair for Distributed Storage Systems , 2015, IEEE Communications Letters.

[5]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Kenneth W. Shum,et al.  Cooperative Regenerating Codes , 2012, IEEE Transactions on Information Theory.

[7]  Yi-Sheng Su,et al.  Optimal Pliable Fractional Repetition Codes That are Locally Recoverable: A Bipartite Graph Approach , 2019, IEEE Transactions on Information Theory.

[8]  Aditya Ramamoorthy,et al.  Fractional Repetition Codes With Flexible Repair From Combinatorial Designs , 2014, IEEE Transactions on Information Theory.

[9]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[10]  Hua Zhang,et al.  Expander code: A scalable erasure-resilient code to keep up with data growth in distributed storage , 2013, 2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC).

[11]  Anne-Marie Kermarrec,et al.  Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes , 2011, 2011 International Symposium on Networking Coding.

[12]  Kenneth W. Shum,et al.  On low repair complexity storage codes via group divisible designs , 2014, 2014 IEEE Symposium on Computers and Communications (ISCC).

[13]  Eitan Yaakobi,et al.  Nearly optimal constructions of PIR and batch codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[14]  John T. Gill,et al.  Scalable constructions of fractional repetition codes in distributed storage systems , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Sanaa Sharafeddine,et al.  Dynamic single node failure recovery in distributed storage systems , 2017, Comput. Networks.

[16]  Kannan Ramchandran,et al.  Fractional repetition codes for repair in distributed storage systems , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Natalia Silberstein,et al.  Optimal Fractional Repetition Codes Based on Graphs and Designs , 2014, IEEE Transactions on Information Theory.

[18]  G. Exoo,et al.  Dynamic Cage Survey , 2011 .

[19]  Kenneth W. Shum,et al.  Replication-based distributed storage systems with variable repetition degrees , 2014, 2014 Twentieth National Conference on Communications (NCC).

[20]  Alexandros G. Dimakis,et al.  Batch codes through dense graphs without short cycles , 2014, 2015 IEEE International Symposium on Information Theory (ISIT).

[21]  Kannan Ramchandran,et al.  Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.

[22]  Natalia Silberstein.  Fractional Repetition and Erasure Batch Codes , 2014, ICMCTA.

[23]  Aditya Ramamoorthy,et al.  Constructions of fractional repetition codes from combinatorial designs , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[24]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

[25]  Young-Sik Kim,et al.  Construction of Fractional Repetition Codes with Variable Parameters for Distributed Storage Systems , 2016, Entropy.

[26]  P. Vijay Kumar,et al.  Codes with locality for two erasures , 2014, 2014 IEEE International Symposium on Information Theory.