An Effi cient Routing Algorithm of Koorde Based on Latency
Zhang Zhen-yu · Computer Knowledge and Technology · 2009
Koorde is a new distributed hash table(DHT). It maps nodes and data objects to a random ID. The choice of next hop is fi xed and determined only according to ID. Moreover, the latency is not considered in the routing. In this paper, a more effi cient routing approach is proposed in order to reduce the routing hops and the latency. The analysis shows that the approach proposed in this paper can signifi cantly reduce the routing hops and the latency, the routing performance of Koorde can be greatly improved.