DocumentCode
3298232
Title
PChord: improvement on chord to achieve better routing efficiency by exploiting proximity
Author
Hong, Feng ; Li, Minglu ; Yu, Jiadi ; Wang, Yi
Author_Institution
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., China
fYear
2005
fDate
6-10 June 2005
Firstpage
806
Lastpage
811
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.
Keywords
Internet; peer-to-peer computing; telecommunication network routing; Internet; PChord; RDP; message routing; peer-to-peer overlay; proximity routing; simulation; Availability; Buildings; Chaos; Computer science; Delay; Internet; Large-scale systems; Measurement; Peer to peer computing; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems Workshops, 2005. 25th IEEE International Conference on
Print_ISBN
0-7695-2328-5
Type
conf
DOI
10.1109/ICDCSW.2005.108
Filename
1437265
Link To Document