期刊文献+

基于反馈的非结构化P2P网络混合搜索算法 被引量:1

Feedback-based hybrid search algorithm in unstructured peer-to-peer networks
下载PDF
导出
摘要 为了提高P2P网络搜索效率和有效地减少冗余消息,提出一种基于反馈的混合搜索算法,将查询消息在某些高度数节点处转发给多个邻居节点而在其他节点处只转发给一个邻居节点,并且在搜索过程中利用先前搜索的反馈信息来指导搜索,以选择能够返回最多最近响应结果的邻居节点转发消息。算法分析和实验结果表明,该算法不仅实现了较高的成功率、响应率和搜索效率,还能有效地减少冗余消息,并且具有良好的自适应能力,能快速适应不断变化的网络行为。 In order to improve search efficiency and reduce redundant messages efficiently in P2P networks, this paper proposed a feedback-based hybrid search algorithm. It forwarded the query messages to a subset of neighbors at some high-degree nodes and to only ones at other nodes, and utilized the feedback from the previous searches to guide current ones in the searching process to select those neighbors that can return the most and nearest results to query. The algorithm analysis and experimental results show that this algorithm not only achieves higher success rate, query hits and search efficiency, but also reduces redundant messages efficiently. Furthermore, it has a better self-adaptive ability to rapidly adapt the dynamical hanging network behaviors.
出处 《计算机应用研究》 CSCD 北大核心 2008年第3期872-875,共4页 Application Research of Computers
基金 广西科学基金资助项目(桂科基0575014) 广西研究生创新教育计划资助项目(2006105930812M29) 广西科技信息网络中心资助项目
关键词 对等网络 混合搜索 反馈 自适应能力 P2P networks hybrid searching feedback self-adaptive ability
  • 相关文献

参考文献11

  • 1YANG B, GARCIA-MOLINA H. Improving search in peer-to-peer networks[ C]//SIVILOTTI P A G. Proc of the 22nd International Conference on Distributed Computing Systems. Los Alamitos, CA: IEEE Computer Society Press. 2002: 5-14.
  • 2JIANG Song, GUO Lei, ZHANG Xiao-dong. LightFlood: an efficient flooding scheme for file search in unstructured peer-to-peer systems [C ]//Proc of International Conference on Parallel Processing (ICPP'03). Los Alamitos, CA: IEEE Computer Society Press, 2003 : 627-635.
  • 3ZHENG Qian-bing, WANG Yong-wen, LU Xi-cheng. WCBF: efficient and high-coverage search schema in unstructured peer-to-peer network[ C]//JIN H, PAN Y, XIAO N, et al. Proc of the 3rd International Conference on Grid and Cooperative Computing (GCC 2004), LNCS 3251. Berlin, Heidelberg: Springer-Verlag, 2004: 487-494.
  • 4KALOGERALI V, GUNOPULOS D, ZEINALIPOUR-YAZTI D. A local search mechanism for peer-to-peer networks [ C ]//Proc of the 11 th International Conference on Information and Knowledge Management ( CIKM' 02). New York : ACM Press, 2002:300- 307.
  • 5LV Q, CAO P, COHEN E, et al. Search and replication in unstructured peer-to-peer networks[ C ]//Proc of the 16th International Conference on Supercomputing (ICS' 02 ). New York: ACM Press, 2002 : 84-95.
  • 6TSOUMAKOS D, ROUSSOPOULOS N. Adaptive probabilistic search for peer-to-peer networks[ C ]// Proc of the 3rd International Conference on Peer-to-Peer Computing ( P2P' 03 ). Washington DC : IEEE Computer Society, 2003 : 102-109.
  • 7ZHUGE Hai, CHEN Xue, SUN Xiao-ping. Preferential walk: to-wards efficient and scalable search in unstructured peer-to-peer networks[ C ]//Special Interest Tracks and Posters of the 14th International Conference on World Wide Web. New York: ACM Press, 2005,882- 883.
  • 8PeerSim P2P simulator [ EB/OL]. [ 2007-01-18 ], http ://peersim. sourceforge, net/.
  • 9BRITE: Boston University representative Internet topology generator [ EB/OL]. [2007-01-18]. http://www. cs. bu. edu/brite/.
  • 10CHU J, LANONTE K, LEVINE B N. Availability and locality measurements of peer-to-peer file systems [ C ]// FIROIU V, ZHANG Zhi-li. Proc of the SPIE Vol. 4868, Scalability and Traffic Control in IP Networks Ⅱ. Boston: SPIE, 2002: 310-321.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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