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

基于多环结构的P2P覆盖网络路由算法

A Peer-to-Peer Overlay Network Routing Algorithm Based on Multiple Circle Topology
下载PDF
导出
摘要 P2P系统中采用的随机选择邻居节点的方法会降低路由效率以及增大网络开销.针对这一问题,在分析现有的路由算法的基础上,提出一种基于多环网络拓扑结构的P2P路由算法RMCT.该算法将P2P节点划分为若干簇并设立簇核节点进行管理.RMCT采用常数级别的路由表,设计了节点加入、退出算法以及簇的划分、簇核选举等算法.通过实验与经典Chord算法进行性能对比,证明了RMCT在路由性能方面有明显优势,是一种有效的路由算法. The routing algorithm of randomly selecting neighbor nodes is mostly used in P2P applications,which decreases the routing efficiency and increases the routing hops.To solve this problem,a new routing algorithm named RMCT based on multiple circle topology was presented.Nodes were dynamically divided into a number of clusters which used sub-supernodes to manage.A short routing table based on constant grade was defined.In RMCT,maintaining the route table for nodes entering/exiting were presented,as well as the clusters building method and distributed election algorithm for sub-supernodes.Compared to the performance of such typical algorithms as Chord,the RMCT algorithm greatly improved the performance in regard to routing table maintaining,routing hops,and network delay.Simulations and analysis results showed that the RMCT was an efficient routing algorithm though some problems were to be studied further.
作者 马毅 陈东明 常桂然 谭振华
机构地区 东北大学软件学院 东北大学计算中心
出处 《东北大学学报（自然科学版）》 EI CAS CSCD 北大核心 2013年第1期44-47,共4页 Journal of Northeastern University(Natural Science)
基金 辽宁省自然科学基金资助项目(20102059) 高等学校博士学科点专项科研基金资助项目(20110042120027) 中国博士后科学基金资助项目(2012M510826) 中央高校基本科研业务费专项资金资助项目(N110417006 N110204003)
关键词 P2P 多环结构 簇 路由算法 DHT peer-to-peer multiple circle topology cluster routing algorithm DHT（distributed Hash table）
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Jacky C, Kevin L, Neil L B. An evaluation of Chord using traces of peer-to-peer files sharing [ C ]//SIGMETRICS 2004/Performance 2004: Joint International Conference on Measurement and Modeling of Computer Systems. New York:Association for Computing Machinery Press, 2004:432 - 433.
  • 2Rowstron A, Druschel P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems[ J]. Lecture Notes in Computer Science,2001,2218:329 - 350.
  • 3Zhao B Y, Kubiatowicz J, Joseph A D. Tapestry: an infrastructure for fault-tolerant wide-area location and routing [ R ]. Berkeley : University of California,2001.
  • 4Ratnasamy S, Francis P,Handley M, et al. A scalable content- addressable network[ C]//Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: Association for Computing Machinery Press ,2001 : 161 - 172.
  • 5Jain S, Mahajan R, Wetherall D. A study of the performance potential of DHT-based overlays [ C ]//Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems ( USITS 2003 ). Berkeley: USENIX Association,2003 : 252 - 266.
  • 6胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报,2005,16(5):991-999. 被引量：14
  • 7Xiao W J,He M X, Liang H M. CayleyCCC: a robust P2P overlay network with simple routing and small-world features [J]. Journal of Networks,2011,6(9) :1247 - 1253.
  • 8Gupta A,Liskov B, Rodrigues R. One hop lookups for peer- to-peer overlays[ C ]//Proceedings of the 9th Workshop on Hot Topics in Operating Systems. Hawaii: USENIX Association,2003:6 - 12.
  • 9Joung Y J, Wang J C. Chord2: a two-layer Chord for reducing maintenance overhead via heterogeneity I J ]. Computer Networks,2007,51 (3) :712 -731.
  • 10Fan D M, Zhu Q. Research of adaptive routing method on PAP network [ J ]. International Journal of Digital Content Technology and Its Applications,2011,5 (4) : 296 - 301.

二级参考文献10

  • 1Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Berkeley: Computer Science Division, 2001.
  • 2Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proc. of the Int'l Conf. on Distributed Systems Platforms 2001. http://research.microsoft.com/～antr/Pastry/
  • 3Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proc. of the SIGCOMM 2001.2001. http://www.acm.org/sigs/sigcomm/sigcomm2001 /
  • 4Cox R, Muthitacharoen A, Morris R. Serving DNS using chord. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002.http://www.cs.rice.edu/Conferences/IPTPS02/
  • 5Jain S, Mahajan R, Wetherall D. A study of the performance potential of DHT-based overlays. In: Proc. of the 4th USENIX Symp.on Internet Technologies and Systems. 2003. http://www.usenix.org/events/usits03/
  • 6Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Workshop on Hot Topics in Operating Systems. 2003. http://www.usenix.org/events/hotos03/
  • 7Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proc .of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies 2003. http://www.ieee-infocom.org/2003/
  • 8Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 9Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 10Gupta I, Birman K, Linga P, Demers A, van Renesse R. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/

共引文献13

东北大学学报（自然科学版）
2013年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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