首页 | 本学科首页   官方微博 | 高级检索  
     

在非结构化P2P网络中的搜索算法研究
引用本文:庞庆元,林亚平. 在非结构化P2P网络中的搜索算法研究[J]. 计算机工程与设计, 2006, 27(21): 4049-4051,4057
作者姓名:庞庆元  林亚平
作者单位:1. 湖南大学,软件学院,湖南,长沙,410082
2. 湖南大学,计算机与通信学院,湖南,长沙,410082
摘    要:Peer-to-Peer系统已经引起了越来越多网络用户的关注。而这种系统的一个核心技术是搜索算法。洪泛是应用在非结构化P2P网络中的基本搜索方法。它具有响应时间短,搜索成功率高,可靠性好等优点;它的不足是会产生大量多余搜索消息,消耗带宽等。根据洪泛和随机漫步的特性,在此提出选择洪泛算法。该算法维持了洪泛的优点,同时又降低多余消息的产生。从模拟实验可以看出,算法有效地降低了多余消息的产生,改善了网络运行环境。

关 键 词:对等网络  非结构化对等网络  对象定位  洪泛  随机漫步
文章编号:1000-7024(2006)21-4049-03
收稿时间:2005-09-29
修稿时间:2005-09-29

Research of search algorithm in unstructured P2P network
PANG Qing-yuan,LIN Ya-ping. Research of search algorithm in unstructured P2P network[J]. Computer Engineering and Design, 2006, 27(21): 4049-4051,4057
Authors:PANG Qing-yuan  LIN Ya-ping
Affiliation:1. College of Software, Hunan University, Changsha 410082, China; 2. College of Computer Science and Communication, Hunan University, Changsha 410082, China
Abstract:Peer-to-peer network has gained increasing attention from the large Internet users. Search algorithm is a key problem of such networks. Blind flooding is a popular search mechanism used in unstructured peer-to-peer network. It has the advantages of quick response time and high reliability. However, it also suffers from serious problem. There exists a great amount of redundant messages and thus it will consume a lot of bandwidth. A selecting flooding algorithm is proposed. It can keep quick response time to flooding while it decreases redundant messages. The analysis and simulation results show that the selecting flooding is an efficient method in de- creasing redundant messages.
Keywords:peer-to-peer network   unstructured peer-to-peer network   objects location   flooding   random walk
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号