Share Email Print

Proceedings Paper

Research on the DHT algorithm chord
Author(s): Mei Yu; Zheng Zhao; Jian Yu; Jianrong Wang; Qingwei Shi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Chord which used in structured P2P network is a successful routing algorithm based on DHT (Distributed Hash Table). In Chord nodes locate along the Chord ring by being assigned the node identifiers and data store in corresponding nodes with key identifier. Finger table is built in each node and is maintained when nodes join and depart. The problems in Chord are unidirectional clockwise routing along ring and information redundancy in routing table. An improved method is presented which is bidirectional routing table. Routing can perform along clockwise and anticlockwise according to the locations of the current node and destination node. The next hop direction is optimization that the next node is the nearest one apart from the destination node. This strategy limits the search area in half-ring, reduces the average hops and enhances the search efficiency. The redundancy routing information is deleted in order to decrease the added storage space in bidirectional routing table, thus the items share the routing information.

Paper Details

Date Published: 10 September 2007
PDF: 8 pages
Proc. SPIE 6773, Next-Generation Communication and Sensor Networks 2007, 67730Q (10 September 2007); doi: 10.1117/12.752083
Show Author Affiliations
Mei Yu, Tianjin Univ. (China)
Zheng Zhao, Tianjin Univ. (China)
Jian Yu, Tianjin Univ. (China)
Jianrong Wang, Tianjin Univ. (China)
Qingwei Shi, Tianjin Univ. (China)

Published in SPIE Proceedings Vol. 6773:
Next-Generation Communication and Sensor Networks 2007
Sergey I. Balandin, Editor(s)

© SPIE. Terms of Use
Back to Top