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.
A walkable kademlia network for virtual worlds
INFOCOM 2009, 28th IEEE Conference on Computer Communications, April 19-25, 2009, Rio de Janeiro, Brazil
Rio de Janeiro
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/2684