Efficient triangulation for P2P networked virtual environments

Eliya Buyukkaya 1, * Maha Abdallah 1
* Corresponding author
1 MALIRE - Machine Learning and Information Retrieval
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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 a high maintenance cost as it is subject to high connection change rate due to continuous users' movement. In this paper, we propose a new variant to the Delaunay 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00589736
Contributor : Eliya Buyukkaya <>
Submitted on : Sunday, May 1, 2011 - 2:35:00 PM
Last modification on : Thursday, March 21, 2019 - 2:40:55 PM
Long-term archiving on : Tuesday, August 2, 2011 - 2:26:29 AM

File

netgames08-final30.pdf
Files produced by the author(s)

Identifiers

Citation

Eliya Buyukkaya, Maha Abdallah. Efficient triangulation for P2P networked virtual environments. 7th ACM SIGCOMM Workshop on Network and System Support for Games, Oct 2008, Worcester, Massachusetts, United States. pp.34-39, ⟨10.1145/1517494.1517501⟩. ⟨hal-00589736⟩

Share

Metrics

Record views

259

Files downloads

258