GFRT-Chord: Flexible Structured Overlay Using Node Groups

被引:1
作者
Nagao, Hiroya [1 ]
Shudo, Kazuyuki [1 ]
机构
[1] Tokyo Inst Technol, Dept Math & Comp Sci, Tokyo, Japan
来源
2014 IEEE 11TH INTL CONF ON UBIQUITOUS INTELLIGENCE AND COMPUTING AND 2014 IEEE 11TH INTL CONF ON AUTONOMIC AND TRUSTED COMPUTING AND 2014 IEEE 14TH INTL CONF ON SCALABLE COMPUTING AND COMMUNICATIONS AND ITS ASSOCIATED WORKSHOPS | 2014年
关键词
structured overlay network; routing algorithm; peer-to-peer network;
D O I
10.1109/UIC-ATC-ScalCom.2014.69
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A fundamental problem in structured overlays is how to reflect the physical environment when nodes forward messages based on logical positions, independent of physical machines and physical network components. If the number of node groups that forward messages is reduced, costs are reduced for the entire network. However, when designing such an efficient algorithm, the characteristics of existing structured overlays, which makes routing inefficient in cases where there are too few nodes or too many entries in routing tables, prevents the use of the algorithm in practical applications. We propose GFRT-Chord, a routing algorithm for structured overlays based on the flexible routing tables (FRT) framework. GFRT-Chord provides a logarithmic path length in two typical network-growth models and forwarded messages never pass through a group more than once. We have evaluated GFRT-Chord with various pairs of parameters. Furthermore, we have implemented a naive grouped FRT-Chord, a simpler FRT-based algorithm than GFRT-Chord. We demonstrate that the performances of the naive grouped FRT-Chord is approximately the same as that of the GFRT-Chord; however there are specific pairs of network parameters and maximum routing table size that result in a path length that is significantly longer than that of the GFRT-Chord.
引用
收藏
页码:187 / 195
页数:9
相关论文
共 11 条
[1]  
Ando Y., 2014, P 2014 14 INT C PEER
[2]  
Freedman MJ, 2003, LECT NOTES COMPUT SC, V2735, P45
[3]  
Maymounkov P, 2002, LECT NOTES COMPUT SC, V2429, P53
[4]  
Miyao T., 2013, COMP COMM ISCC 2013
[5]  
Nagao H, 2011, IEEE INT CONF PEER, P72
[6]   A scalable Content-Addressable Network [J].
Ratnasamy, S ;
Francis, P ;
Handley, M ;
Karp, R ;
Shenker, S .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2001, 31 (04) :161-172
[7]  
Rowstron A., 2001, Proceedings of the Middleware 2001, P329, DOI DOI 10.1007/3-540-45518-3_18
[8]   Echo: A peer-to-peer clustering framework for improving communication in DHTs [J].
Sanchez-Artigas, Marc ;
Garcia Lopez, Pedro .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2010, 70 (02) :126-143
[9]   Chord: A scalable peer-to-peer lookup service for Internet applications [J].
Stoica, I ;
Morris, R ;
Karger, D ;
Kaashoek, MF ;
Balakrishnan, H .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2001, 31 (04) :149-160
[10]  
Zhang YM, 2008, IEEE INT CONF PEER, P109, DOI 10.1109/P2P.2008.43