期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于DHT的Kademlia路由算法改进

An Improved Kademlia Routing Algorithm Based on DHT
下载PDF
导出
摘要 Kademlia是一种基于DHT的路由算法。针对该路由算法在热点资源查找定位方面所存在的问题,本文提出了一种改进策略,通过采用快速查表和权重设置对热点资源进行判断和缓存,从而提高系统的整体效率。仿真实验结果表明,改进后的Kademlia路由算法在一定条件下搜索性能优于原Kademlia路由算法。 Kademlia is one of routing algorithms based on DHT. Aiming at the shortages of Kademliain in terms of searching efficiency and the strategy of cache, an improved approach is proposed, by which the hot spot inquiry is implemented using quick table searching and weighting setting. Experiment result shows that the searching performance of the improved strategy is better than that of original one.
作者 孔玉 张升 刘华萍
机构地区 西华大学数学与计算机学院
出处 《西华大学学报（自然科学版）》 CAS 2009年第6期55-58,共4页 Journal of Xihua University:Natural Science Edition
基金 四川省教育厅自然科学科研基金项目(07ZA115 07ZC050)
关键词 P2P 路由算法 DHT KADEMLIA P2P routing algorithm DHT kademlia
分类号 TP393.01 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Yang B, Garcia-Molina H, Improving Search in Peer-to-peer Networks [ C ]//Distributed Computing Systems 2002 Proceedings 22nd International Conference on, Vienna : [ s. n ], 2002:5-14.
  • 2邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法[J].软件学报,2007,18(2):381-390. 被引量：41
  • 3Jinyang Li, Jeremy Stribling, Thomer M. Gil, et al. Comparing the Performance of Distributed Hash Tables Under Chum [ M ]. Springer Berlin/ Heidelberg:Lecture Notes in Computer Science,2005.
  • 4Krishnamurthy B. , Wang J. , Xie Y. L. Early Measurements of a Cluster-based Architecture for P2P Systems [ C]// Proc. of the 1st ACM SIGCOMM Internet Measurement Workshop, San Francisco: [ s. n], 2001:105-109.
  • 5Stoica I, Morris R, Karger D, et al. Chord: a Scalable Peer-to- peer Lookup Service for Internet Applications [ J ]. Computer Communication Review, 2001, 31 (4) :149-160.
  • 6Antony Rowstron, Peter Druschel. Pastry : Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-peer Systems [ C ]//Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg. Germany, 2001:69-91.
  • 7Petar Maymounkov, David Mazieres. Kademlia: A Peer-to-peer Information System Based on the XOR Metric [ C]// Proceedings of IPTPS02 ,Cam bridge: [ s. n] ,2002.
  • 8赵科军,刘洋,仇一鸿,王新军.基于异或运算对等网模型Kademlia研究[J].山东科学,2007,20(6):68-71. 被引量：5
  • 9丁艳艳,万振凯.基于对等网络的Kademlia搜索策略的研究[J].仪器仪表用户,2007,14(6):24-25. 被引量：3
  • 10Kong, Joseph S. , Bridgewater, et al. A General Framework for Scalability and Performance Analysis of DHT Routing Systems [ C ]// 2006 International Conference on Dependable Systems and Networks, Illinois,Chicago: [ s. n] , 2006:343-352.

二级参考文献28

  • 1Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content-addressable network.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.161-172.
  • 2Stoica I,Morris R,Karger D,Kaashoek MF,Balakrishnan H.Chord:A scalable peer-to-peer lookup protocol for Internet applications.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.149-160.
  • 3Rowstron A,Druschel P.Pastry:Scalable,decentralized object location and routing for large-scale peer-to-peer systems.In:Guerraoui R,ed.Proc.of the 18th IFIP/ACM Int'l Conf.on Distributed Systems Platforms (Middleware 2001).Heidelberg:Springer-Verlag,2001.329-350.
  • 4Zhao BY,Huang L,Stribling J,Rhea SC,Joseph AD,Kubiatowicz J.Tapestry:A resilient global-scale overlay for service deployment.IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
  • 5Malkhi D,Maor M,Ratajczak D.Viceroy:A scalable and dynamic emulation of butterfly.In:Ricciardi A,ed.Proc.of the 21st Annual Symp.on Principles of Distributed Computing.New York:ACM Press,2002.182-192.
  • 6Shen HY,Xu CZ,Ghen G.Cycloid:A constant-degree and lookup-efficient P2P overlay network.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 18th Int'l Parallel and Distributed Processing Symp.(IPDPS 2004).New York:IEEE Press,2004.26-30.
  • 7Xu Z,Tang C,Zhang Z.Building topology-aware overlays using global soft-state.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 23rd Int'l Conf.on Distributed Computing Systems (ICDCS 2003).New York:IEEE Press,2003.500-508.
  • 8Ratnasamy S,Handley M,Karp R,Shenker S.Topologically-Aware overlay construction and server selection.In:Proc.of the IEEE INFOCOM.New York:IEEE Press,2002.1190-1199.
  • 9Winter R,Zahn T,Schiller J.Random land-marking in mobile,topology-aware peer-to-peer networks.In:Proc.of the 10th IEEE Int'l Workshop on Future Trends of Distributed Computing Systems (FTDCS 2004).New York:IEEE Press,2004.319-324.
  • 10Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:some open questions.In:Druschel P,ed.Proc.of the 1st Int'l Workshop on P2P Systems (IPTPS 2002).Berlin:Springer-Verlag,2002.45-52.

共引文献46

西华大学学报（自然科学版）
2009年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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