A Walkable Kademlia Network for Virtual Worlds
Matteo Varvello, Christophe Diot, Ernst W. Biersack · 2009
In this work, we design and evaluate Walkad, a P2P architecture for the management of range queries in virtual worlds. We design Walkad as an extension of Kademlia, a very popular DHT successfully adopted in eMule. Walkad organizes the Kademlia keyspace in a reverse binary trie, i.e., a tree-based data structure where nodes of each level of the tree are labeled using the Gray Code.