对等网络中资源共享引力的拓扑优化算法  

Topology Optimization Algorithm Based on Resource Sharing Gravitation in P2P Network

作　　者：刘浩[1] 张连明[2] 贺文华[1] 

机构地区：[1]湖南人文科技学院信息学院,湖南娄底417000 [2]湖南师范大学物理与信息科学学院,长沙410081

出　　处：《小型微型计算机系统》2017年第1期87-91,共5页Journal of Chinese Computer Systems

基　　金：湖南省教育厅优秀青年科研项目(15B125)资助;湖南省计算机应用技术重点建设学科项目(湘教发[2011]76号)资助

摘　　要：针对现有对等网络拓扑优化算法大多基于理想的网络环境,缺乏对节点内在因素和外部环境的综合考虑,给出一种对等网络中资源共享引力的拓扑优化算法.它通过节点共享的资源量、资源的真实性评价、资源需求度等内在因素和节点间虚拟距离的外部环境来构建节点的资源共享引力,在此基础上对非结构化对等网络的拓扑结构进行优化.分析与实验结果表明该拓扑优化算法能将资源共享引力低的节点排挤到网络边缘,降低其对网络整体性能的影响,并能有效地提高对等网络的资源搜索效率.In view of the existing P2P network topology optimization algorithms are mostly based on the ideal network environment, the internal factors and external-surroundings of nodes are not considered comprehensively, a topology optimization algorithm based on resource sharing gravitation in P2P Network is presented. The resource sharing gravitation of node is calculated according to two as- pects, the internal factors such as the number of resource shared, the authenticity evaluation of resource shared, the requirement degree of resource and the external-surroundings such as virtual distance, the topology of unstructured P2P network is optimized based on it. Analysis and simulation show that this topology optimization algorithm is capable of forcing the lower resource sharing gravitation nodes to the marginal of P2P network,reducing their impact on the overall performance of the network and effectively improving the search efficiency of P2P network.

关 键 词：对等网络 共享引力 多维信任云 虚拟距离 拓扑优化 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]