PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity

Authors:
Feng Hong;Minglu Li;Minyou Wu;Jiadi Yu
Affiliations:
The authors are with the Department of Computer Science & Engineering, Shanghai Jiao Tong University, 200240 China. E-mail: hongfeng@cs.sjtu.edu.cn;The authors are with the Department of Computer Science & Engineering, Shanghai Jiao Tong University, 200240 China. E-mail: hongfeng@cs.sjtu.edu.cn;The authors are with the Department of Computer Science & Engineering, Shanghai Jiao Tong University, 200240 China. E-mail: hongfeng@cs.sjtu.edu.cn;The authors are with the Department of Computer Science & Engineering, Shanghai Jiao Tong University, 200240 China. E-mail: hongfeng@cs.sjtu.edu.cn
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 2

CNP: A Protocol for Reducing Maintenance Cost of Structured P2P

ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
TB_Chord: an improved routing algorithm to chord based on topology-aware and bi-dimensional lookup method

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.