DocumentCode
2022053
Title
A Walkable Kademlia Network for Virtual Worlds
Author
Varvello, Matteo ; Diot, Christophe ; Biersack, Ernst
Author_Institution
Thomson, Paris
fYear
2009
fDate
19-25 April 2009
Firstpage
1
Lastpage
2
Abstract
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.
Keywords
peer-to-peer computing; tree data structures; Gray Code; P2P architecture; Walkad; range queries; reverse binary trie; tree-based data structure; virtual worlds; Avatars; Content based retrieval; Costs; Delay; Eyes; Hamming distance; Peer to peer computing; Reflective binary codes; Scalability; Second Life;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM Workshops 2009, IEEE
Conference_Location
Rio de Janeiro
Print_ISBN
978-1-4244-3968-3
Type
conf
DOI
10.1109/INFCOMW.2009.5072106
Filename
5072106
Link To Document