10 September 2007 Research on the DHT algorithm chord
Author Affiliations +
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mei Yu, Mei Yu, Zheng Zhao, Zheng Zhao, Jian Yu, Jian Yu, Jianrong Wang, Jianrong Wang, Qingwei Shi, Qingwei Shi, "Research on the DHT algorithm chord", Proc. SPIE 6773, Next-Generation Communication and Sensor Networks 2007, 67730Q (10 September 2007); doi: 10.1117/12.752083; https://doi.org/10.1117/12.752083


Comparative measurement of QoS on the trans-Pacific Internet
Proceedings of SPIE (December 15 1998)
A comparison of a Radix 2 and a Radix 5...
Proceedings of SPIE (September 04 2008)
A tree index routing structure in a peer to peer...
Proceedings of SPIE (September 09 2007)
Wireless nanosensor network system
Proceedings of SPIE (March 31 2009)

Back to Top