PChord: Improvement on Chord to achieve better routing efficiency by exploiting proximity

被引：5

作者：

Hong, F ^{[1
]}

Li, ML ^{[1
]}

Wu, MY ^{[1
]}

Yu, JD ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2006年 / E89D卷 / 02期

关键词：

peer-to-peer; routing; Chord; proximity routing; RDP;

D O I：

10.1093/ietisy/e89-d.2.546

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. A routing efficiency enhancement protocol on top of Chord is illustrated in this paper, which is called PChord. PChord aims to achieve better routing efficiency than Chord by exploiting proximity of the underlying network topology. The simulation shows that PChord has achieved lower RDP per message routing.

引用

页码：546 / 554

页数：9

共 12 条

[1] Castro M., 2002, MSRTR200282
[2] Distributed object location in a dynamic network
Hildrum, K
Kubiatowicz, JD
Rao, S
Zhao, BY
[J]. THEORY OF COMPUTING SYSTEMS, 2004, 37 (03) : 405 - 440
[3] Ratnasamy S, 2002, IEEE INFOCOM SER, P1190, DOI 10.1109/INFCOM.2002.1019369
[4] RATNASAMY S, 2001, P 2001 C APPL TECHN, P161, DOI DOI 10.1145/383059.383072
[5] RATNASAMY S, 2002, P 1 INT WORKSH PEER, P42
[6] REN S, 2004, IPDPS, P83
[7] Rowstron Antony, 2001, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, DOI [10.1007/3-540-45518-3_18, DOI 10.1007/3-540-45518-3_18]
[8] Chord: A scalable peer-to-peer lookup protocol for Internet applications
Stoica, I
Morris, R
Liben-Nowell, D
Karger, DR
Kaashoek, MF
Dabek, F
Balakrishnan, H
[J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (01) : 17 - 32
[9] STRIBLING J, 2003, UCBCSD031266
[10] WINTER R, 2004, P 3 INT C NETW ICN

← 1 2 →