%0 Journal Article
%T New P2P searching algorithm based on trust model-SAT<br>一种基于信任模型的P2P快速搜索算法—SAT*
%A FAN Hui-bo
%A ZHANG Xin-you
%A <br>范会波
%A 张新有
%J 计算机应用研究
%D 2011
%I 
%X To solve the problem that how to search resource needed well and truly from abundance of network information,this paper analyzed features and defect about these searching algorithm existed,proposed a new algorithm named SAT,improved the query algorithm,forward and response algorithm under the P2P trust mechanism.Considered the share resource cache and no-echo forward mechanism to reduce search delay.The simulation shows that propose has advantages in successful request and search delay over the Random-walk ...
%K P2P(peer-to-peer)
%K flooding
%K Random-walk
%K trust model
%K searching algorithm<br>对等网
%K 泛洪
%K 随机漫步
%K 信任模型
%K 搜索算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F8EB868F38CE072E1F4BE65625ADF13&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=D2475312E07964AB&eid=9169EB53BEF6F2D4&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9