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

一种基于Chord的缓存路由算法 被引量：1

A Cache Routing Algorithm Based on Chord
下载PDF
导出
摘要 根据small-world的研究发现,在实际的P2P拓扑结构中存在若干度数很高的节点。传统的Chord算法假定关键字的查询请求是随机分布的,没有考虑到节点之间的"短链"效应。提出一种基于Chord在一定程度上逐步找到系统节点的"短链"的方法。该方法根据关键字检索命中率动态调整路由表中记录的排序。仿真实验表明,该算法加快了关键字的查询时间,提高了路由表的查询效率。主要创新点在于针对实际P2P网络中查询请求的分布特性提出一种改进的Chord路由算法,该算法能有效改善系统的查询性能。 It exists some high degree node in actual P2P system from the study of small - world. Traditional Chord algorithm suppose that the searching requests distribute randomly and not consider the ＂shortcut＂ effect among nodes. This paper puts forword a kind of routing algorithm which can find ＂shortcut＂ in P2P system to a certain extent based on Chord. It sorts the routing table according to keywords hit rate dynamicaly. Simlation experiment indicate that the algorithm can accelerate the searching procedure and improve the performance of routing table. The main innovation of this paper is find an improvement Chord routing algorithm according to the searching requests feature in actual P2P system. This algorithm can improve the searching performance effectively in P2P system.
作者 刘焱旺 杨小军
机构地区 中国科学院西安光学精密机械研究所
出处 《现代电子技术》 2008年第23期133-134,138,共3页 Modern Electronics Technique
关键词 P2P DHT CHORD SMALL-WORLD 路由 短链 缓存 P2 P DHT Chord small - world route shortcut cache
分类号 TN915 [电子电信—通信与信息系统]
  • 相关文献

参考文献11

  • 1Rhea, Geels, Roscoe, et al. Handling Churn in a DHT, University of Califoria,Berkeley and In tel Reasearch[M]. Berkeley, 2003.
  • 2Stoica, Morris, Karger, et al. Chord: A Scalable Peer - to - Peer Lookup Service for Internet Applications. In the Proceedings of ACM SIGCOMM 2001,2001.
  • 3Rowstron, Druschel. Pastry: Sealable, Decentralized Object Location and Routing for Large - scale Peer -to - Peer Systems,2001.
  • 4Balakrishnan, Kaashoek, KargerMorris, et al. Looking up Data in P2P Systems. In Comunications of the ACM, 2003, 46(2).
  • 5Ramasubramanian, Sirer. Proaetive Caching for Better than Single -Hop Lookup Performance. Cornell University, Comouter Science Department Technical Report TR - 2004 - 1931,2004.
  • 6Gummadi K,Gummadi R,Gribble,et al. The Impact of DHT Routing Geometry on Resilience and Proximity. In Proceedings of ACM SIGCOMM,2003.
  • 7Watts D, Strogatz S. Collective Dynamics of "Small World" Networks. Nature 393,1998.
  • 8Brin S,Page L. The Anatomy of a Large - Scale Hypertex - tual Web Search Engin[ EB/OL]. http://google. stanford. edu/long321.htm.
  • 9丁丁.P2P网络中的DHT分布式哈希结构[EB/OL].http://blog.csdn.net/aqua_aqua/archive/2008/02/29/2133173
  • 10胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报,2005,16(5):991-999. 被引量：14

二级参考文献22

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

共引文献42

同被引文献6

引证文献1

现代电子技术
2008年 第23期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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