| 对等网络中基于结点兴趣的资源查找算法 |
| |
| 引用本文： | 邹洵.对等网络中基于结点兴趣的资源查找算法[J].计算机时代,2009(7):53-56. |
| |
| 作者姓名： | 邹洵 |
| |
| 作者单位： | 广东商学院信息学院,广东,广州,510320 |
| |
| 摘 要： | 为了提高对等网络中资源查找的效率，根据P2P结点的群聚特性，构建了基于结点兴趣的覆盖网络，并设计了相应的资源查找算法。算法根据查询请求和结点的相似度来决定搜索策略，在簇内查找请求不能被满足时，请求将被发送到与其兴趣最为相似的其他簇内。仿真测试表明，算法稳定高效，搜索成功率和查找效率均优于传统的搜索算法。
|
| 关 键 词： | P2P 小世界 兴趣 相似度 |
Resource Search Algorithm Based on Nodes-Interest in P2P Network |
| |
| ZOU Xun.Resource Search Algorithm Based on Nodes-Interest in P2P Network[J].Computer Era,2009(7):53-56. |
| |
| Authors: | ZOU Xun |
| |
| Affiliation: | School of Information Technology;Guangdong University of Business Studies;Guangzhou 510320;China |
| |
| Abstract: | In order to improve resource search efficiency in peer-to-peer network,according to the characteristics of clusters of P2P nodes,an overlay network based on nodes-interest is constructed and corresponding resource search algorithm is designed.The algorithm determines search strategy based on inquiry request and node similarity.Unsatisfied search request within the cluster will be sent to other clusters with the most similar interest.Simulation results show that the algorithm is stable and high efficiency,it... |
| |
| Keywords: | peer-to-peer small-world interest similarity degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
