IEICE TRANSACTIONS on Information
PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E89-D No.2 pp.546-554
- Publication Date
- 2006/02/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e89-d.2.546
- Type of Manuscript
- Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking)
- Category
- Peer-to-Peer Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Feng HONG, Minglu LI, Minyou WU, Jiadi YU, "PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 2, pp. 546-554, February 2006, doi: 10.1093/ietisy/e89-d.2.546.
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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.2.546/_p
Copy
@ARTICLE{e89-d_2_546,
author={Feng HONG, Minglu LI, Minyou WU, Jiadi YU, },
journal={IEICE TRANSACTIONS on Information},
title={PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity},
year={2006},
volume={E89-D},
number={2},
pages={546-554},
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.},
keywords={},
doi={10.1093/ietisy/e89-d.2.546},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity
T2 - IEICE TRANSACTIONS on Information
SP - 546
EP - 554
AU - Feng HONG
AU - Minglu LI
AU - Minyou WU
AU - Jiadi YU
PY - 2006
DO - 10.1093/ietisy/e89-d.2.546
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2006
AB - 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.
ER -
English
