DHT的分层结构多出口选择问题研究
发布时间：2018-08-18 16:23
【摘要】：为了提高系统可靠性和查询效率,提出了具有多管理节点(出口节点)的DHT分层模型,并给出了3种查询算法:最短路径选择算法、基于热土豆模型的最小化组内流量算法和出口节点负载均衡选择算法。通过仿真实验对3种算法在查询效率、流量分析和负载均衡3个维度进行了分析比较,基于热土豆模型的最小化组内流量算法具有最高的查询效率,但是负载均衡性能最差,出口节点负载均衡选择算法具有最好的负载平衡性,但查询效率最低,最短路径算法性能则介于上述两种算法之间。同时对传统分层结构所采用的随机查询算法与基于热土豆模型的最小化组内流量和最短路径查询算法进行了性能对比。
[Abstract]:In order to improve system reliability and query efficiency, a hierarchical DHT model with multi-management nodes (exit nodes) is proposed, and three query algorithms are presented: shortest path selection algorithm. The algorithm of minimizing intra-group flow and load balancing selection algorithm based on hot potato model. Through the simulation experiments, the query efficiency, traffic analysis and load balancing of the three algorithms are analyzed and compared. The algorithm based on hot potato model has the highest query efficiency, but the worst load balancing performance. The load balancing selection algorithm of exit node has the best load balance, but the query efficiency is the lowest, and the performance of the shortest path algorithm is between the above two algorithms. At the same time, the performance of random query algorithm based on traditional layered structure is compared with that of minimizing intra-group flow and shortest path query algorithm based on hot potato model.
【作者单位】： 国网四川电科院信息通信安全技术监督室;重庆大学信息物理社会可信服务计算教育部重点实验室;西南交通大学信息科学与技术学院;
【基金】：国家自然科学基金青年资助项目(61402384)~~
【分类号】：TP393.02
本文编号：2190020
[Abstract]:In order to improve system reliability and query efficiency, a hierarchical DHT model with multi-management nodes (exit nodes) is proposed, and three query algorithms are presented: shortest path selection algorithm. The algorithm of minimizing intra-group flow and load balancing selection algorithm based on hot potato model. Through the simulation experiments, the query efficiency, traffic analysis and load balancing of the three algorithms are analyzed and compared. The algorithm based on hot potato model has the highest query efficiency, but the worst load balancing performance. The load balancing selection algorithm of exit node has the best load balance, but the query efficiency is the lowest, and the performance of the shortest path algorithm is between the above two algorithms. At the same time, the performance of random query algorithm based on traditional layered structure is compared with that of minimizing intra-group flow and shortest path query algorithm based on hot potato model.
【作者单位】： 国网四川电科院信息通信安全技术监督室;重庆大学信息物理社会可信服务计算教育部重点实验室;西南交通大学信息科学与技术学院;
【基金】：国家自然科学基金青年资助项目(61402384)~~
【分类号】：TP393.02
【相似文献】
相关期刊论文 前2条
1 邓泽;冯丹;周可;施展;;一种面向结构化P2P网络的基于闲谈的资源发现方法[J];电子学报;2010年11期
2 ;[J];;年期
，本文编号：2190020
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2190020.html
