期刊文献+

一种构建Kademlia网络拓扑的高效算法 被引量:3

Efficient algorithm for building Kademlia topology
下载PDF
导出
摘要 通过对结构化P2P网络Kademlia的特点和分布式网络拓扑管理协议的研究,提出了基于非结构化P2P网络快速构建Kademlia网络拓扑的算法,并进行了实验分析和性能评估。该算法在对数的步数内构建出满意的Kadem lia网络拓扑,最后提出了对算法优化的相关策略。 This paper firstly analyzed the Kademlia and protocols for distributed overlay topology management,and then proposed an algorithm for building Kademlia topology over unstructured P2P network.At last,demonstrated it through extensive simulation experiments that the proposed algorithm could create a perfect Kademlia topology in a logarithmic number of steps.Furthermore,proposed some strategies for optimizing the algorithm.
出处 《计算机应用研究》 CSCD 北大核心 2009年第2期534-536,共3页 Application Research of Computers
关键词 对等网 KADEMLIA 拓扑管理 P2P Kademlia topology management
  • 相关文献

参考文献10

  • 1LUAE K,CROWCROFTJ,PIAS M,et al.Asurvey and comparison ofpeer-to-peer overlay network schemes[].Journal of IEEE Commu-nications Survey and Tutorial.2005
  • 2The Napster homepage http://free.napster.com .
  • 3The Gnutella protocol specification v0.4. http://www.clip2.com .
  • 4KaZaA media desktop. http://www.kazaa.com .
  • 5MONTRESOR A,JELASITY M,BABAOGLU O.Chord on demand[].Proc of the th IEEE International Conference on Peer-to-PeerComputing.2005
  • 6JELASITY M,BABAOGLU O.T-Man:gossip-based overlay topologymanagement[].Proc of the rd International Workshop on Engi-neering Self-Organizing Applications.2005
  • 7JELASITY M,GUERRAOUI R,KERMARREC A,et al.The peersampling service:experimental evaluation of unstructured Gossip-based implementations[].Proc of the th ACM/IFIP/USENIX In-ternational Conference on Middleware.2004
  • 8D. R. Karger,E. Lehman,F. Leighton,M. Levine,D. Lewin,and R. Panigrahy.Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on theWorldWideWeb[].Proc th Annu ACM Symp Theory of Computing.1997
  • 9B.Zhao,J.Kubiatowicz,A.Joseph.Tapestry:An infrastructure for fault-tolerant wide-area location and routing. Technical Report,UCB//CSD-01-1141 . 2001
  • 10A Rowstron,P Druschel.Pastry: scalable, Decentralized object location and routing for large-scale peer-to-peer systems[].Proceedings IFIP/ACM International Conference on Distributed Systems Platforms (Middleware).2001

同被引文献15

  • 1RATNASAMY S,FRANCIS P,HANDLEY M, et al. A scalable content-addressable network [ C ]//Proc of International Conference on Applications Technologies, Architectures, and Protocols for Computer Communication. New York:ACM Press,2001:161-172.
  • 2JELASITY M, BABAOGLU O. T-Man: gossip-based overlay topology management[ C ]//Proc of the 3rd International Workshop on Engineering Self-Organizing Applications. Berlin : Spring,2006 : 1-15.
  • 3MONTRESOR A, JELASITY M, BABAOGLU O. Chord on demand [ C ]//Proc of the 5th IEEE International Conference on Peer-to-Peer Computing. Washington DC : IEEE Computer Society,2005:87-94.
  • 4STOICA I, MORRIS R, KARGER D, et al. Chord: a scalable peer-to- peer lookup service for Internet applications [ C ]//Proc of International Conference on Applications Technologies, Architectures, and Protocols for Computer Communication. New York: ACM Press, 2001: 149-160.
  • 5MAYMOUNKOV P, MAZIERES D. Kademlia : P2P information system based on the XOR metric [C ]//Proc of IPTPS ' 02. Berlin : Springer, 2002 : 53 -65.
  • 6LUA E K, CROWCORFT J, PIAS M, et al. A survey and comparison of peer-to-peer network schemes [ J ]. Journal of IEEE Communications Survey and Tutorial,2005,7(2) :72-93.
  • 7XU Zhi-yong, MIN Rui, HU Yi-ming. Reducing maintenance overhead in DHT based peer-to-peer algorithms[ C]//Proc of the 3rd International Conference on Peer-to-Peer Computing. Washington DC : IEEE Computer Society, 2003 : 218- 219.
  • 8张铮,侯宾,吕玉琴,刘刚,李巍海.在扰动状态下Kademlia协议搜索过程性能分析及优化[J].中国电子科学研究院学报,2008,3(6):604-607. 被引量:1
  • 9马志新,潘伟国,田中彬,蔡军卫,杨金霞.TMK:一种解决拓扑匹配的DHT模型[J].微计算机信息,2009,25(6):139-141. 被引量:1
  • 10陈姝,方滨兴,周勇林.P2P技术的研究与应用[J].计算机工程与应用,2002,38(13):20-23. 被引量:84

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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