| 基于BFS的轻量级P2P搜索模型 |
| |
| 引用本文： | 徐强,孙乐昌,单洪,赵亭.基于BFS的轻量级P2P搜索模型[J].计算机工程,2009,35(3):106-108. |
| |
| 作者姓名： | 徐强 孙乐昌 单洪 赵亭 |
| |
| 作者单位： | 合肥电子工程学院网络工程系,合肥,230037 |
| |
| 摘 要： | 针对当前P2P搜索中存在的扩展性差和查询绕路问题，提出一种新颖的基于广度优先搜索的搜索方法——局部广度优先搜索（LBFS），构建了轻量级混合式P2P搜索模型，对LBFS的算法进行了正确性与效率分析，通过实验测试了LBFS与模型的性能。结果表明，该模型很好地克服了查询绕路问题，有效地减少消息冗余，具有较高的搜索效率和较好的扩展性能。
|
| 关 键 词： | P2P搜索 扩展性 查询绕路 广度优先搜索 混合式 |
| 修稿时间： | |
Light-weight P2P Search Model Based on BFS |
| |
| XU Qiang,SUN Le-chang,SHAN Hong,ZHAO Ting.Light-weight P2P Search Model Based on BFS[J].Computer Engineering,2009,35(3):106-108. |
| |
| Authors: | XU Qiang SUN Le-chang SHAN Hong ZHAO Ting |
| |
| Affiliation: | Network Engineering Department;Hefei Electronic Engineering Institute;Hefei 230037 |
| |
| Abstract: | This paper proposes LBFS mechanism based on BFS to solve the scalability and detouring problem in existing P2P search approach. A P2P search model named light-weight hybrid model is designed. The algorithm validity in LBFS is proved and its efficiency is analyzed. Experimental results on LBFS and model showt that the model has better performance and scalability by avoiding detouring problem and reducing message redundancy. |
| |
| Keywords: | P2P search scalability detouring breadth first search hybrid |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
