Chord路由算法的改进

作者：孙道平，王于同 日期：2007-12-28/span> 浏览：4170 查看PDF文档

Chord路由算法的改进
孙道平，王于同
(杭州电子科技大学 计算机学院，浙江 杭州 310018)

摘 要：资源的定位是点对点（P2P）系统的关键技术之一。Chord提供了一种有效的路由算法。算法的性能很大程度上取决于用于路由的finger table。Finger table提供了大量其他节点的信息以加快搜索速度。但是在原协议中，它的表项冗余严重，关于其他节点的有效信息相应减少；同时，被finger table保存信息的节点之间的距离不断增大，使搜索的稳定性不够。在此基础上提出了一种对Chord路由的改进算法，极大地降低了路由表的冗余，同时又使其搜索的稳定性有很大提高。
关键词：Chord; 定位；路由；搜索

Improvement of Chord routing algorithm
SUN Daoping, WANG Yutong
（College of Computer, Hangzhou Dianzi University, Hangzhou 310018, China）

Abstract: Routing is one of essential technology in P2P applications. An effective routing algorithm was provided in Chord. The character of the algorithm was mostly lie on finger table which was used to route. Finger table provided lots of information about other peers to quicken routing. But in the original protocol, the finger table had a terrible problem of information redundancy which decreased effective information. Also distances between peers whose information was stored in the finger table increased gradually which made the query length unstable. A method was proposed to reduce redundancy and improve query stability.
Key words: Chord; location; routing; search

参考文献(Reference)：
［1］STOICA I, MORRIS R, KARGER D, et al. Chord: A Scalable PeertoPeer Lookup Service for Internet Application［C］. Proceedings of the 2001 ACM SIGCOMM Conference, 2001:149-160.
［2］RATNASAMY S, FRANCIS P, HANDLEY M, et al. A Scalable Contentaddressable Network［C］. Proc. of the 2001 ACM SIGCOMM,2001:161-172.
［3］胡志刚,谭树斐,桂卫华,等.一种基于Chord的网格资源定位方法［J］.中南大学学报:自然科学版,2005,36(3):465-469.
［4］张 浩,金 海,聂江武,等.DualChord:一种更加有效的分布式哈希表［J］.小型微型计算机系统,2006,27（8）：1450-1454.
［5］张 亮,邹福泰,马范援.Chord协议的最优路由表结构［J］.上海交通大学学报,2005,39(8):1276-1279.
［6］郑明华,李 青.基于Chord协议的网格服务管理方法［J］.计算机应用,2006,26(6):282-284.