DocumentCode :
3288652
Title :
An Improved Lookup Algorithm for Chord
Author :
Cheng, Yinbo ; Wen, Xiangming ; Zheng, Wei
Author_Institution :
Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear :
2009
fDate :
16-17 May 2009
Firstpage :
163
Lastpage :
166
Abstract :
The critical issue that confronts peer-to-peer networks is the efficient location of the node that stores a desired data item. Chord is a successful resource location protocol based on distributed hash table. However, if the desired data item is stored on a node that is count-clockwise close to the query node on the chord ring, the lookup latency might be high because of its clockwise lookup strategy. We optimize the lookup algorithm to reduce routing latency and present a bidirectional parallel lookup strategy for chord (BP-Chord). Simulation results show that BP-Chord can improve lookup performance.
Keywords :
peer-to-peer computing; protocols; BP-Chord; bidirectional parallel lookup strategy; chord ring; clockwise lookup strategy; distributed hash table; lookup algorithm; peer-to-peer networks; resource location protocol; Circuits; Clocks; Data engineering; Delay; Fingers; Intrusion detection; Peer to peer computing; Protocols; Routing; Scalability; Chord; P2P; bidirectional parallel lookup; lookup algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits, Communications and Systems, 2009. PACCS '09. Pacific-Asia Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-0-7695-3614-9
Type :
conf
DOI :
10.1109/PACCS.2009.122
Filename :
5232312
Link To Document :
بازگشت