The Community for Technology Leaders
2012 15th International Conference on Network-Based Information Systems (2012)
Melbourne, Australia Australia
Sept. 26, 2012 to Sept. 28, 2012
ISBN: 978-1-4673-2331-4
pp: 66-73
The notion of a decentralized lookup service is very useful for many distributed applications. Information lookup systems using Distributed Hash Table (DHT) have been actively studied. In the Chord DHT, nodes are configured as a ring structure and lookup requests are for-warded along with the ring. In order to get information efficiently, response time should be short. However, since Chord overlay network is constructed without considering the real network, the efficient lookup cannot be done. We have studied a method to reduce the response time by the rearrangement and replacement of the node ID of the Chord. Though our previous work improved the lookup performance, the reconfigured ring fell in the local minimum and did not become appropriate ring. In this paper, we propose the reconfiguration method based on the Finger Table of Chord. The candidate node of ID exchange is selected from the Finger Table. From the simulation results, it is shown that the response time of the proposed method has approached an ideal value.
Peer to peer computing, Delay, Fingers, IP networks, Routing, Time factors, Lookup Performance, Peer to Peer, Distributed Hash Table, Chord

Y. Shimano and F. Sato, "Dynamic Reconfiguration of Chord Ring Based on Physical Network and Finger Table Information," 2012 15th International Conference on Network-Based Information Systems(NBIS), Melbourne, Australia Australia, 2012, pp. 66-73.
96 ms
(Ver 3.3 (11022016))