期刊文献+

Chord路由算法研究与改进

Researching and Improving of Chord Searching Algorithm
下载PDF
导出
摘要 如何提高搜索效率是P2P网络中的一个核心问题。Chord是一种较好的P2P路由搜索算法,但是其路由表中含有一定的冗余信息,导致查找效率不高。引入了缓存列表,对Chord的路由表进行了修改。增加了路由表中的有效信息,通过理论和模拟仿真实验证明,查询效率明显提高。 How to improve serch efficiency is a core problem in P2P network. Chord is a successful searching algorithm, but its lookup efficiency is lower because finger table has redundant informationn proposed the recently visited table and improved to gain more useful information in Chord. The simulation experiments show that approach can availably improve the routing efficiently.
作者 郭俊 李思莉
出处 《科学技术与工程》 北大核心 2012年第35期9718-9720,9724,共4页 Science Technology and Engineering
关键词 CHORD协议 路由表 分布式散列表 缓存 Chord protocol finger tabl DHASH Cache
  • 相关文献

参考文献8

  • 1Stoica 1, Morris R, Liben-Nowell D ,et al. Chord : a scalable peertopeer lookup protocol for Intenet applications. IEEE/ACM Trans Networking,2003 ;11 ( 1) : 17-32.
  • 2Ratoasamy S,Francis P,Handley A,et al. A scalable-content-addressable network. Govindan R, Ed. Proc of the ACM SIGCOM. M,NewYork:ACM Press,2001:161-172.
  • 3Zhao B, Kubiatowicz J, Joseph A. Tapestry : an infrastructure for fault-tolerant wide-area location and routing http://www. eecs. berke-ley. edu/Pubs/TechRpts/2001 /CSD01-1141. pdf ,2001.
  • 4Zhao B Y,Ling H, Stribling },et al. Tapestry; a resilient global scaleoverlay for service deployment. IEEE Journal on Selected Areas inCommunications,2004;22( 1) :41-53.
  • 5FIPS 180-1. Secureh hash standard..Tech Rep,US Department of Commerce-/NiST, 1995-04 :15-21.
  • 6成培,胡峰松,粟智.基于Chord的结构化P2P路由改进算法[J].计算机工程与设计,2009,30(1):63-65. 被引量:10
  • 7Jesi G P, Howto P S. Build a new protocol for the PeerSim 1. 0 simu-lator http ://peersim. sourcefo-rge. net/ (2005-12-24).
  • 8李士宁,夏贻勇,倪红波,杜艳丽.一种改进的CHORD搜索算法[J].计算机工程与应用,2008,44(22):139-142. 被引量:5

二级参考文献21

  • 1李运娣,冯勇.基于DHT的P2P搜索定位技术研究[J].计算机应用研究,2006,23(10):226-228. 被引量:19
  • 2Napster[EB/OL].http://www.napster.com/.
  • 3Gnutella[EB/OL].http ://gnutella.wego.com/.
  • 4Stoica I,Morris R,Liben-nowell D,et al.Chord:a scalable peer-to- peer lookup protocol for lnternet applications[J].IEEE/ACM Transactions on Networking, 2003,11 ( 1 ) : 17-32.
  • 5Ratnasamy S,Francis P,Handley M,et al.A scalable content-addressable network[C}//Proceedings of the ACM SIGCOMM Symposium on Communication,Architecture,and Protocols,ACM SIGCOMM,2001.
  • 6Rowstom A,Druschel P.Pastry:scalable,decentralized object location and routing for large-scale peer-to-peer systems[C]//Proeeedings of the 18th lFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001 ), Heidelberg, Germany, Nov 2001.
  • 7Zhao B Y,Ling H,Stribling J,et al.Tapestry:a resilient globalscale overlay for service deployment[J].IEEE Journal on Selected Areas in Communications,2004,22(1 ) :41-53.
  • 8Maymounkov P,Mazieres D.Kademliaemlia:a peer-to-peer information system based on the xor metric [C]//Proceedings of the 1st International Workshop on Peer-to-Peer Systems(1PTPS'02),Cambridge, MA, 2002.
  • 9Nicholas J A,Harvey,Jones M B,et al.Skipnet:a scalable overlay network with practical locality properties[C]//Proceedings of the 4th USENLX Symposium on Internet Technologies and Systems (USITS' 03 ),2003.
  • 10P2Psim[EB/OL].http ://www.pdos.lcs.mit.edu/p2psim/.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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