计算机科学 ›› 2016, Vol. 43 ›› Issue (8): 148-153.doi: 10.11896/j.issn.1002-137X.2016.08.031
王静,罗威,欧阳明生,姜灿,王新梅
WANG Jing, LUO Wei, OUYANG Ming-sheng, JIANG Can and WANG Xin-mei
摘要： 简单再生码将可容多错的RS纠删码与简单的异或运算相结合,在达到容忍任意n－k个节点故障可靠性的基础上,可以实现对单个失效节点的高效快速修复。对简单再生码的失效节点修复过程进行改进,提出一种新的基于简单再生码的分段编码方案,将f个具有相同下标的编码块分成两段,将每段中的编码块进行异或操作,生成一个新的校验块。对该方案的存储开销、磁盘读取的开销以及修复带宽开销进行性能分析和仿真实验,结果表明提出的基于简单再生码的分段编码方案在增加少量存储开销的同时,其修复带宽和磁盘读取的开销性能有了很大程度的优化,进一步验证了改进方案的正确性和有效性。
| [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! |
|
||
首页