Computer Science ›› 2016, Vol. 43 ›› Issue (8): 148-153.doi: 10.11896/j.issn.1002-137X.2016.08.031

Previous Articles     Next Articles

Segmentation Coding Scheme Based on Simple Regenerating Codes

WANG Jing, LUO Wei, OUYANG Ming-sheng, JIANG Can and WANG Xin-mei   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Combining RS erasure codes with simple XOR operation,simple regenerating codes can realize single failed node repair on the basis of tolerating any n-k node failure.In this paper,based on the repair process of simple regenera-ting codes,we proposed a new segmentation coding scheme.Concretely,we divided the f coded blocks with the same index into two sections,and then XOR operation was used on the coded blocks of each section to generate a new parity block.Performance analysis and simulation results show that,at a little expense of storage overhead,the proposed segmentation coding scheme based on simple regeneration code can optimize the repair bandwidth and disk I/O overhead,which proves the correctness and effectiveness of this scheme.

Key words: Distributed storage,Simple regenerating codes,Node repairing,Segmentation code

[1] Wang Yu.Research on data redundancy and maintenance techno-logy in distributed storage system [D].Guangzhou:South China University of Technology,2011(in Chinese) 王禹.分布式存储系统中的数据冗余与维护技术研究[D].广州:华南理工大学,2011
[2] Zhao Hao-tian.Study on fault-tolerant and scaling problems of distributed storage systems based on network coding [D].Hefei:University of Science and Technology of China,2013(in Chinese) 赵浩天.基于网络编码的分布式存储容错及扩容问题研究[D].合肥:中国科学技术大学,2013
[3] Zeng T,Liu Lei,Zhao J,et al.Router-supported data regeneration protocols in distributed storage systems[C]∥Proceeding of 2011 Third International Conference on Ubiquitous and Future Networks (ICUFN).Dalian,2011:315-320
[4] Weatherspoon H,Kubiatowicz J.Erasure coding vs.replication:a quantitative comparison[C]∥Proceeding of the First International Workshop on Peer-to-Peer Systems.2002:328-338
[5] Clarke I,Miller S G,Hong T W,et al.Protecting free expression online with Freenet[J].IEEE Internet Computing,2002,6(1):40-49
[6] Patterson D A,Gibson G,Katz R H.A case for redundant arrays of inexpensive disks (RAID)[C]∥ Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data.1988:109-116
[7] Kubiatowicz J,Bindel D,Chen Y,et al.OceanStore:an architecture for global-scale persistent store[C]∥Proceedings of the ninth International Conference on Architectural Support for Programming Languages and Operating Systems.2000:190-201
[8] Bhagwan R,Tati K,Cheng Y,et al.Total recall:system support for automated availability management[C]∥Proceedings of the 1stConference on Networked Systems Design and Implementation.2004:25-28
[9] Dimakis A G,Godfrey P B,Wu Y,et al.Network coding for distributed storage systems[J].IEEE Transactions on Information Theory,2010,56(9):4539-4551
[10] Oggier F,Datta A.Self-repairing homomorphic codes for distri-buted storage systems[C]∥Proceeding of 2011 IEEE INFOCOM.Shanghai,2011:1215-1223
[11] Gopalan P,Huang C,Simitci H,et al.On the locality of codeword symbols[J].IEEE Transactions on Information Theory,2012,58(11):6925-6934
[12] Papailiopoulos D S,Dimakis A G.Locally repairable codes[C]∥Proceeding of 2012 IEEE International Symposium on Information Theory Proceedings (ISIT).Cambridge,MA,2012:2771-2775
[13] Khan O,Burns R,Plank J,et al.In search of I/O-optimal reco-very from disk failures[C]∥Proceeding of 3rd Workshop on Hot Topics in Storage and File Systems (HotStorage).USENIX,2011
[14] Rawat A S,Vishwanath S.On locality in distributed storage systems[C]∥Proceeding of 2012 IEEE Information Theory Workshop (ITW).Lausanne,2012:497-501
[15] Papailiopoulos D S,Luo J,Dimakis A G,et al.Simple regenerating codes:network coding for cloud storage[C]∥Proceeding of 2012 IEEE INFOCOM.Orlando,FL,2012:2801-2805
[16] Rawat A S,Silberstein N,Koyluoglu O O,et al.Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes[C]∥Proceeding of 2013 Information Theory and Applications Workshop(ITA).San Diego,CA,2013:1-8
[17] Silberstein N,Rawat A S,Koyluoglu O O,et al.Optimal locally repairable codes via rank-metric codes[C]∥Proceeding of 2013 IEEE International Symposium on Information Theory (ISIT).Istanbul,2013:1819-1823
[18] Goparaju S,Calderbank R.Binary cyclic codes that are locally repairable[C]∥Proceeding of 2014 IEEE International Symposium on Information Theory (ISIT).Honolulu,HI,2014:676-680
[19] Xie Hong-mei,Yan Zhi-yuan.Two-layer locally repairable codes for distributed storage systems[C]∥Proceeding of 2014 IEEE International Conference on Communications (ICC).Sydney,NSW,2014:3902-3907

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .