%0 Journal Article
%T Searching algorithm based on special interest group in P2P networks<br>基于特别兴趣组的P2P网络搜索算法
%A WU Lian-long
%A <br>吴连龙
%J 计算机应用
%D 2007
%I 
%X From the perspective of implementation of a searching engine, flooding strategy, expending ring strategy, walker strategy and k-walker strategy were analyzed. According to the strategies, the idea of "small world" was adopted, and then a searching algorithm based on special interest group in Peer-to-Peer networks was proposed. The key idea of the algorithm was to change the role of network nodes from passive information providers to active servers for enquiries. In other words, the role of network nodes was changed from an information provider to an inquiry guider. Each node not only provided the required information for enquiries, but also led enquiries to nodes with same interests using the address book of special interest group. Therefore, the searching process could be speeded up, and the load of network could be reduced.
%K searching algorithm
%K special interesting group
%K Peer-to-Peer (P2P) networks
%K searching engine<br>搜索算法
%K 特别兴趣组
%K P2P网络
%K 搜索引擎
%K 网络搜索算法
%K networks
%K group
%K interest
%K special
%K based
%K algorithm
%K 网络负荷
%K 查询速度
%K 通讯簿
%K 利用
%K 信息提供者
%K 作用
%K 提供服务
%K 网络节点
%K 提供信息
%K 查询算法
%K 网路
%K 思想
%K 小世界
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD27430512920ED42FDC53EDFE&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=5D311CA918CA9A03&sid=65B74213B7DFEAD0&eid=8F23BB34AC8262BD&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=6