A Parallel Interest Matching Algorithm for Distributed-Memory Systems

As the scale of Distributed Virtual Environments (DVEs) grows in terms of participants and virtual entities, using interest management schemes to reduce bandwidth consumption becomes increasingly common for DVE development. The interest matching process is essential for most of the interest management schemes which determines what data should be sent to the participants as well as what data should be filtered. However, if the computational overhead of interest matching is too high, it would be unsuitable for real-time DVEs for which runtime performance is important. This paper presents a new approach of interest matching which divides the workload of matching process among a cluster of computers. Experimental evidence shows that our approach is an effective solution for the real-time applications.

[1]  Elvis S. Liu,et al.  An Approach for Parallel Interest Matching in Distributed Virtual Environments , 2009, 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications.

[2]  Michael Zyda,et al.  Three-tiered interest management for large-scale virtual environments , 1998, VRST '98.

[3]  T. Kaukoranta,et al.  A Review on Networking and Multiplayer Computer Games , 2002 .

[4]  Christer Carlsson,et al.  DIVE - A platform for multi-user virtual environments , 1993, Comput. Graph..

[5]  Anthony Steed,et al.  Partitioning crowded virtual environments , 2003, VRST '03.

[6]  Shun-Yun Hu,et al.  VON: a scalable peer-to-peer network for virtual environments , 2006, IEEE Network.

[7]  Richard M. Fujimoto,et al.  Parallel and Distribution Simulation Systems , 1999 .

[8]  Gino Yu,et al.  Scalable interest management for multidimensional routing space , 2005, VRST '05.

[9]  Thorsten Hampel,et al.  A peer-to-peer architecture for massive multiplayer online games , 2006, NetGames '06.

[10]  R.M. Fujimoto,et al.  Parallel and distributed simulation systems , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[11]  Mark H. Overmars,et al.  Point Location in Fat Subdivisions , 1992, Inf. Process. Lett..

[12]  Stephen John Turner,et al.  An Efficient Sort-Based DDM Matching Algorithm for HLA Applications with a Large Spatial Environment , 2007, 21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07).

[13]  Graham Morgan,et al.  Expanding Spheres: A Collision Detection Algorithm for Interest Management in Networked Games , 2004, ICEC.

[14]  Michael Zyda,et al.  Exploiting reality with multicast groups: a network architecture for large-scale virtual environments , 1995, Proceedings Virtual Reality Annual International Symposium '95.

[15]  Chris Greenhalgh,et al.  Extending locales: awareness management in MASSIVE-3 , 2000, Proceedings IEEE Virtual Reality 2000 (Cat. No.00CB37048).

[16]  Stephen John Turner,et al.  A hybrid Interest Management mechanism for peer-to-peer Networked Virtual Environments , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[17]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[18]  Jun Yu,et al.  A sort-based DDM matching algorithm for HLA , 2005, TOMC.

[19]  Steve Benford,et al.  MASSIVE: a collaborative virtual environment for teleconferencing , 1995, TCHI.