Reconfiguration of Chord Ring Based on Communication Delay for Lookup Performance Improvement
Yuta Shimano, Fumiaki Sato · 2011
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 forwarded 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. In this paper, we propose a method to reduce the response time by the rearrangement and replacement of the node ID of the Chord. From the simulation results, it is shown that the response time of the proposed method reduced.