Multimedia Tools and Applications

, Volume 45, Issue 1–3, pp 291–312 | Cite as

Efficient triangulation for P2P networked virtual environments

  • Eliya BuyukkayaEmail author
  • Maha Abdallah


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.


Networked virtual environments Peer-to-peer systems Delaunay triangulation 


  1. 1.
    Aurenhammer F (1991) Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345–405. doi: 10.1145/116873.116880 CrossRefGoogle Scholar
  2. 2.
    Buyukkaya E, Abdallah M (2008) Data management in Voronoi-based P2P gaming. In: Proc. of IEEE CCNC Int. Workshop on Digital Entertainment, Networked Virtual Environments, and Creative Technology, pp 1050–1053Google Scholar
  3. 3.
    Castro M, Druschel P, Kermarrec A, Rowstron A (2002) SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE J Sel Areas Comm 20(8):1489–1499. doi: 10.1109/JSAC.2002.803069 CrossRefGoogle Scholar
  4. 4.
    de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (1997) Computational geometry, algorithms and applications. Springer-VerlagGoogle Scholar
  5. 5.
    Druschel P, Rowstron A (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of Middleware, pp 329–350Google Scholar
  6. 6.
    Frey D, Royan J, Piegay R, Kermarrec AM, Anceaume E, Le Fessant F (2008) Solipsis: a decentralized architecture for virtual environments. In: Proc. MMVE, pp 29–33Google Scholar
  7. 7.
    Hu SY, Liao GM (2004) Scalable peer-to-peer networked virtual environment. In: Proc. of NetGames, pp 129–133Google Scholar
  8. 8.
    Hu SY, Chen JF, Chen TH (2006) VON: a scalable peer-to-peer network for virtual environments. IEEE Netw 20(4):22–31. doi: 10.1109/MNET.2006.1668400 CrossRefGoogle Scholar
  9. 9.
    Hu SY, Chang SC, Jiang JR (2008) Voronoi state management for peer-to-peer massively multiplayer online games. In: Proc. of NIMEGoogle Scholar
  10. 10.
    Iimura T, Hazeyama H, Kadobayashi Y (2004) Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games. In: Proc. NetGames, pp 116–120Google Scholar
  11. 11.
    Jiang JR, Huang YL, Hu SY (2008) Scalable AOI-cast for peer-to-peer networked virtual environments. In: Proc. of ICDCSW CDSGoogle Scholar
  12. 12.
    Kawahara Y, Morikawa H, Aoyama T (2002) A peer-to-peer message exchange scheme for large scale networked virtual environments. In: Proc. of IEEE ICCS, pp 957–961Google Scholar
  13. 13.
    Keller J, Simon G (2003) Solipsis: a massively multi-participant virtual world. In: Proc. of PDPTA, pp 262–268Google Scholar
  14. 14.
    Knutsson B, Lu H, Xu W, Hopkins B (2004) Peer-to-peer support for massively multiplayer games. In: Proc. IEEE INFOCOM, pp 96–107Google Scholar
  15. 15.
    Liang H, Tay I, Neo MF, Ooi WT, Motani M (2008) Avatar mobility in networked virtual environments: measurements, analysis, and implications. CoRRGoogle Scholar
  16. 16.
    Varvello M, Biersack E, Diot C (2007) Dynamic clustering in Delaunay-based P2P networked virtual environments. In: Proc. of NetGames, pp 105–110Google Scholar
  17. 17.
  18. 18.
    Yu A, Vuong ST (2005) MOPAR: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games. In: Proc. of NOSSDAV, pp 99–104Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.LIP6, University of Paris 6ParisFrance

Personalised recommendations