Extended Fibonacci distances for fault-tolerant routing in Chord-like DHTs

Fibonacci distances have already proved to be optimal [G. Cordasco et al. (2004)] for constructing the so called "finger list" in Chord-like [I. Stoica et al. (2001)] distributed hash table routing by reducing the average number of hops compared to the original finger list based on exponentially increasing distances. In this paper we propose a generalization of this technique and, by means of simulation, prove that further enlargement of finger tables can substantially improve performance, even in case of failure of a small fraction of the available peers.