Efficient triangulation for P2P networked virtual environments

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 con...

Full description

Saved in:
Bibliographic Details
Published inMultimedia tools and applications Vol. 45; no. 1-3; pp. 291 - 312
Main Authors Buyukkaya, Eliya, Abdallah, Maha
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.10.2009
Springer Nature B.V
Springer Verlag
SeriesSpecial Issue on Massively Multiplayer Online Games (MTAP-MMO)
Subjects
Algorithms
Computer Communication Networks
Computer Science
Connectivity
Data Structures and Information Theory
Hardware Architecture
Maintenance costs
Multimedia
Multimedia Information Systems
Other
Peer to peer computing
Peers
Performance evaluation
Servers
Special Purpose and Application-Based Systems
Studies
Virtual communities
Virtual networks
Delaunay triangulation
Peer-to-peer systems
Networked virtual environments
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-009-0301-0