[1]陈刚,吴国新,杨望.G-Chord:一种基于Chord的路由改进算法[J].东南大学学报(自然科学版),2007,37(1):9-12.[doi:10.3969/j.issn.1001-0505.2007.01.003]
 Chen Gang,Wu Guoxin,Yang Wang.G-Chord: an improved routing algorithm for Chord[J].Journal of Southeast University (Natural Science Edition),2007,37(1):9-12.[doi:10.3969/j.issn.1001-0505.2007.01.003]
点击复制

G-Chord:一种基于Chord的路由改进算法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
37
期数:
2007年第1期
页码:
9-12
栏目:
计算机科学与工程
出版日期:
2007-01-20

文章信息/Info

Title:
G-Chord: an improved routing algorithm for Chord
作者:
陈刚 吴国新 杨望
东南大学计算机科学与工程学院, 南京 210096
Author(s):
Chen Gang Wu Guoxin Yang Wang
School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
关键词:
Chord 路由表长度 平均路径长度 分组
Keywords:
Chord routing table length average path length group
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2007.01.003
摘要:
提出了基于区域自治的G-Chord路由算法,将Chord环进行分组,实现组内节点的自治,组间的路由和查询操作则通过组代表帮助完成.仿真实验表明,新算法能够保持与Chord接近的平均跳数,而大部分节点的路由表长度却可以得到显著地减小(如Chord环被分为5组时路由表长度减少了31%).此外,分组虽然增加了网络直径,但这种请求极少(约为请求总数的0.28%),因此对总跳数的影响几乎可以忽略.
Abstract:
G-Chord is proposed to improve query efficiency with the Chord ring divided into several groups, each group being self-governed by its delegate. The requests, such as routing and query operations beyond their own groups,are completed by the aid of delegates. Simulation results show that the new algorithm can keep an average path length similar to Chord while the length of routing tables maintained by most nodes are reduced remarkably(the length is reduced by 31% when the Chord ring is divided into 5 groups). Besides, although grouping increases network diameter, the number of these kinds of requests are very small(about 0.28% of total requests number)and their effects on total hops could be ignored.

参考文献/References:

[1] Stoica I,Morris R,Karger D,et al.Chord:a scalable peer-to-peer lookup service for Internet applications [C] //Proc of ACM SIGCOMM 2001.New York,USA:ACM Press,2001:149-160.
[2] Ratnasanry S,Francis P,Handley M,et al.A scalable content-addressable network [C] //Proc of ACM SIGCOMM2001.New York,USA:ACM Press,2001:161-172.
[3] Druschel P,Rowstron A.Pastry:scalable,distributed object location and routing for large-scale peer-to-peer system [C] //Proc of the Middleware 2001.Heidelberg:Springer-Verlag,2001:329-350.
[4] Zhao B,Kubiatowicz J,Joseph A.Tapestry:an infrastructure for fault-tolerant wide-area location and routing [R].Berkeley:Computer Science Division,University of California,Tech Rep:UCB/CSD-01-1141,2001.
[5] Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:some open questions [C] //Proc of 1st International Workshop on Peer-to-Peer Systems.Berlin:Springer,2002:174-175.
[6] Xu J,Kumar A,Yu X X.On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks [J].IEEE Journal on Selected Areas in Communications,2004,22(1):151-163.
[7] Ganesan P,Manku G S.Optimal routing in Chord [C] //Proc of 15th Annual ACM-SIAM Symposium on Discrete Algorithms.Philadelphia,USA:Society for Industrial and Applied Mathematics,2004:176-185.
[8] Cordasco G,Sala A.2-Chord halved [C] //Proc of Second International Workshop on Hot Topics in Peer-to-Peer Systems.Washington DC,USA:IEEE Computer Society,2005:72-79.
[9] Malkhi D,Naor M,Ratajczak D.Viceroy:a scalable and dynamic emulation of the butterfly [C] //Proc of the 21st annual ACM Symposium on Principles of Distributed Computing.New York,USA:ACM Press,2002:183-192.

备注/Memo

备注/Memo:
作者简介: 陈刚(1978—),男,博士生; 吴国新(联系人),男,博士,教授,博士生导师, gwu@seu.edu.cn.
更新日期/Last Update: 2007-01-20