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

谢显中; 黄倩; 王柳苏

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

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-05

- “双码”架构下的云存储多节点修复协作编码
- Collaboration coding to multi-node repair program under the twin-MDS codes framework in cloud storage systems
- 通信学报 2015年36卷第Z1期页码：1-8
- 作者机构：
  
  1. 重庆邮电大学宽带接入网络研究所，重庆 400065
  2. 重庆邮电大学移通学院计算机科学系，重庆 401520
- 作者简介：
  
  [ "谢显中（1966-），男，四川通江人，博士，重庆邮电大学教授，主要研究方向为无线和移动通信技术。" ]
  [ "黄倩（1988-），女，重庆人，硕士，重庆邮电大学移通学院讲师，主要研究方向为云存储、个人通信。" ]
  [ "王柳苏（1990-），女，重庆人，重庆邮电大学硕士生，主要研究方向为云存储、个人通信。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61271259);国家自然科学基金资助项目(0872037);重庆市自然科学基金资助项目(CTSC2011jjA40006);重庆市自然科学基金资助项目(CSTC2010BB2415);重庆市教委科学技术研究基金资助项目(KJ120501);重庆市教委科学技术研究基金资助项目(KJ110530)
- DOI：10.11959/j.issn.1000-436x.2015275
  中图分类号： TP302
- 网络出版日期：2015-11，
  
  纸质出版日期：2015-11-25
- 稿件说明：
移动端阅览
谢显中, 黄倩, 王柳苏. “双码”架构下的云存储多节点修复协作编码[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.
谢显中, 黄倩, 王柳苏. “双码”架构下的云存储多节点修复协作编码[J]. 通信学报, 2015,36(Z1):1-8. DOI： 10.11959/j.issn.1000-436x.2015275.

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. DOI： 10.11959/j.issn.1000-436x.2015275.

摘要

针对云存储中现有多节点失效修复模型的不足，给出了一种可以对多个系统节点或冗余节点同时修复的多节点协作的精确修复码，证明了其存在性，并且将此修复码与具有健康节点协作的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.

关键词

Keywords

references

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 .

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 .

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 .

SUH C , RAMCHANDRAN K . Exact-repair MDS code construction using interference alignment [J ] . IEEE Transactions on Information Theory , 2011 , 57 ( 3 ): 1425 - 1442 .

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 .

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 .

谢显中 , 黄倩 , 王柳苏 , 等 . 一种云存储中基于干扰对齐的多节点精确修复方法 [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 .

LE S N . Exact scalar minimum storage coordinated regenerating codes [A ] . IEEE International Symposium on Information Theory Proceedings (ISIT) [C ] . 2012 . 1197 - 1201 .

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 .

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 .

SHUM K W , HU Y . Cooperative regenerating codes [J ] . IEEE Transactions on Information Theory , 2013 , 59 ( 11 ): 7229 - 7258 .

谢显中 , 王柳苏 , 黄倩 , 等 . 具有健康节点协作的高效多节点修复方案 [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 .

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 .

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 .

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 .

浏览量

799

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

面向连接关键词可搜索加密的查询恢复攻击

面向云存储的属性基双边访问控制方案

基于区块链且可验证的智能电网多维数据聚合与分享方案

基于分层结构的匹配量隐藏加密多重映射方案

无第三方服务器的基于数据流行度的加密去重方案