期刊文献+

基于节点热度的改进Gnutella2搜索算法 被引量:3

An Improved Search Algorithm for Gnutella2 Based on Node's Popularity
下载PDF
导出
摘要 Gnutella2的搜索算法在超级节点间转发消息采用泛洪机制,在大规模文件共享中产生较多冗余消息,降低了搜索效率。为提高搜索效率,提出一种基于节点热度的改进搜索算法。该算法根据P2P网络中的幂律特性,提出节点热度概念,根据节点热度选择转发超级节点,设计了基于节点热度的搜索算法;在节点热度的计算中,引入惩罚因子减少无效搜索;在搜索消息转发时,通过最热轮空策略来均衡高热度节点的负载。对实验结果的分析表明,该算法在保证搜索命中率的前提下,能有效减少平均搜索时间和平均跳数,提高了搜索性能。 The Gnutella2 search algorithm supernodes forward search messages by using flooding mecha- nism, which leading to redundant messages and inefficiency in large-scale file-sharing system. To improve the search efficiency, an improved search algorithm based on nodes' popularity for Gnutella2 is proposed. According to power-law property in the P2P network, the conception of nodes' popularity is proposed. A search algorithm based on node's popularity is designed; When the nodes' popularity is calculated, the penalty factor is used to reduce the invalid search; When forwarding the search messages, the hottest su- pernodes are rejected to balance the high popularity supernodes' load. The experimental results show that the NPS algorithm can reduce the average search time and hops while insuring the search hit rate and improving the search efficiency.
出处 《南京邮电大学学报(自然科学版)》 2011年第6期55-59,共5页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金 教育部博士点基金(20093223120001) 江苏省科技支撑计划(BE2009158) 江苏省高校自然科学基金(09KJB520010) 教育部专项研究课题(2009117)资助项目
关键词 P2P网络 Gnutella2 节点热度 幂律特性 P2P network Gnutella2 node' s popularity power-law property
  • 相关文献

参考文献10

  • 1TANG Chunqiang, XU Zhichen, MAHALINGAM M. pSearch : infor- mation retrieval in structured overlays I J]. ACM SIGCOMM Com- puter Communication Review ,2003,33 ( 1 ) :89 - 94.
  • 2TSOUMAKOS D, ROUSSOPOULOS P. Analysis and comparison of P2P search methods[ C]//Proceedings of the 1st international con- ference on Scalable information systems. Hong Kong, China:ACM, 2006:25 - 35.
  • 3QIN Lv, PEI Cao, EDITH Cohen, et al. Search and Replication in UnStructured Peer-to-peer Networks [ C ]//Proceedings of the 16th international conference on Supercomputing. New York, USA : ACM, 2002:84 - 95.
  • 4IOANNIDIS S, MARBACH P. On the design of hybrid peer-to-peer systems [ J ]. ACM SIGMETRICS Performance Evaluation Review, 2008,36 ( 1 ) : 157 - 168.
  • 5HARISH P M,ANANDAVELU N, ANBALAGAN N, et al. Result e- valuation strategies for peer selection in P2P[ C ]// Proceedings of the 1 st Bangalore annual Compute conference. New York, USA: ACM ,2008 : 1 - 4.
  • 6FRAIGNIAUD P, GIAKKOUPIS G. The effect of power-law degrees on the navigability of small worlds [ C ]//Proceedings of the 28th ACM symposium on Principles of distributed computing. Calgary, Canada: AC M,2009 : 240 - 249.
  • 7BISKUPSKI B, DOWLING J, SACHA J. Properties and mechanisms of self-organizing MANET and P2P systems [ J ]. ACM Transactions on Autonomous and Adaptive Systems ( TAAS ), 2007,2 ( 1 ) : 1 -34.
  • 8MENASCE D A, KANCHANAPALLI L. Probabilistic scalable P2P resource location services [ J ]. ACM SIGMETRICS Performance E- valuation Review,2002,30 (2) :48 - 58.
  • 9ZHONG Benjamin, FENG Ming, HUANG Changcheng, et al. FISTE : A black box approach for end-to-end QoS management[J]. ACM Transac- tions on Modeling and Computer Simulation ( TOMACS ),2009,19 ( 4 ) : 1 -39.
  • 10http: fig2. trillinux, org.

同被引文献7

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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