全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

基于循环矢量构造的精确修复MDS编码

DOI: 10.13190/jbupt.201206.34.wangyb, PP. 34-37

Keywords: 循环矢量,精确修复,最大距离可分码,分布式存储分布式存储

Full-Text   Cite this paper   Add to My Lib

Abstract:

为解决分布式存储系统节点精确修复的问题,构造了一类最小存储再生编码,该编码属于最大距离可分(MDS)删除码.利用循环矢量构造生成矩阵,将冗余数据与系统数据混合存储,编码过程中所有的运算都属于伽罗华2域.采用该编码的存储系统,在发生单节点故障时,精确修复的最小带宽为理论最小值,在系统正常工作时,能为单用户提供最大理论值的可用带宽.与最小存储再生码和最小带宽再生码相比,编码矩阵简单,解码计算量较小,能提供较高的可用带宽.

References

[1]  Ahlswede R, Cai Ning. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1206.
[2]  Dimakis A, Godfrey P, Wu Yunnan. Network coding for distributed storage systems [J]. IEEE Transactions on Information Theory, 2010, 56(9): 4539-4551.
[3]  Cadambe V, Jafar S, Maleki H. Minimum repair bandwidth for exact regeneration in distributed storage //2010 3rd IEEE International Workshop on Wireless Network Coding. Boston: IEEE, 2010: 1-6.
[4]  Rashmi K, Shah N, Kumar P. Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage//2010 IEEE International Symposium on Information Theory Proceedings. Austin: IEEE, 2010: 1938-1942.
[5]  Changho S, Ramchandran K. Exact-repair MDS code construction using interference alignment[J]. IEEE Transactions on Information Theory, 2011, 57(3): 1425-1442.
[6]  Wu Yunnan. A construction of systematic MDS codes with minimum repair bandwidth[J]. IEEE Transactions on Information Theory, 2011, 57(6): 3738-3741.
[7]  Rashmi K, Shah N, Kumar P. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction [J]. IEEE Transactions on Information Theory, 2011, 57(8): 5227-5239.
[8]  Gharaibeh A, Al S, Ripeanu M. Thriftstore: finessing reliability trade-offs in replicated storage systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2011, 22(6): 910-923.
[9]  Mitra J. Reliability-based sizing of backup storage[J]. IEEE Transactions on Power Systems, 2010, 25(2): 1198-1199.
[10]  Shah N, Rashmi K, Vijay K. Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff [J]. IEEE Transactions on Information Theory, 2012, 58(3): 1837-1852.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133