| 基于P-范式模型的P2P网络分组查询算法 |
| |
| 引用本文： | 张晓玲,钟诚,李智,蓝乾艺.基于P-范式模型的P2P网络分组查询算法[J].计算机工程与应用,2007,43(24):127-130. |
| |
| 作者姓名： | 张晓玲 钟诚 李智 蓝乾艺 |
| |
| 作者单位： | 1. 广西大学,计算机与电子信息学院,南宁,530004
2. 广西大学,计算机与电子信息学院,南宁,530004;广西科技信息网络中心,南宁,530012 |
| |
| 基金项目： | 广西自然科学基金
,
广西研究生创新教育计划
,
广西科技信息网络中心课题 |
| |
| 摘 要： | P2P系统的可用性取决于查找数据的有效方法。利用节点兴趣和节点与中心节点的通信延迟建立链接,动态分组P2P网络的节点,查询节点通过中心节点转发搜索请求给其他中心节点,中心节点收到搜索请求后,若查找资源的主题排在本组关注的前K(K一般取1～3)位,则搜索本组内所有节点。在此基础上,提出了一种基于P-范式模型的P2P网络分组查询算法。算法分析和实验结果表明该算法的性能优于MSW查询算法。
|
| 关 键 词： | P2P网络 查询算法 P-范式模型 节点兴趣 分组 |
| 文章编号： | 1002-8331（2007）24-0127-04 |
| 修稿时间： | 2006-12 |
P2P network grouping search algorithm based on P-paradigm model |
| |
| ZHANG Xiao-ling,ZHONG Cheng,LI Zhi,LAN Qian-yi.P2P network grouping search algorithm based on P-paradigm model[J].Computer Engineering and Applications,2007,43(24):127-130. |
| |
| Authors: | ZHANG Xiao-ling ZHONG Cheng LI Zhi LAN Qian-yi |
| |
| Affiliation: | 1.School of Computer and Electronics and Information,Guangxi University,Nanning 530004,China; 2.Guangxi Science and Technology Network Information Center,Nanning 530012,China |
| |
| Abstract: | The usability of Peer-to-Peer(P2P) systems depends on the effective techniques to find and retrieve data.Based on the P-paradigm model,a P2P network grouping search algorithm is presented by establishing the links and partitioning dynamically the nodes of P2P networks according to peer's interest and communication delay.Its key idea is that the searching node transmits messages into the center node and the center node transmits the messages to the nodes whose interest is similar to the messages.The theoretical analysis and experiment results show that the performance of the algorithm is superior to the MSW searching algorithms. |
| |
| Keywords: | P2P network searching algorithm P-paradigm model node interest partitioning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
