| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2010: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
|
|---|
| Research Abstract |
Information lookup systems using Distributed Hash Table (DHT) have been actively studied. In the Chord DHT, nodes are con-figured 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. From the simulation results, it is shown that the response time of the proposed method has approached an ideal value.
|
