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

Authors:
Feng Hong;Minglu Li;Jiadi Yu;Yi Wang
Affiliations:
Shanghai Jiao Tong University;Shanghai Jiao Tong University;Shanghai Jiao Tong University;Shanghai Jiao Tong University
Venue:
ICDCSW '05 Proceedings of the First International Workshop on Mobility in Peer-to-Peer Systems - Volume 08
Year:
2005

Citing 0
Cited 4

Improving Chord Network Performance Using Geographic Coordinates

GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks
EPDKS: an efficient proximity-based distributed K-ary structured overlay network

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Researches on secure proximity distance defending attack of finger table based on chord

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Realization of topology awareness in peer-to-peer wireless network

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 peer-to-peer overlay, called PChord is illustrated in this paper which focuses on achieving better routing efficiency. PChord is constructed on the basis of Chord which exploits proximity of the underly Internet by combining proximity routing into its routing scheme. The simulation shows that PChord has achieved lower RDP per message routing.