Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm, Sarunas Girdzijauskas
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...
2007