基于结点兴趣的P2P系统拓扑结构模型  

Nodes-Interest Based Topology Organizing Model for P2P System

作　　者：邹洵[1] 

机构地区：[1]广东商学院信息学院,广州510320

出　　处：《现代计算机》2009年第4期40-43,共4页Modern Computer

摘　　要：为了对资源进行有效组织,改善P2P系统查询算法的性能,设计了一种基于结点兴趣的P2P拓扑结构模型。通过挖掘结点之间存在兴趣特征的相似性,将结点在覆盖网络层划分成若干个兴趣子网,有效地对资源进行了聚合。使得资源定位最大程度上本地化。仿真实验从网络开销和查找效率对模型的综合性能进行了评估和衡量,证明其稳定高效,具有良好的性能指标。By the way of organizing resources effectively, and improving the performance of query algorithms, proposes a nodes-interest based topology organizing model for P2P system. The scheme mines similarity between interest-characters of the nodes, divided nodes into several interest-subnets, it is effective for the polymerization of nodes. The simulation is carried through to evaluate and measure the search expense and efficiency. It shows that, this model has good performance index.

关 键 词：P2P 概率树 相似度 兴趣子网 

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