期刊文献+

基于Gnutella的P2P搜索改进算法的研究

Optimized P2P Searching Algorithm Based on Gnutella
下载PDF
导出
摘要 在对洪泛算法和现有基于索引机制的资源定位策略进行研究基础上,对现有的路由算法进行改进:通过在节点增加缓存的方式来记录查询返回消息以提高重复查询的效率;通过对特定查询消息的生命周期值的修改来保证指引查询时查询消息的可达性. This paper aims at improving the existing routing algorithem on the basis of the research of flooding algorithm and the existing recourse location strategy based on index mechanism:Increasing the cache of backtracked queryhit message to improve the efficiency and ratio of repeated queries;Self-increasing TTL value to ensure reachability of query messages.
出处 《湖北工业大学学报》 2012年第2期27-30,共4页 Journal of Hubei University of Technology
关键词 对等网络 非结构化 缓存 P2P networks Unstructured Cache
  • 相关文献

参考文献7

二级参考文献51

  • 1周晋,路海明,李衍达.用Small-World设计无组织P2P系统的路由算法[J].软件学报,2004,15(6):915-923. 被引量:31
  • 2胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报,2005,16(5):991-999. 被引量:14
  • 3Rhea, Geels, Roscoe, et al. Handling Churn in a DHT, University of Califoria,Berkeley and In tel Reasearch[M]. Berkeley, 2003.
  • 4Stoica, Morris, Karger, et al. Chord: A Scalable Peer - to - Peer Lookup Service for Internet Applications. In the Proceedings of ACM SIGCOMM 2001,2001.
  • 5Rowstron, Druschel. Pastry: Sealable, Decentralized Object Location and Routing for Large - scale Peer -to - Peer Systems,2001.
  • 6Balakrishnan, Kaashoek, KargerMorris, et al. Looking up Data in P2P Systems. In Comunications of the ACM, 2003, 46(2).
  • 7Ramasubramanian, Sirer. Proaetive Caching for Better than Single -Hop Lookup Performance. Cornell University, Comouter Science Department Technical Report TR - 2004 - 1931,2004.
  • 8Gummadi K,Gummadi R,Gribble,et al. The Impact of DHT Routing Geometry on Resilience and Proximity. In Proceedings of ACM SIGCOMM,2003.
  • 9Watts D, Strogatz S. Collective Dynamics of "Small World" Networks. Nature 393,1998.
  • 10Brin S,Page L. The Anatomy of a Large - Scale Hypertex - tual Web Search Engin[ EB/OL]. http://google. stanford. edu/long321.htm.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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