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

一种基于时延的高效Koorde路由算法

An Effi cient Routing Algorithm of Koorde Based on Latency
下载PDF
导出
摘要 Koorde是一种新型的分布式哈希表(DHT),它将网络结点和数据对象映射到与自身属性无关的的ID,并根据ID来选择下一跳。它的下一跳是确定的,而且没有考虑网络时延的因素。本文从减少路由跳数和降低网络时延两个方面来对原路由协议进行改进,进而实现了一种更加高效的koorde路由。性能分析表明,跳数差和时延差两项指标显示出改进后的路由机制能够较好地提高路由效率。 Koorde is a new distributed hash table(DHT). It maps nodes and data objects to a random ID. The choice of next hop is fi xed and determined only according to ID. Moreover, the latency is not considered in the routing. In this paper, a more effi cient routing approach is proposed in order to reduce the routing hops and the latency. The analysis shows that the approach proposed in this paper can signifi cantly reduce the routing hops and the latency, the routing performance of Koorde can be greatly improved.
作者 刘峰 张振宇
机构地区 新疆大学信息科学与工程学院
出处 《电脑知识与技术》 2009年第3X期2364-2365,共2页 Computer Knowledge and Technology
关键词 debruijn图 Koorde 路由跳数 时延 de bruijn graph Koorde routing hops latency
分类号 TP393.02 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法[J].软件学报,2007,18(2):381-390. 被引量：41
  • 2Gnutella,2004.
  • 3Kaashoek F,Karger D R.Koorde:A simple degree-optimal hash table[].Procnd International Workshop on peer-to-peer systems.2003
  • 4Schlumberger M L.Proposed de bruijn Graph as a Commucation Network[]..1974
  • 5Ratnasamy S,Francis P,Handley M,et al.A Scalable Content-Addressable Network[].Proceedings of the Conference on Applications Technologies Architectures and Protocols for Computer Communications.2001
  • 6Ion Stoica,Robert Morris,David Liben-Nowell,David R Karger,M. Frans Kaashoek,Frank Dabek,and Hari Balakrishnan.Chord: a scalable peer-to-peer lookup protocol for internet applications[].IEEE ACM Transactions on Networking.2003
  • 7Ben Y Zhao,Ling Huang,Jeremy Stribling,Sean C. Rhea,Anthony D. Joseph,and John D. Kubiatowicz.Tapestry: A resilient global-scale overlay for service deployment[].IEEE Journal on Selected Areas in Communications.2004
  • 8Imase,M.,Itoh,M.A design for directed graphs with minimum diameter[].IEEE Transactions on Communications.1983
  • 9Sivarajan,K.,Ramaswami,R.Lightwave networks based on de Bruijn graphs[].IEEE/ACM Trans Netw (TON).1994

二级参考文献18

  • 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.

共引文献40

电脑知识与技术
2009年 第3X期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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