STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping
IEEE Transactions on Knowledge and Data Engineering
Filter Trees for Managing Spatial Data over a Range of Size Granularities
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Accurate Estimation of the Cost of Spatial Selections
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Peer-to-Peer Spatial Queries in Sensor Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Range Addressable Network: A P2P Cache Architecture for Data Ranges
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
An efficient nearest neighbor algorithm for P2P settings
dg.o '05 Proceedings of the 2005 national conference on Digital government research
ASPEN: an adaptive spatial peer-to-peer network
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Building and Querying a P2P Virtual World
Geoinformatica
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable spatial information discovery over Distributed Hash Tables
Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE
Semantic information retrieval in the COMPASS location system
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
| Hi-index | 0.01 |
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interactivity for a large number of participants. Current solutions divide a large virtual-world into a few mutually exclusive zones, with each zone controlled by a different server, and/or limit the number of participants per server or per virtual-world. Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment (one peer is introduced to the system by each participant), however current P2P applications can only provide file sharing and other forms of relatively simple data communications. In this paper, we present a generic 3D virtual-world application that runs on a P2P network with no central administration or server. Two issues are addressed by this paper to enable such a spatial application on a P2P network. First, we demonstrate how to index and query a 3D space on a dynamic distributed network. Second, we show how to build such a complex application from the ground level of a P2P routing algorithm. Our work leads to new directions for the development of online virtual-worlds that we believe can be used for many government, industry, and public domain applications.