摘要
针对分布式数据存储算法通常需要较长的等待时间、且对海量数据加密时严重浪费计算资源和时间的问题,提出了一种基于K-距离拓扑的分布式数据存储方法.通过寻找K-距离拓扑子图来实现数据的安全放置,优先选择存取速度更快的节点和自身保护能力强的节点实现总体性能的提升.在Internet 2拓扑图与随机拓扑图下的仿真测试结果表明,所提出的方法能在满足安全距离约束的条件下选择到最优的数据存储节点,从而减小数据存取时间.
Aiming at the distributed data storage algorithms usually requiring long waiting time and severe wastes of computing resources and time when encrypting massive data,a distributed data storage method based on K-distance topology was proposed.Safe placement of data was realized by searching the K-distance topology sub-graph,and the nodes with faster access speed and strong self-protection ability were preferentially selected to realize overall performance improvement.The simulation test results under Internet 2 and random topology graphs show that the as-proposed method can select the optimal data storage nodes under the condition of safe distance constraint,thus it can reduce the data access time.
作者
郎登何
LANG Deng-he(School of Big Data and Software Engineering, Chongqing University, Chongqing 401331, China;School of Artificial Intelligence and Big Data, Chongqing College of Electronic Engineering, Chongqing 401331, China)
出处
《沈阳工业大学学报》
EI
CAS
北大核心
2021年第1期67-71,共5页
Journal of Shenyang University of Technology
基金
重庆市教育科学规划项目(2019-GX-500).
