期刊文献+

信息知识库中的数据可用性恢复策略 被引量:2

Data availability recovery strategy in information knowledge base
下载PDF
导出
摘要 信息知识库在工业生产中能够提高生产效率、降低资源消耗,但数据失效频率高。针对多节点失效重构的纠删码策略较少,且未充分考虑失效数据重构时各参与节点间的链路关系,导致重构效率较低。针对信息知识库数据失效,提出一种新的重构策略。根据节点的数据处理能力,选取数据处理能力最高的新生节点为路由节点;依据路由节点与候选供应节点及剩余空闲节点的链路带宽,确定供应节点及新生节点,从而构建数据重构网络拓扑,提高失效数据重构效率。实验结果证实,与传统纠删码策略性能比较,该方法有较短的重构时间和较高的重构成功率。 The information knowledge base can improve production efficiency and reduce resource consumption in industrial production,but it frequently meets with data failure.Furthermore,erasure coding strategies for multi-node failure reconstruction are limited,and the link relationship between participating nodes during the reconstruction of failed data has not been fully considered,resulting in low reconstruction efficiency.Aiming at the data failure of the information knowledge base,a multi-node failure reconstruction method was proposed.According to the data processing capacity of the node,the new node with the highest data processing capacity was selected as the routing node;then according to the link bandwidth of the routing node,the candidate supply node and the remaining idle nodes,the supply node and the new node were determined,thereby constructing the data reconstruction network topology and improving the efficiency of reconstruct failed data.Experimental results show that this method has shorter reconstruction time and higher reconstruction success rate when compared with traditional erasure code reconstruction methods.
作者 徐鹏 孟宇龙 朱群 侍守创 龚玉婷 XU Peng;MENG Yulong;ZHU Qun;SHI Shouchuang;GONG Yuting(Jiangsu JARI Technology Group Co.Ltd., The 716th Research Institute of CSIC, Lianyungang 222002, China;College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China)
出处 《国防科技大学学报》 EI CAS CSCD 北大核心 2021年第6期102-107,134,共7页 Journal of National University of Defense Technology
基金 科技部智能工厂与网络协同制造专项资助项目(2020YFB1712600) 工信部高技术船舶资助项目(MC-201720-Z02) 工信部船舶总装建造智能化专项资助项目(CJ04N20)。
关键词 信息知识库 纠删码 多节点失效 数据处理 链路带宽 information knowledge base erasure code multi-node failure data processing link bandwidth
  • 相关文献

参考文献5

二级参考文献31

  • 1许方亮,王意洁,裴晓强.NTar:基于网络拓扑的纠删码树型修复方法[J].计算机研究与发展,2013,50(S2):37-44. 被引量:3
  • 2赵东,孔慧敏.基于知识工程的船体结构参数化设计[J].造船技术,2005,33(1):5-7. 被引量:4
  • 3曹计昌,周宇杰.基于高地址约束和按需存储分配的UCard底层调度模块研究[J].计算机工程与科学,2007,29(6):121-123. 被引量:2
  • 4Schmuck F,Haskin R.A Shared-disk File System for Large Computing Clusters[C]//Proc.of Conference on File and Storage Technologies.Monterey,CA,USA:[s.n.],2002.
  • 5Burns R.Data Management in a Distributed File System for Storage Area Networks[D].Santa Cruz,California,USA:Department of Computer Science,University of California,2000.
  • 6WEATHERSPOON H, KUBIATOWICZ J. Erasure Coding vs. Replication: A Quantitative Comparison[C]// Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02): March 7-8, 2002. Cambridge, MA, USA. 2002: 328-337.
  • 7RODRIGUES R, LISKOV B. High Availability in DHTs: Erasure Coding vs. Replication[C]// Proceedings of 4th International Workshop on Peer-to-Peer Systems (IPTPS'05): February 24- 25, 2005. Ithaca, NY, USA. Springer, 2005: 226- 239.
  • 8WU Yunnan, DIMAKISY A, RAMCHANDRANY K. Deterministic Regenerating Codes for Distributed Storage[C]// Proceedings of Allerton Conference on Communication, Control and Computing: September 26-28, 2007. Monti- cello, Illinois, USA. Springer, 2007: 2l5-223.
  • 9ACEDANSKI S, DEB S, MEDARD M, et al. How Good is Random Linear Coding Based Distributed Networked Storage[C]// Proceedings of Workshop on Network Coding, Theory and Applications: April 7, 200S. Riva del Garda, Italy. 2005: 1-6.
  • 10LI Jun, YANG Shuang, WANG Xin, et al. TreeStructured Data Regeneration in Distributed Storage Systems with Regenerating Codes[C]// Proceedings of International Conference on Computer Communications (INFOCOM) 2010: March IS-19, 2010. San Diego, California, USA. IEEE Computer Society, 2010: 1-9.

共引文献33

同被引文献26

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部