期刊文献+

基于网络覆盖的P2P稀有资源搜索策略

Rare Peer-to-Peer Resource Searching Strategy Based on Network Cover
下载PDF
导出
摘要 针对无结构P2P网络中稀有资源搜索成功率低、搜索代价高的问题,提出2种基于网络覆盖的稀有资源搜索策略:RSR和FRSR。RSR在随机漫步的基础上通过考虑邻居节点的热度改进请求转发方式,FRSR通过结合洪泛搜索改进随机漫步转发策略。实验结果表明,RSR搜索稀有资源的时间比普通随机漫步减少了22.9%,平均搜索成功率提高了26.2%,通信开销降低了22.8%,FRSR比随机转发方式减少了15.4%的搜索时间,提高了14.2%的搜索成功率。 Aiming at the problem that locating rare resource is time-consuming with low success rate in unstructured P2P networks, this paper proposes two strategies for rare resource searching: Random Search for Rare resource(RSR) and Flooding and Random Search for Rare resource(FRSR). Based on random walk, RSR modifies request-forward manner by taking the popularity of neighbor nodes into consideration on passing searching request. FRSR combines flooding search with random walk. Simulations show that compared with Random Walk, RSR can reduce response time and communication cost by 22.9% and 22.8%, and improves success rate by 26.2%. Compared with random request passing method, FRSR reduces the response time by 15.4% and improves success rate by 14.2%.
出处 《计算机工程》 CAS CSCD 北大核心 2009年第11期68-70,共3页 Computer Engineering
基金 国家自然科学基金资助重点项目(60533020) 教育部博士点基金资助项目(20060358011)
关键词 网络覆盖 稀有资源 无结构P2P网络 network cover rare resource unstructured P2P network
  • 相关文献

参考文献5

  • 1Ferreira R A. Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks[C]//Proceedings of IEEE P2P'05. Konstanz, Germany: IEEE Press, 2005.
  • 2王进,顾乃杰,田舟贤.一种P2P网络中的隐蔽搜索模型[J].计算机研究与发展,2008,45(z1):370-374. 被引量:3
  • 3Zhong Ming, Shen Kai. Popularity-based Random Walks for Peer-to-Peer Search under the Square-Root Principle[C]//Proc. of IPTPS'06. Santa Barbara, CA, USA: [s. n.], 2006.
  • 4Chen Avin, Bhaskar K. The Power of Choice in Random Walks: An Empirical Study[J]. Computer Networks, 2008, 52(1): 44-60.
  • 5汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究[J].计算机研究与发展,2007,44(9):1566-1571. 被引量:13

二级参考文献27

  • 1窦文,王怀民,贾焰,邹鹏.模拟谣言传播机制的无结构P2P网络中广播机制的研究[J].计算机研究与发展,2004,41(9):1460-1465. 被引量:20
  • 2李旭华,叶飞跃,蒙德龙.P2P网络中基于代理合作的匿名传输机制[J].计算机应用,2006,26(1):70-71. 被引量:4
  • 3时金桥,程晓明.匿名通信系统中自私行为的惩罚机制研究[J].通信学报,2006,27(2):80-86. 被引量:5
  • 4[1]S Androutsellis-Theotokis,D Spinellis.A survey of peer-to-peer content distribution technologies.ACM Computing Surveys,2004,36(4):335-371
  • 5[4]The Annotated Gnutella Protocol Specification v0.4.http://rfc-gnutella.sourceforge.net/developer/stable/index.html,2001
  • 6[5]V Vishnumurthy,S Chandrakumar,E G Sirer.KARMA:A secure economic framework for P2P resource sharing.The 1st Workshop on Economics of Peer-to-Peer Systems,Berkeley,CA,2003
  • 7[6]U Lee,M Choi,J Cho,et al.Understanding pollution dynamics in P2P file sharing.The 5th Int'l Workshop on Peer-to-Peer Systems (IPTPS'06),Santa Barbara,CA,2006
  • 8[7]Qinyuan Feng,Yafei Dai.LIP:A lIfetime and popularity based ranking approach to filter out fake files in P2P file sharing systems.The 6th Int'l Workshop on Peer-to-Peer Systems (IPTPS'07),Bellevue,WA,2007
  • 9[8]S Saroiu,P K Gummadi,S D Gribble.A measurement study of peer-to-peer file sharing systems.Multimedia Computing and Network 2002 (MMCN'02),San Jose,CA,2002
  • 10[10]Matei A Zaharia,Amit Chandel,Stefan Saroiu,et al.Finding content in file-sharing networks when you can't even spell.Int'l Workshop on P2P Systems,Bellevue,Washingtan,2007

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部