一种基于互惠能力的P2P网络拓扑优化算法  

A topology optimization algorithm based on reciprocal capability in P2P networks

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

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

出　　处：《计算机工程与科学》2016年第6期1091-1096,共6页Computer Engineering & Science

基　　金：国家自然科学基金(61572191;61571188);湖南省教育厅优秀青年科研项目(15B125);湖南省计算机应用技术重点建设学科资助

摘　　要：高效的拓扑优化算法是非结构化对等网络的研究热点之一。针对现有对等网络拓扑优化算法大多基于理想的网络环境、缺乏对节点自身能力和外部环境的综合考虑的不足,给出了一种基于互惠能力的对等网络拓扑优化算法。它从节点自身能力和外部环境因素两个方面来计算节点的互惠能力,在此基础上对非结构化对等网络的拓扑结构进行优化。分析与实验结果表明,该拓扑优化算法能将互惠能力低的节点排挤到网络边缘,降低其对网络整体性能的影响,并能有效地提高对等网络的资源搜索效率。Efficient topology optimization algorithms are one of the research hotspots in the domain of unstructured P2P networks. In view that the existing P2P network topology optimization algorithms are mostly based on an ideal network environment, and the self-capacity and external-surroundings of nodes are not considered comprehensively, we present a topology optimization algorithm based on recip- rocal capability in P2P networks. The reciprocal capability of nodes is calculated according to two as- pects： self-capacity and external-surroundings, based on which the topology of the unstructured P2P network is optimized. Analysis and simulation show that the proposed algorithm is capable of forcing nodes of lower reciprocal capability to the margin of P2P networks, reducing their impact on the overall performance of the network and effectively improving the search efficiency of P2P networks.

关 键 词：对等网络 互惠能力 自身能力 外部环境 拓扑优化 

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