全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2014 

一种云存储中基于干扰对齐的多节点精确修复方法

DOI: 10.3969/j.issn.0372-2112.2014.10.001, PP. 1873-1881

Keywords: 云存储,多节点修复,干扰对齐,再生码,柯西矩阵

Full-Text   Cite this paper   Add to My Lib

Abstract:

本文提出了一种基于干扰对齐的满足MDS性质的多节点精确修复码(MMSR).首先利用柯西矩阵构造MMSR码的生成矩阵,使其适用干扰对齐技术,并同时修复多个节点.然后讨论了MMSR码同步修复和异步修复方案的优缺点.最后证明了MMSR码的MDS性质,并通过一个(7,3,5)-MMSR码的数据重建方案验证了MMSR码的MDS性质和可行性.

References

[1]  吴吉义,傅建庆,平玲娣,谢琪.一种对等结构的云存储系统研究[J].电子学报,2011,39(5):1100-1107. WU Ji-yi,Fu Jian-qing,PING Ling-di,XIE Qi.Study on the P2P cloud storage system[J].Acta Electronica Sinica,2011,39(5):1100-1107.(in Chinese)
[2]  李建敦,彭俊杰,张武.云存储中一种基于布局的虚拟磁盘节能调度方法[J].电子学报,2012,40(11):2247-2254. LI Jian-dun,PENG Jun-jie,ZHANG Wu.A layout-based energy-aware approach for virtual disk scheduling in cloud storage[J].Acta Electronica Sinica,2012,40(11):2247-2254.(in Chinese)
[3]  王丽娜,等.一种适于云存储的数据确定性删除方法[J].电子学报,2012,40(2):266-272. WANG Li-na,et al.A data assured deletion approach adapted for cloud storage[J].Acta Electronica Sinica,2012,40(2):266-272.(in Chinese)
[4]  Papailiopoulos D S,Dimakis A G,Cadambe V R.Repair optimal erasure codes through hadamard designs[J].IEEE Transactions on Information Theory,2013,59(5):3021-3037.
[5]  C Suh,d K Ramchandran.Exact-repair MDS code construction using interference alignment[J].IEEE Transactions on Information Theory,2011,57(3):1425-1442.
[6]  Shah N B,Rashmi K V,Kumar P V,et al.Interference alignment in regenerating codes for distributed storage:Necessity and code constructions[J].IEEE Transactions on Information Theory,2012,58(4):2134-2158.
[7]  Shum K W.Cooperative regenerating codes for distributed storage systems[A].IEEE International Conference on (ICC)[C].USA:IEEE,2011.1-5.
[8]  Shum K W,Hu Y.Exact minimum repair bandwidth cooperative regenerating codes for distributed storage systems[A].IEEE International Symposium on Information Theory Proceedings (ISIT)[C].USA:IEEE,2011.1442-1446.
[9]  Kermarrec A M,Le Scouarnec N,Straub G.Repairing multiple failures with coordinated and adaptive regenerating codes[A].IEEE International Symposium on Network Coding (NetCod)[C].USA:IEEE,2011.1-6.
[10]  Kenneth W Shum.Cooperative regenerating codes for distributed storage systems[A].IEEE International Conference on Communications (ICC)[C].Tokyo,Japan:IEEE,2011.1-5.
[11]  Le Scouarnec N.Exact scalar minimum storage coordinated regenerating codes[A].Proceedings of IEEE International Symposium on Information Theory (ISIT)[C].USA:IEEE,2012.1197-1201.
[12]  Wu Y,Dimakis A G,Ramchandran K.Deterministic regenerating codes for distributed storage[A].The 45th Annual Allerton Conference on Control,Computing,and Communication (Allerton)[C].Monticello IL:IEEE,2007.1-8.
[13]  Bloemer J,Kalfane M,Karp R,et al.An XOR-Based Erasure-Resilient Coding Scheme[R].CA USA:ICSI Technical,(Report No.TR-95-048),1995.
[14]  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.
[15]  R W Yeung.Information Theory and Network Coding[M].New York:Springer,2008.
[16]  Dougherty R,Freiling C,Zeger K.Insufficiency of linear coding in network information flow[J].IEEE Transactions on Information Theory,2005,51(8):2745-2759.
[17]  Wu Y,Dimakis A G.Reducing repair traffic for erasure coding-based storage via interference alignment[A].IEEE International Symposium on Information Theory (ISIT)[C].Seoul:IEEE,2009.2276-2280.
[18]  A Ramakrishnan,A Das,H Maleki,A Markopoulu,S A Jafar.Network coding for three unicast sessions:interference alignment approaches[A].The 48th Annual Allerton Conference on Communication,Control and Computing (Allerton)[C].Allerton,IL:IEEE,2010.1054-1061.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133