首页 | 本学科首页   官方微博 | 高级检索  
     

Chord路由算法的改进
引用本文:孙道平,王于同.Chord路由算法的改进[J].机电工程,2007,24(12):92-95.
作者姓名:孙道平  王于同
作者单位:杭州电子科技大学,计算机学院,浙江,杭州,310018
摘    要:资源的定位是点对点(P2P)系统的关键技术之一。Chord提供了一种有效的路由算法。算法的性能很大程度上取决于用于路由的fingertable。Fingertable提供了大量其他节点的信息以加快搜索速度。但是在原协议中,它的表项冗余严重,关于其他节点的有效信息相应减少;同时,被fingertable保存信息的节点之间的距离不断增大,使搜索的稳定性不够。在此基础上提出了一种对Chord路由的改进算法,极大地降低了路由表的冗余,同时叉使其搜索的稳定性有很大提高。

关 键 词:Chord  定位  路由  搜索
文章编号:1001-4551(2007)12-0092-04
收稿时间:2007-06-11
修稿时间:2007年6月11日

Improvement of Chord routing algorithm
SUN Dao-ping,WANG Yu-tong.Improvement of Chord routing algorithm[J].Mechanical & Electrical Engineering Magazine,2007,24(12):92-95.
Authors:SUN Dao-ping  WANG Yu-tong
Affiliation:SUN Dao-ping, WANG Yu-tong ( 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.
Keywords:Chord  location  routing  search
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号