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

基于自组织聚类的Kademlia改进模型

Improvement of Kademlia Based on Self-organized Clustering
下载PDF
导出
摘要 针对结构化P2P网络因忽略逻辑拓扑与物理拓扑差异而导致的路由绕路问题,首先提出一种聚类算法,将物理位置紧邻的节点自组织为若干分布式聚类;然后以聚类为单位设计了关联节点物理拓扑相邻性和逻辑拓扑相邻性的节点标识方法,并且利用该方法改进了传统Kademlia模型;最后对改进模型的性能进行了理论分析和实验测试.结果表明,改进模型通过增强每一跳路由在物理拓扑中的合理性,达到了避免路由绕路的目的,路由算法性能较传统模型提升近15%. This paper focuses on the detouring problem caused by ignorance of difference between logical topology and physical topology in structured P2P networks.Firstly,a distributed clustering algorithm is proposed to classify the nodes into several self-organized clusters.And then,a technique relating the physical vicinity and the logical vicinity is designed to improve the traditional Kademlia routing model.Finally,the performance of the improved model is analyzed theoretically and experimentally.The results verify that the improved model solve the detouring problem by improving the rationality of every hop in physical topology and the efficiency of routing algorithm is improved more than 15 percent.
作者 徐强 孙乐昌 周灏淼
机构地区 解放军电子工程学院网络工程系
出处 《小型微型计算机系统》 CSCD 北大核心 2010年第8期1549-1553,共5页 Journal of Chinese Computer Systems
基金 军队国防科技研究项目资助
关键词 P2P 路由绕路 物理拓扑 自组织聚类 KADEMLIA P2P detouring physical topology self-organized clustering kademlia
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1Zhao B Y, Duan Y, Huang L, et al. Brocade:landmark routing on overlay networks[A]. Proceedings of the 1st Int'l Workshop on Peer-to-Peer Systems[C] ,Berlin: Springer-Verlag, 2002.
  • 2Ratnasamy S, Handley M, Karp R,et al. Topologically-aware overlay construction and server sclection [C]. Proceedings of the IEEE INFOCOM Conference, New York: IEEE, 2002,1190-1199.
  • 3刘业,杨鹏.基于自组织聚类的结构化P2P语义路由改进算法[J].软件学报,2006,17(2):339-348. 被引量：17
  • 4Ratnasamy S, Francis P, Handly M, et al. A scalable content-addrcssable network[C]. Proceedings of ACM SIGCOMM, San Diego: ACM Press, 2001,161-172.
  • 5Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to- peer lookup service for interact application [ A ]. Proceedings of ACM SIGCOMM[ C], New York: ACM Press, 2001. 149-160.
  • 6Zhao B Y, Kubiatowicz J, Joseph A D. Tapestry: an infrastructure for fault-tolerant wide-area location and routing[ R]. Technical Report No. UCB/CSD-01-1141, Computer Science Division ( EECS), University of California Berkley, USA, 2001.
  • 7Maymounkov P, Mazieres D. Kademlia: a peer-to-peer information system based on the XOR metric[J]. Peer-to-Peer Systems, 2002, 2429:53-69.
  • 8The P2PSim project [ EB/OL]. http://pdos. esail. mit. edu/ p2psim/, July, 2008.
  • 9Krishna P G, Stefan S, St.even D G. King:estimating latency between arbitrary Internet end hosts [ C ]. Proceedings of the 2nd ACM SIGCOMM Workshop on lnternet Measurement, Marseille, France, November 06-08, 2002.

二级参考文献9

  • 1Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:Some open questions.In:Druschel P,Kaashoek M,Rowstron A,eds.Proc.of the 1 st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002).Berlin:Springer-Verlag,2002.174-179.
  • 2Zhao BY,Duan Y,Huang L,Joseph AD,Kubiatowicz JD.Brocade:Landmark routing on overlay networks.In:Druschel P,Kaashoek M,Rowstron A,eds.Proc.of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002).Berlin:Springer-Verlag,2002.
  • 3Krishnamurthy B,Wang J,Xie YL.Early Measurements of a cluster-based architecture for P2P systems.In:Proc.of the ACM SIGCOMM Internet Measurement Workshop.New York:ACM Press,2001.105-109.http://www.imconf.net/imw-2001/proceedings.htm
  • 4Ratnasamy S,Handley M,Karp R,Shenker S.Topologically-Aware overlay construction and server selection.In:Proc.of the IEEE INFOCOM Conf.New York:Institute of Electrical and Electronics Engineers,Inc.,2002.1190-1199.http://www.icir.org/sylvia/
  • 5Stoica I,Morris R,Karger D,Kaashoek MF,Balakrishnan H.Chord:A scalable peer-to-peer lookup service for Internet applications.In:Proc.of the ACM SIGCOMM 2001 Conf.New York:ACM Press,2001.149-160.http://www.acm.org/sigs/sigcomm/sigcomm2001/
  • 6Rowstron A,Druschel P.Pastry:Scalable,distributed object location and routing for largescale peer-to-peer systems.In:Guerraoui R,ed.Proc.of the 18th IFIP/ACM Int'l Conf.on Distributed Systems Platforms (Middleware 2001).Berlin:Springer-Verlag,2001.329-350.
  • 7Malkhi D,Naor M,Ratajczak D.Viceroy:A scalable and dynamic emulation of the butterfly.In:Proc.of the 21st annual ACM Symp.on Principles of Distributed Computing.New York:ACM Press,2002.183-192.http://www.podc.org/podc2002/
  • 8Wang YB,Xue T.Applied Cryptography.Beijing:China Machine Press,2003.135-151.
  • 9Zegura EW,Calvert KL,Bhattacharjee S.How to model an internetwork.In:Proc.of the INFOCOM'96.New York:Institute of Electrical and Electronics Engineers,Inc.,1996.594-602.http://www.cc.gatech.edu/fac/Ellen.Zegura/pubsl.html

共引文献16

小型微型计算机系统
2010年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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