| DHT的分层结构多出口选择问题研究 |
| |
| 引用本文： | 张泰,王胜,柴继文,向宏,李可. DHT的分层结构多出口选择问题研究[J]. 重庆大学学报(自然科学版), 2017, 40(5): 72-80. DOI: 10.11835/j.issn.1000-582X.2017.05.009 |
| |
| 作者姓名： | 张泰 王胜 柴继文 向宏 李可 |
| |
| 作者单位： | 1. 国网四川电科院信息通信安全技术监督室,成都,610000;2. 重庆大学信息物理社会可信服务计算教育部重点实验室,重庆,400044;3. 西南交通大学信息科学与技术学院,成都,611756 |
| |
| 基金项目： | 国家自然科学基金青年资助项目（61402384）。 |
| |
| 摘 要： | 为了提高系统可靠性和查询效率,提出了具有多管理节点(出口节点)的DHT分层模型,并给出了3种查询算法:最短路径选择算法、基于热土豆模型的最小化组内流量算法和出口节点负载均衡选择算法。通过仿真实验对3种算法在查询效率、流量分析和负载均衡3个维度进行了分析比较,基于热土豆模型的最小化组内流量算法具有最高的查询效率,但是负载均衡性能最差,出口节点负载均衡选择算法具有最好的负载平衡性,但查询效率最低,最短路径算法性能则介于上述两种算法之间。同时对传统分层结构所采用的随机查询算法与基于热土豆模型的最小化组内流量和最短路径查询算法进行了性能对比。
|
| 关 键 词： | 分布式哈希表 分层结构 查询效率 负载均衡 |
| 收稿时间： | 2016-12-10 |
Multiple gateway nodes selection of DHT-based hierarchy model |
| |
| ZHANG Tai,WANG Sheng,CHAI Jiwen,XIANG Hong and LI Ke. Multiple gateway nodes selection of DHT-based hierarchy model[J]. Journal of Chongqing University(Natural Science Edition), 2017, 40(5): 72-80. DOI: 10.11835/j.issn.1000-582X.2017.05.009 |
| |
| Authors: | ZHANG Tai WANG Sheng CHAI Jiwen XIANG Hong LI Ke |
| |
| Affiliation: | Department of Information and Communication Security and Technology, Sichuan Electric Power Research Institute, Chengdu 610000, P. R. China,Department of Information and Communication Security and Technology, Sichuan Electric Power Research Institute, Chengdu 610000, P. R. China,Department of Information and Communication Security and Technology, Sichuan Electric Power Research Institute, Chengdu 610000, P. R. China,Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education, Chongqing University, Chongqing 400044, P. R. China and School of Information Science and Technology, Southwest Jiao Tong University, Chengdu 611756, P. R. China |
| |
| Abstract: | A hierarchy model of multiple manager nodes based on DHT was proposed to solve the single-point problem and to improve the lookup efficiency of traditional hierarchical DHT, and then three lookup algorithms, i.e. the shortest path selection algorithm(SPSA), the minimum intra-group traffic based on hot potato algorithm(MIT_HP) and the load balancing with gateway selection algorithm(LBGS), were proposed. Simulation experiments were carried out to analyze lookup efficiency, intra-group traffic and load balance of the three algorithms. The simulation results show that the MIT_HP algorithm has the maximal lookup efficiency but has the worst load balance, the LBGS has the best load balance but has the worst lookup efficiency, and the performance of SPSA is between MIT_HP and LBGS. In addition, the paper presents performance comparison between MIT_HP and SPSA with random lookup algorithm which adopted by traditional hierarchical DHT. |
| |
| Keywords: | DHT hierarchical model lookup efficiency load balance |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《重庆大学学报(自然科学版)》下载全文 |
|
