“双码”架构下的云存储多节点修复协作编码

doi:10.11959/j.issn.1000-436x.2015275

通信学报 ›› 2015, Vol. 36 ›› Issue (Z1): 1-8.doi: 10.11959/j.issn.1000-436x.2015275

• 学术论文 • 下一篇

“双码”架构下的云存储多节点修复协作编码

谢显中¹,黄倩^1,²,王柳苏¹

¹ 重庆邮电大学宽带接入网络研究所，重庆 400065
² 重庆邮电大学移通学院计算机科学系，重庆 401520

出版日期:2015-11-25 发布日期:2015-12-29
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;重庆市自然科学基金资助项目;重庆市自然科学基金资助项目;重庆市教委科学技术研究基金资助项目;重庆市教委科学技术研究基金资助项目

Collaboration coding to multi-node repair program under the twin-MDS codes framework in cloud storage systems

Xian-zhong XIE¹,Qian HUANG^1,²,Liu-su WANG¹

¹ Institute of Broadband Access Technologies,Chongqing University of Posts and Telecommunications,Chongqing 400065,China
² Department of Computer Science,College Mobile Telecommunications,Chongqing University of Posts and Telecommunications,Chongqing 401520,China

Online:2015-11-25 Published:2015-12-29
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Natural Science Foundation of Chongqing;The Natural Science Foundation of Chongqing;The Scientific and Technological Research Program of Chongqing Municipal Education Commission;The Scientific and Technological Research Program of Chongqing Municipal Education Commission

摘要/Abstract

摘要：

针对云存储中现有多节点失效修复模型的不足，给出了一种可以对多个系统节点或冗余节点同时修复的多节点协作的精确修复码，证明了其存在性，并且将此修复码与具有健康节点协作的MDS双码架构模型相结合，以达到对多节点修复的同时，降低修复带宽、修复链路数和单个中间节点需要处理的数据量。通过数值仿真结果表明，本模型与修复方案在以上3个方面具有较大改进，尤其削弱了修复时中间节点的负荷，且随着云存储中节点数量的增多，本方案的优势更加明显。

关键词: 云存储, 多节点协作精确修复码, 协作修复, 双极大距离可分码模型

Abstract:

A multi-node exact repair code scheme,which can repair multiple system nodes or redundant nodes simultaneously,was shown and proved to against the disadvantages of the existing multi-node repair model in cloud storage.The multi-node exact repair code was combined with a twin-MDS codes framework with health cooperative nodes.In this way,repair bandwidth,the number of repair links and the amount of data to be treated in an intermediate node were reduced,while multi-node were repaired.Finally,numerical simulation results show that this scheme has greater improvements.In particular,it reduces the load in an intermediate node.And the advantages was more obvious with the more storage nodes in cloud storage.

Key words: cloud storage, multi-node exact repair code, collaboration repair, twin-MDS codes model

谢显中,黄倩,王柳苏. “双码”架构下的云存储多节点修复协作编码[J]. 通信学报, 2015, 36(Z1): 1-8.

Xian-zhong XIE,Qian HUANG,Liu-su WANG. Collaboration coding to multi-node repair program under the twin-MDS codes framework in cloud storage systems[J]. Journal on Communications, 2015, 36(Z1): 1-8.

图/表 8

图1

图2

图3

图4

图5

表1

修复带宽比较"

(n,k,d)(α,B)	原始修复	依次修复	联合修复	健康节点协作修复	本文修复模型
(4,2,2) (2,4)	$\bar{γ}$ =4	$\bar{γ}$ =3	$\bar{γ}$ =3	$\bar{γ}$ =3	$\bar{γ}$ =3
(7,4,4)(21,84)	$\bar{γ}$ =84	$\bar{γ}$ =51.3	$\bar{γ}$ =42	$\bar{γ}$ =42	$\bar{γ}$ =35
(14,8,8)(80,640)	$\bar{γ}$ =640	$\bar{γ}$ =261.3	$\bar{γ}$ =173.3	$\bar{γ}$ =173.3	$\bar{γ}$ =160

表1

表2

表3

参考文献 15

[1]	DIMAKIS A G , GODFREY P B , WAINWRIGHT M J , et al. Network coding for distributed storage systems[A]. IEEE International Conference on Computer Communications (INFOCOM)[C]. 2007. 2000-2008.
[2]	DIMAKIS A G , RAMCHANDRAN K , WU Y , et al. A survey on network codes for distributed storage[J]. Proceedings of the IEEE, 2011,99(3): 476-489.
[3]	RASHMI K V , SHAH N B , KUMAR P V . 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.
[4]	SUH C , RAMCHANDRAN K . Exact-repair MDS code construction using interference alignment[J]. IEEE Transactions on Information Theory, 2011,57(3): 1425-1442.
[5]	HU Y , XU Y , WANG X , et al. Cooperative recovery of distributed storage systems from multiple losses with network coding[J]. IEEE Journal on Selected Areas in Communications, 2010,28(2): 268-275.
[6]	WANG X , XU Y , HU Y , et al. MFR:multi-loss flexible recovery in distributed storage systems[A]. IEEE International Conference on Communications (ICC)[C]. 2010. 1-5.
[7]	谢显中, 黄倩, 王柳苏 , 等. 一种云存储中基于干扰对齐的多节点精确修复方法[J]. 电子学报， 2014,42(10): 1873-1881. XIE X Z , HUANG Q , WANG L S , et al. A multi-node exact repair method in cloud storage based on interference alignment[J], Acta Electronica Sinica, 2014,42(10):1873-1881.
[8]	LE S N . Exact scalar minimum storage coordinated regenerating codes[A]. IEEE International Symposium on Information Theory Proceedings (ISIT)[C]. 2012. 1197-1201.
[9]	WANG A , ZHANG Z . Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage[A]. IEEE International Conference on Computer Communications (INFOCOM)[C]. 2013. 400-404.
[10]	LI J , LI B . Cooperative repair with minimum-storage regenerating codes for distributed storage[A]. IEEE International Conference on Computer Communications (INFOCOM)[C]. 2014. 316-324.
[11]	SHUM K W , HU Y . Cooperative regenerating codes[J]. IEEE Transactions on Information Theory, 2013,59(11): 7229-7258.
[12]	谢显中, 王柳苏, 黄倩 , 等. 具有健康节点协作的高效多节点修复方案[J]. 北京邮电大学学报. 2014,37(1): 52-56. XIE X Z , WANG L S , HUANG Q , et al. Efficient multi-node regenerating program with healthy nodes collaboration in distributed storage systems[J]. Journal of Beijing University of Posts and Telecommunications, 2014,37(1): 52-56.
[13]	RASHMI K V , SHAH N B , KUMAR P V . Enabling node repair in any erasure code for distributed storage[A]. IEEE International Symposium on Information Theory(ISIT)[C]. Saint Petersburg,Russia, 2011. 1235-1239.
[14]	LI X , ZHENG Q , QIAN H , et al. Toward optimizing cauchy matrix for cauchy reed-solomon code[J]. IEEE Communications Letters, 2009,13(8): 603-605.
[15]	WU Y , DIMAKIS A G . Reducing repair traffic for erasure coding-based storage via interference alignment[A]. IEEE International Symposium on Information Theory Proceedings (ISIT)[C]. Seoul, 2009. 2276-2280.

(n,k,d)(α,B)	联合修复	健康节点协作修复	本文修复模型
(4,2,2)(2,4)	f=6	f=3	f=3
(7,4,4)(21,84)	f=18	f=6	f=5
(14,8,8)(80,640)	f=78	f=13	f=12

“双码”架构下的云存储多节点修复协作编码

Collaboration coding to multi-node repair program under the twin-MDS codes framework in cloud storage systems

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 8

参考文献 15

相关文章 15

Metrics

推荐阅读 0

[1]	哈冠雄, 贾巧雯, 陈杭, 贾春福. 无第三方服务器的基于数据流行度的加密去重方案[J]. 通信学报, 2022, 43(8): 17-29.
[2]	冯涛, 孔繁琪, 柳春岩, 马蓉, Maher Albettar. 基于区块链的双重可验证云存储方案[J]. 通信学报, 2021, 42(12): 192-201.
[3]	贾春福, 哈冠雄, 武少强, 陈杭, 李瑞琪. 加密去重场景下基于AONT和NTRU的密钥更新方案[J]. 通信学报, 2021, 42(10): 67-80.
[4]	田俊峰,王彦骉,何欣枫,张俊涛,杨万贺,庞亚南. 数据因果一致性研究综述[J]. 通信学报, 2020, 41(3): 154-167.
[5]	柯文龙,王勇,叶苗,陈俊奇. Ceph云存储网络中一种业务优先级区分的多播流调度方法[J]. 通信学报, 2020, 41(11): 40-51.
[6]	孙磊,赵志远,王建华,朱智强. 云存储环境下支持属性撤销的属性基加密方案[J]. 通信学报, 2019, 40(5): 47-56.
[7]	张襄松,李晨,刘振华. 抗密钥泄露的支持密态数据去重的完整性审计方案[J]. 通信学报, 2019, 40(4): 95-106.
[8]	田苗苗,高闯,陈洁. 格上基于身份的云存储完整性检测方案[J]. 通信学报, 2019, 40(4): 128-139.
[9]	田俊峰,柴梦佳,齐鎏岭. 基于公有验证和私有验证的数据持有性验证方案[J]. 通信学报, 2019, 40(3): 48-59.
[10]	杜瑞忠,石朋亮,何欣枫. 基于覆写验证的云数据确定性删除方案[J]. 通信学报, 2019, 40(1): 130-140.
[11]	严新成,陈越,贾洪勇,陈彦如,张馨月. 支持高效密文密钥同步演化的安全数据共享方案[J]. 通信学报, 2018, 39(5): 123-133.
[12]	陈越,王龙江,严新成,张馨月. 基于再生码的拟态数据存储方案[J]. 通信学报, 2018, 39(4): 21-34.
[13]	王少辉,潘笑笑,王志伟,肖甫,王汝传. 对基于身份云数据完整性验证方案的分析与改进[J]. 通信学报, 2018, 39(11): 98-105.
[14]	王斌,李伟民,盛津芳,肖斯诺. TCCL：安全高效的拓展云桌面架构[J]. 通信学报, 2017, 38(Z1): 9-18.
[15]	宋衍,韩臻,李建军,韩磊. 支持安全共享的云存储系统研究[J]. 通信学报, 2017, 38(Z1): 88-96.