Non-uniform deterministic routing on F-Chord(/spl alpha/)

In this paper, we present a family of novel P2P routing schemes based on Chord (and its variation F-Chord(/spl alpha/) that trades off uniformity with efficiency without using any additional overhead. We prove that H-F-Chord(/spl alpha/)'s routing is more efficient than in F-Chord(/spl alpha/) in terms of its average path length that is O(log n/ log log n). We also show, by simulations, that H-F-Chord(/spl alpha/) is more efficient than the corresponding F-Chord(/spl alpha/) by a percentage that goes from 15% to 22% even for small n.