Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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
Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games
Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games
Scalable peer-to-peer networked virtual environment
Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
A peer-to-peer message exchange scheme for large scale networked virtual environments
ICCS '02 Proceedings of the The 8th International Conference on Communication Systems - Volume 02
Dynamic clustering in delaunay-based P2P networked virtual environments
Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games
Scalable AOI-Cast for Peer-to-Peer Networked Virtual Environments
ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
VON: a scalable peer-to-peer network for virtual environments
IEEE Network: The Magazine of Global Internetworking
International Journal of Advanced Media and Communication
Evaluating compass routing based AOI-cast by MOGs mobility models
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
A flexible connectivity architecture for avatar management in P2P virtual environments
Proceedings of the 10th Annual Workshop on Network and Systems Support for Games
| Hi-index | 0.00 |
Peer-to-peer (P2P) architectures have recently become a popular design choice for building scalable Networked Virtual Environments (NVEs). In P2P-based NVEs, system and data management is distributed among all participating users. Towards this end, a Delaunay Triangulation can be used to provide connectivity between the different NVE users depending on their positions in the virtual world. However, a Delaunay Triangulation clearly suffers from high maintenance cost as it is subject to high connection change rate due to continuous users' movement. In this paper, we propose a new triangulation algorithm that provides network connectivity to support P2P NVEs while dramatically decreasing maintenance overhead by reducing the number of connection changes due to users' insertion and movement. Performance evaluations show that our solution drastically reduces overlay maintenance cost in highly dynamic NVEs. More importantly, and beyond its quantitative advantages, this work questions the well accepted Delaunay Triangulation as a reference means for providing connectivity in NVEs, and paves the way for more research towards more practical alternatives for NVE applications.