Name
Abstract | ||
|---|---|---|
Virtual worlds are digitalizations of the real world where users can live a virtual life. Commercial virtual worlds rely on a Client/Server architecture, which has serious scalability limitations. Peer-to-Peer (P2P) and Distributed Hash Tables (DHTs) are a cheap and scalable alternative to a Client/Server approach. However, current DHT designs are not flexible enough to support such complex applications. We introduce Walkad, a Kademlia extension specifically designed to efficiently manage virtual worlds. The Walkad design leverages on the Kademlia DHT and on a novel indexing algorithm based on a reverse binary trie. We evaluate Walkad via emulation, and using traces extracted from Second Life. Our preliminary results show that Walkad is an efficient P2P design for virtual worlds. Walkad guarantees to its users a fast discovery of the virtual world, while load balancing the virtual land responsibilities among peers. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/INFCOMW.2009.5072106 | IPTPS |
Keywords | Field | DocType |
computer architecture,data structure,tree data structures,p2p,scalability,routing,hamming distance,range queries,virtual worlds,servers,range query,gray code | Metaverse,Computer science,Load balancing (computing),Search engine indexing,Computer network,Emulation,Kademlia,Trie,Distributed computing,Hash table,Scalability | Conference |
Citations | PageRank | References |
7 | 0.48 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matteo Varvello | 1 | 797 | 48.31 |
| Christophe Diot | 2 | 7831 | 590.69 |
| Ernst Biersack | 3 | 2176 | 220.80 |