Browse > Article
http://dx.doi.org/10.7840/kics.2015.40.9.1741

Locally Repairable Fractional Repetition Codes  

Nam, Mi-Young (School of Electrical and Electronic Engineering, Yonsei University)
Kim, Jung-Hyun (School of Electrical and Electronic Engineering, Yonsei University)
Song, Hong-Yeop (School of Electrical and Electronic Engineering, Yonsei University)
Abstract
In this paper, we introduce new locally repairable codes based on a Fractional repetition codes which is one of the MBR codes. We introduce two different constructions for different system parameters and compare these codes in terms of several performance metrics. There is some tradeoffs between the locality and other performance metrics. The newly introduced codes having the good locality should pay the price such as lower capacity or more storage nodes. And the proposed codes are more reliable than other locally repairable codes and have lower repair complexity since they can be repaired without any operations.
Keywords
Regenerating codes; MBR codes; Fractional Repetition codes; Locality; Locally repairable codes;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit construction of optimal exact regenerating codes for distributed storage," in Proc. 47th Annu. Allerton Conf. Commun., Control, Comput., pp. 1243-1249, Monticello, IL, Sept. 2009.
2 M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, "XORing elephants: Novel erasure codes for big data," in Proc. Very Large Data Base Endowment, vol. 6, no. 5, pp. 325-336, Mar. 2013.
3 J. C. Koo and J. T. Gill, "Scalable constructions of fractional repetition codes in distributed storage systems," in 49th Annu. Allerton Conf. Commun., Control, Comput., pp. 1366-1373, Monticello, IL, 2011.
4 N. Silberstein and T. Etzion, Optimal fractional repetition codes based on graphs and designs, [Online] Available: http://arxiv.org/abs/1401.4734, 2014.
5 O. Olmez and A. Ramamoorthy, Fractional repetition codes with flexible repair from combinatorial designs, [Online] Available: http://arxiv.org/pdf/1408.5780v1, 2014.
6 D. R. Stinson, Combinatorial designs: Constructions and analysis, Springer, 2004.
7 D. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," IEEE Trans. Inf. Theory, vol. 60, no. 10, pp. 5843-5855, Oct. 2014.   DOI   ScienceOn
8 W. Song, S. H. Dau, C. Yuen, and T. J. Li, "Optimal locally repairable linear codes," IEEE J-SAC, vol. 32, no. 5, pp. 1019-1036, May, 2014.
9 I. Tamo and A. Barg, "A family of optimal locally recoverable codes," IEEE Trans. Inf. Theory, vol. 60, no. 8, Aug. 2014.
10 F. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems," in Proc. IEEE INFOCOM, pp. 1215-1223, 2011.
11 F. Oggier and A. Datta, "Self-repairing codes for distributed storage-A projective geometric construction," in Proc. IEEE ITW, pp. 30-34, 2011.
12 N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff," IEEE Trans. Inf. Theory, vol. 58, no. 3, Mar. 2012.
13 A. S. Rawat, D. S. Palailiopoulos, A. G. Dimakis, and S. Vishwanath, "Locality and availability in distributed storage," in Proc. IEEE ISIT, pp. 681-685, 2014.
14 C. Huang, M. Chen, and J. Li, "Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems," ACM Trans. Storage, vol. 9, no. 1, Mar. 2013.
15 C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure coding in windows azure storage," in Proc. USENIX Annu. Tech. Conf., vol. 37, no. 5, pp. 82-96, Boston, MA, Jun. 2012.
16 M. Shahabinejad, M. Khabbazian, and M. Ardakani, "An efficient binary locally repairable codes for hadoop distributed file system," IEEE Commun. Lett., vol. 18, no. 8, pp. 1287-1290, Jul. 2014.   DOI   ScienceOn
17 J. S. Park, J.-H. Kim, K.-H. Park, and H.-Y. Song, "Average repair read cost of linear repairable code ensembles," J. KICS, vol. 39B, no. 11, Nov. 2014.
18 J.-H. Kim, M.-Y. Nam, and H.-Y. Song, "Construction of [2^k-1+k, k, 2^k-1+1] codes attaining Griesmer bound and its locality," J. KICS, vol. 40, no. 03, Mar. 2015.
19 T. Ahn, Y. Kim, and S. Lee, "Dynamic resource allocation in distributed cloud computing," J. KICS, vol. 38B, no. 7, Jul. 2013.
20 Samjong KPMG, "The future value creation through big-data analytics," Issue Monitor, no. 17, Oct. 2013.
21 J.-H. Kim, J. S. Park, K.-H. Park, M. Y. Nam, and H.-Y. Song, "Trends of regenerating codes for next-generation cloud storage systems," Inf. Commun. Mag., vol. 31, no. 2, pp. 125-131, Feb. 2014.
22 S. E. Rouayheb and K. Ramchandran "Fractional repetition codes for repair in distributed storage systems," 48th Annu. Allerton Conf. Commun., Control, Comput., pp. 1510-1517, 2010.
23 A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4536- 4551, Sept. 2010.
24 S.-J. Lin and W.-H Chung "Novel repair-by-transfer codes and systematic exact-MBR codes with lower complexities and smaller field sizes," IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 12, pp. 3232-3241, Dec. 2014.   DOI   ScienceOn
25 P. Gopalan, H. Cheng, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," IEEE Trans. Inf. Theory, vol. 58, no. 11, Nov. 2012.
26 K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction," IEEE Trnas. Inf. Theory, vol. 57, no. 8, Aug. 2011.
27 N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Regenerating codes for distributed storage networks," in Proc. Int. Conf. Arithmetic of Finite Fields, pp. 215-223, 2010.