期刊文献+

基于预算机制的非结构化P2P网络搜索算法 被引量:5

Search algorithm based on budget mechanism for unstructured P2P network
下载PDF
导出
摘要 目前非结构化对等网络(P2P)搜索算法均采用生存时间(TTL)机制控制搜索算法的搜索深度,有效地控制了搜索消息在网络上的传播,对于盲目搜索算法控制效果较好。但是TTL机制由于存在着在相同的搜索半径内所搜索的节点数目差异巨大、各个搜索分支只能搜索同一深度等缺陷,搜索效果不稳定且不能较好支持目前主流的基于兴趣域等导向性搜索算法。针对这一问题,提出采用预算机制取代TTL机制,通过使用预算值取代传统的TTL值来控制搜索的深度和搜索节点数目,能保证搜索节点数目较固定且能实现不同搜索分支采用不同搜索深度,从而更好地支撑导向性搜索算法。实验表明,基于预算机制的非结构化P2P网络搜索算法的搜索节点数目稳定,导向性好,算法搜索效率较高。 Most existing search algorithms for unstructured Peer-to-Peer (P2P) network use the Time To Live (TTL) mechanism to control the search depth of the search algorithm,which is effective in the control of the search message transmitted in the network and the blind search algorithm.However,there is a huge difference in the number of nodes searched by TTL-based algorithm even with the same search radius.And each search branch of the TTL-based algorithm can only search the same depth of the network,thus resulting in the unstable search efficiency,which can not be a good support for main current interest-domain oriented search algorithms.To solve this problem,the budget mechanism was used to replace the TTL mechanism,and the budget value was used to replace the traditional TTL value to control the depth of search and number of search nodes,which would ensure more stable number of search nodes and achieve different search branches using different search depth,give a better support for oriented search algorithms.Experiments show that search algorithm based on budget mechanism for unstructured P2P network has more stable number of searched nodes,a good orientation,and higher efficiency.
出处 《计算机应用》 CSCD 北大核心 2010年第5期1166-1170,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(90818028) 国家科技支撑计划项目(2008BAH37B04)
关键词 对等网络 搜索深度 导向性搜索 生存时间 Peer-to-Peer (P2P) network search depth oriented search Time To Live (TTL)
  • 相关文献

参考文献13

  • 1SAROIU S,GUMMADI K P,GRIBBLE S D.Measuring and analyzing the characteristics of Napster and Gnutella hosts[J].Multimedia Systems,2003,9(2):170-184.
  • 2SCHOLLMEIER R,SCHOLLMEIER G.Why Peer-to-Peer (P2P) does scale:An analysis of P2P traffic patterns[C]// P2P 2002:Proceedings of the Second International Conference on Peer-to-Peer Computing.Washington,DC:IEEE Press,2002:112-119.
  • 3GKANTSIDIS C,MIHAIL M,SABERI A.Random walks in peerto-peer networks:Algorithms and evaluation[J].Performance Evaluation,2006,63(3):241-263.
  • 4Cygwin[EB/OL].(2008-09-01)[2009-10-01].http:// nsnam,isi.edu/nsnam/index.php/Running_Ns_and_Nam_Under_ Windows_9x/20OO/XP_Using_Cygwin.
  • 5NS2[EB/OL].(2008-09-10)[2009-10-08].http://www.isi.edu/usnam/ns/.
  • 6HE QI,AMMAR M,RILEY G,et al.Mapping peer behavior to packet-level details:A framework for packet-level simulation of peer-to-peer systems[C]// MASCOTS03:11th IEEE International Symposium on Modeling,Analysis,and Simulation of Computer and Telecommunications Systems.Washington,DC:IEEE Computer Society,2003:71-78.
  • 7PALMER C R,STEFFAN J G.Generating network topologies that obey power laws[C]// Globecem2000:Proceedings of the Global lnternet Symposium.Washington,DC:IEEE Press,2000:434-438.
  • 8GT-ITM[EB/OL].(2008-09-10)[2009-09-12].http:// www.cc.getech.odu/fac/Ellen.Zegura/graphs.html.
  • 9BUCKLEY C.Implementation of the SMART information retrieval system,TR35-686[R].Ithaca,NY,USA:Comell University,1985.
  • 10夏启志,谢高岗,闵应骅,李忠诚.IS-P2P:一种基于索引的结构化P2P网络模型[J].计算机学报,2006,29(4):602-610. 被引量:39

二级参考文献13

  • 1Milojicic Dejan S.et al.Peer-to-Peer Computing.Hewlett-Packard Company,2002
  • 2Tsoumakos D.et al.A comparison of Peer-to-Peer search methods.In:Proceedings of the WebDB,San Diego,CA,USA,2002,61~66
  • 3Ratnasamy S,Francis P,Handley M,Karp R..A scalable content-addressable network.In:Proceedings of the SIGCOMM 2001,San Diego,CA,USA,2001,161~172
  • 4Stoica I,Morris R,Karger D,Kaashoek M,Balakrishnan H..Chord:A scalable Peer-to-Peer lookup service for internet applications.In:Proceedings of the SIGCOMM 2001,San Deigo,CA,USA,2001,149~160
  • 5Castro M,Druschel P,Hu Y,Rowstron A..Exploiting network proximity in distributed hash tables.In:Proceedings of the FuDiCo 2002,Bertinoro,Italy,2002,52~55
  • 6Zhao B,Kubiatowicz J,Joseph A..Tapestry:An infrastructure for fault-tolerant wide-area location and routing.UCBerkeley:Technical Report UCB/CSD-0101141,2001
  • 7Schollmeier Rudiger.Why P2P (Peer-to-Peer) does scale:Analysis of P2P traffic patterns.In:Proceeding of the IEEE P2P Computing Conference,Link(o)ping,Sweden,2002,112~ 119
  • 8Saroiu S,Gummadi P.K,Gribble S.D..A measurement study of Peer-to-Peer file sharing systems.In:Proceedings of the Multimedia Computing and Networking Conference,San Jose,California,USA,2002
  • 9Sen Shubho,Wang Jia.Analyzing P2P traffic across large networks.In:Proceedings of the ACM SIGCOMM Internet Measurement Workshop (IMW),Marseilles,France,2002
  • 10Mizrak A.T,Cheng Yu-Chung et al.Structured superpeers:Leveraging heterogeneity to provide constant-time lookups.In:Proceedings of the 3rd IEEE Workshop on Internet Applications,San Jose,California,2003,104~111

共引文献38

同被引文献46

引证文献5

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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