摘要
Peer-to-Peer系统已经引起了越来越多网络用户的关注。而这种系统的一个核心技术是搜索算法。洪泛是应用在非结构化P2P网络中的基本搜索方法。它具有响应时间短,搜索成功率高,可靠性好等优点;它的不足是会产生大量多余搜索消息,消耗带宽等。根据洪泛和随机漫步的特性,在此提出选择洪泛算法。该算法维持了洪泛的优点,同时又降低多余消息的产生。从模拟实验可以看出,算法有效地降低了多余消息的产生,改善了网络运行环境。
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.
出处
《计算机工程与设计》
CSCD
北大核心
2006年第21期4049-4051,4057,共4页
Computer Engineering and Design
关键词
对等网络
非结构化对等网络
对象定位
洪泛
随机漫步
peer-to-peer network
unstructured peer-to-peer network
objects location
flooding
random walk
