电信科学 ›› 2010, Vol. 26 ›› Issue (10): 71-79.doi: 10.3969/j.issn.1000-0801.2010.10.019

• 研究与开发 • 上一篇    下一篇

非对称双向Base-k Chord

严华云1,2,关估红2,詹卫华2,蒋云良1   

  1. 1 湖州师范学院信息与工程学院 湖州313000
    2 同济大学电子与信息工程学院 上海201804
  • 出版日期:2010-10-15 发布日期:2010-10-15
  • 基金资助:
    国家自然科学基金资助项目;浙江省自然科学基金资助杰出青年团队项目;浙江省自然科学基金资助项目;湖州市科技攻关项目

An Asymmetrically Bidirectional Base-k Chord

Huayun Yan1,2,Jihong Guan2,Weihua Zhan2,Yunliang Jiang1   

  1. 1 School of Information&Engineering,Huzhou Teachers College,Huzhou 313000,China
    2 College of Electronics&Information Engineering,Tongji University,Shanghai 201804,China
  • Online:2010-10-15 Published:2010-10-15

摘要:

针对Base-k Chord 的路由效率问题,本文对其finger 表做出了非对称双向调整,即将其finger 表奇数项保留为正向finger,偶数项finger对折到反向作为反向finger,调整后的finger表的大小不变。在此基础上提出了改进的路由算法,该算法每次选择离目标节点最近的finger进行路由。为了证明本文方法比2-Chord的对称双向finger方法更好,将2-Chord 扩展成对称双向Base-k Chord,并与之进行了性能比较。实验分析发现,对称双向Base-k Chord 的路由效率提升极小,非对称双向Base-k Chord有效地降低了平均路由跳数。

关键词: peer-to-peer, chord;finger表, 路由算法

Abstract:

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.

Key words: peer-to-peer, Chord,finger table, routing algorithm

No Suggested Reading articles found!