Gambling heuristic on a chord ring

Chord routing is greedy and non-symmetric, and is based on a skiplist-like data structure, whose entries are known as fingers. This work explores the benefits arising from a modified greedy lookup strategy that, without introducing any additional communication overhead, simply exploits the implicit symmetry knowledge intrinsic to the highly structured Chord ring. Through extensive simulation on a dynamic peer environment, we show a practical and feasible solution that actually boosts DHT lookup performance under a wide range of scenarios.