基于多重属性的P2P网络节点重要性度量方法

发布时间：2018-01-15 12:33

本文关键词：基于多重属性的P2P网络节点重要性度量方法　出处：《计算机应用》2014年S2期 　论文类型：期刊论文

【摘要】：P2P网络中的节点重要性评价在实际应用中有重要意义。现有的一些重要性评价指标如度、紧密度等存在度量结果较为片面等缺点,单一指标并不能有效地对P2P网络中的节点重要性进行度量。针对此问题,提出了一种基于多重属性的综合度量指标。以节点度作为对比基础,计算多个度量指标与节点度指标的肯德尔相关系数,通过分析多个指标之间的内在关联性,最终选择节点度、介数、K-核和Page Rank四个属性来进行节点重要性的综合度量。通过真实的P2P网络进行实验验证,结果表明,相对原有单一度量指标和现有的综合度量指标,该综合指标更能够有效地对P2P网络中的节点重要性进行度量,而且具有较强的普适性,可以应用到大多数P2P网络中。
[Abstract]:The evaluation of node importance in P2P networks is of great significance in practical applications. Some existing evaluation indicators such as degree and tightness have some shortcomings such as one-sided measurement results and so on. A single index can not effectively measure the importance of nodes in P2P networks. In order to solve this problem, a comprehensive metric based on multiple attributes is proposed, which is based on node degree. The Kendall correlation coefficient between multiple metrics and nodal index is calculated, and the nodal degree and the intermediate number are selected by analyzing the intrinsic correlation between the multiple metrics and the nodal index. K- core and Page Rank are used to measure the importance of nodes. Compared with the original single metric index and the existing comprehensive measurement index, this comprehensive index can effectively measure the importance of nodes in P2P networks, and has a strong universality. It can be applied to most P2P networks.
【作者单位】：国防科学技术大学计算机学院;国防科学技术大学信息中心;
【基金】：国家自然科学基金资助项目(61170286,61202486)
【分类号】：TP393.02
【正文快照】： 0引言节点重要性度量一直是复杂网络领域的研究热点。伴随着信息技术的迅猛发展,人类的社会活动日趋网络化,我们的生活也被各种复杂网络包围着[1],例如社交网络、因特网、电力网络等网络。而复杂网络本质上的非同质拓扑结构,也决定了网络中每个节点的重要性存在差异,寻找出这

【参考文献】