非对称双向Base-k Chord  

An Asymmetrically Bidirectional Base-k Chord

作　　者：严华云[1,2] 关佶红[1] 詹卫华[1] 蒋云良[2] 

机构地区：[1]同济大学电子与信息工程学院,上海201804 [2]湖州师范学院信息与工程学院,湖州313000

出　　处：《电信科学》2010年第10期71-79,共9页Telecommunications Science

基　　金：国家自然科学基金资助项目(No.60573183;No.60872057;No.60803053);浙江省自然科学基金资助杰出青年团队项目(No.R1090244);浙江省自然科学基金资助项目(No.Y107293;No.Y1080212);浙江省科技计划项目(No.2008C21083);湖州市科技攻关项目(No.2008GG11)

摘　　要：针对Base-k Chord的路由效率问题,本文对其finger表做出了非对称双向调整,即将其finger表奇数项保留为正向finger,偶数项finger对折到反向作为反向finger,调整后的finger表的大小不变。在此基础上提出了改进的路由算法,该算法每次选择离目标节点最近的finger进行路由。为了证明本文方法比2-Chord的对称双向finger方法更好,将2-Chord扩展成对称双向Base-k Chord,并与之进行了性能比较。实验分析发现,对称双向Base-k Chord的路由效率提升极小,非对称双向Base-kChord有效地降低了平均路由跳数。To improve the routing efficiency of Base-k Chord,this paper proposes a new finger table for Base-k Chord by using an asymmetrically bidirectional structure.Concretely,keeping the odd items in the finger table unchanged,while re-directing the even items,which does not change the size of the finger table.A routing algorithm for this new Chord structure is developed, which can always chooses the next finger for routing that is nearest to the destination node.For performance comparison,the 2-Chord is extended to symmetrically bidirectional Chord.Experimental results show that the routing efficiency of symmetrically bidirectional Chord archives no much improvement in performance,while the proposed asymmetrically bidirectional Base-k Chord outperforms its counterparts.

关 键 词：PEER-TO-PEER CHORD finger表 路由算法 

分 类 号：TP302.1[自动化与计算机技术—计算机系统结构]