Elvis S. Liu
Georgios K. Theodoropoulos
Abstract
Interest management in Distributed Virtual Environments (DVEs) is a data-filtering technique designed to reduce bandwidth consumption and therefore enhances the scalability of the system. This technique usually involves a process called interest matching, which determines what data should be sent to the participants as well as what data should be filtered. Although most of the existing interest matching approaches have been shown to meet their runtime performance requirements, they have a fundamental disadvantage—they perform interest matching at discrete time intervals. As a result, they would fail to report events between discrete timesteps. If participants of the DVE ignore these missing events, they would most likely perform incorrect simulations. This article presents a new approach called space-time interest matching, which aims to capture the missing events between discrete timesteps. Although this approach requires additional matching effort, a number of novel algorithms are developed to significantly improve its runtime efficiency.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments
- Karim Abdel-Malek, Denis Blackmore, and Kenneth Joy. 2006. Swept volumes: Foundations, perspectives, and applications. International Journal of Shape Modeling 12, 1, 87--127.Google Scholar
Cross Ref
- Howard Abrams, Kent Watsen, and Michael Zyda. 1998. Three-tiered interest management for large-scale virtual environments. In Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST). 125--129. Google ScholarDigital Library
- Steve Benford and Chris Greenhalgh. 1997. Introducing third party objects into the spatial model of interaction. In Proceedings of the 5th European Conference on Computer-Supported Cooperative Work (ECSCW’97). Kluwer Academic Publishers, Norwell, MA, 189--204. Google ScholarDigital Library
- Azzedine Boukerche and Caron Dzermajko. 2001. Performance comparison of data distribution management strategies. In Proceedings of the 5th IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT’01). IEEE Computer Society, Washington, DC, 67. Google ScholarDigital Library
- Stephen Cameron. 1985. A study of the clash detection problem in robotics. In Proceedings of the IEEE International Conference on Robotics and Automation. 488--493.Google ScholarCross Ref
- Christer Carlsson and Olof Hagsand. 1993. DIVE—a platform for multi-user virtual environments. Computers & Graphics 17, 6, 663--669.Google ScholarCross Ref
- DMSO. 1998. High Level Architecture Interface Specification Version 1.3.Google Scholar
- Richard M. Fujimoto. 2000. Parallel and Distributed Simlation Systems. John Wiley and Sons. Google ScholarDigital Library
- Chris Greenhalgh and Steve Benford. 1995. MASSIVE: A collaborative virtual environment for teleconferencing. ACM Transactions on Computer Human Interactions 2, 3 (September 1995), 239--261. Google ScholarDigital Library
- Dai Hanawa and Tatsuhiro Yonekura. 2006. A proposal of dead reckoning protocol in distributed virtual environment based on the Taylor expansion. In Proceedings of the 2006 International Conference on Cyberworlds (CW’06). 107--114. Google ScholarDigital Library
- Shun-Yun Hu, Jui-Fa Chen, and Tsu-Han Chen. 2006. VON: A scalable peer-to-peer network for virtual environments. IEEE Network 20, 4, 22--31. Google ScholarDigital Library
- Peter Kogge. 2008. ExaScale Computing Study: Technology Challenges in Achieving Exascale Systems. Technical Report. DARPA IPTO.Google Scholar
- Eric Larsen, Stefan Gottschalk, Ming C. Lin, and Dinesh Manocha. 1999. Fast Proximity Queries with Swept Sphere Volumes. Technical Report. Department of Computer Science, UNC Chapel Hill.Google Scholar
- Elvis S. Liu and Georgios Theodoropoulos. 2010. A continuous matching algorithm for interest management in distributed virtual environments. In Proceedings of the 24th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS’10). Google ScholarDigital Library
- Elvis S. Liu and Georgios K. Theodoropoulos. 2009. An approach for parallel interest matching in distributed virtual environments. In Proceedings of the 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT’09). Google ScholarDigital Library
- Elvis S. Liu, Milo K. Yip, and Gino Yu. 2005. Scalable interest management for multidimensional routing space. In Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST’05). 82--85. DOI: http://dx.doi.org/10.1145/1101616.1101633 Google ScholarDigital Library
- Elvie S. Liu, Milo K. Yip, and Gino Yu. 2006. Lucid platform: Applying HLA DDM to multiplayer online game middleware. ACM Computers in Entertainment 4, 4, 9. DOI: http://dx.doi.org/10.1145/1178418.1178431 Google ScholarDigital Library
- Charles M. Macal and Michael J. North. 2008. Agent-based modeling and simulation for exascale computing. SciDac Review (Summer 2008), 34--41. Available at http://www.scidacreview.org/0802/html/abms.html.Google Scholar
- Michael R. Macedonia, Michael J. Zyda, David R. Pratt, Donal P. Brutzman, and Paul T. Barham. 1995. Exploiting reality with multicast groups: A network architecture for large-scale virtual environments. In Proceedings of the IEEE Virtual Reality Annual International Symposium (VRAIS’95). 2--10. Google ScholarDigital Library
- Graham Morgan and Fengyun Lu. 2003. Predictive interest management: An approach to managing message dissemination for distributed virtual environments. In Proceedings of the 1st International Workshop on Interactive Rich Media Content Production: Architectures, Technologies, Applications, Tools.Google Scholar
- Graham Morgan, Kier Storey, and Fengyun Lu. 2004. Expanding spheres: A collision detection algorithm for interest management in networked games. In Proceedings of the 3rd International Conference on Entertainment Computing (ICEC’04).Google ScholarCross Ref
- Katherine L. Morse and Jeffrey S. Steinman. 1997. Data distribution management in the HLA-multidimensional regions and physically correct filtering. In Proceedings of the Spring Simulation Interoperability Workshop (SIW’97). 343--352.Google Scholar
- Ke Pan, Wentong Cai, Xueyan Tang, Suiping Zhou, and Stephen John Turner. 2010. A hybrid interest management mechanism for peer-to-peer networked virtual environments. In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS’10).Google ScholarCross Ref
- Ke Pan, Stephen John Turner, Wentong Cai, and Zengxiang Li. 2007. An efficient sort-based DDM matching algorithm for HLA applications with a large spatial environment. In Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation (PADS’07). Washington, DC, 70--82. DOI: http://dx.doi.org/10.1109/PADS.2007.14 Google ScholarDigital Library
- Mikel Petty and Katherine Morse. 2000. Computational complexity of HLA data distribution management. In Proceedings of the Fall Simulation Interoperability Workshop.Google Scholar
- Mikel Petty and Katherine Morse. 2004. The computational complexity of the high level architecture data distribution management matching and connecting processes. Simulation Modelling Practice and Theory 12, 3--4, 217--237.Google ScholarCross Ref
- William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. 2007. Numerical Recipes 3rd Edition: The Art of Scientific Computing (3rd ed.). Cambridge University Press. Google ScholarDigital Library
- James Purbrick and Chris Greenhalgh. 2000. Extending locales: Awareness management in MASSIVE-3. In Proceedings of the IEEE Virtual Reality 2000 Conference. IEEE Computer Society, Washington, DC, 287. Google ScholarDigital Library
- Come Raczy, Gary Tan, and J. Yu. 2005. A sort-based DDM matching algorithm for HLA. ACM Transactions on Modeling and Computer Simulation 15, 1, 14--38. DOI: http://dx.doi.org/10.1145/1044322.1044324 Google ScholarDigital Library
- Sandeep Singhal and Michael Zyda. 1999. Networked Virtual Environments: Design and Implementation. Addison-Wesley. Google ScholarDigital Library
- Jouni Smed, Timo Kaukoranta, and Harri Hakonen. 2002. A Review on Networking and Multiplayer Computer Games. Technical Report 454. Turku Centre for Computer Science.Google Scholar
- Sony Online Entertainment. 1999. Everquest. Retrieved March 15, 2014, from http://everquest.station.sony.com/.Google Scholar
- Anthony Steed and Roula Abou-Haidar. 2003. Partitioning crowded virtual environments. In Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST’03). 7--14. Google ScholarDigital Library
- Daniel J. Van Hook, Steven J. Rak, and James Calvin. 1997. Approaches to RTI implementation of HLA data distribution management services. In Proceedings of the 15th Workshop on Standards for the Interoperability of Distributed Simulations.Google Scholar
- Daniel J. Van Hook, Steven J. Rak, and James O. Calvin. 1994. Approaches to relevance filtering. In Proceedings of the 11th Workshop on Standards for the Interoperability of Distributed Simulations. 26--30.Google Scholar
Index Terms
- Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments
Recommendations
Interest management for distributed virtual environments: A survey
The past two decades have witnessed an explosion in the deployment of large-scale distributed simulations and distributed virtual environments in different domains, including military and academic simulation systems, social media, and commercial ...
A Parallel Interest Matching Algorithm for Distributed-Memory Systems
DS-RT '11: Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time ApplicationsAs 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 ...
An Approach for Parallel Interest Matching in Distributed Virtual Environments
DS-RT '09: Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time ApplicationsInterest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing interest management schemes such as HLA DDM focus on providing precise message ...
Reviews
Amos O Olagunju
The scalability of distributed virtual environments (DVEs) requires an approach for filtering and disseminating relevant data to participating members. How should an algorithm be designed for coping with sporadic interest matching, hasty entity movement, and small aura sizes in DVEs__?__ Liu and Theodoropoulos present a space-time interest matching technique for spotting mislaid events between discrete time steps necessary in accurate simulations. They succinctly review the strong points and downsides of the persuasive zone-based, aura-based, class-based, and hybrid interest management schemes, and the viable interest matching algorithms. In the space-time interest matching technique, a swept volume confines the movement of any haphazard virtual object along any unsystematic trajectory over a time period. Swept volumes are used to bind the pathway of auras over each time phase. A resourceful divide-and-conquer technique is used to ascertain whether or not two swept volumes truly overlay at a specific time. In a simulation, the interactions of pairs of auras among twofold successive time steps are exploited via the aura-based filtering component of the space-time interest matching technique. The authors present a space-time interest matching algorithm that supports interest matching among multiple regions in DVEs. A sorting procedure is utilized for partitioning a multidimensional puzzle into single-dimensional problems, prior to exploring the possibility of overlapped pairs of swept volumes, and then executing the pairwise interest matching algorithm. The capability to pinpoint missing events and the computational performance of space-time interest matching were evaluated in a simulation experiment. The 3D simulation of World War II dog fighting involved two teams of virtual aircraft in aerial combat, where the information update and subscription regions of the aircraft vigorously changed. The experimental results reveal that the space-time interest matching algorithm is (1) able to capture more swept volume overlaps than the existing discrete algorithms, particularly when entities travel at high speeds, and is (2) much faster than the brute-force approaches. Although the divide-and-conquer algorithm and the swept volume computation hinder the runtime efficiency of space-time interest matching, the authors present techniques that reliably perform interest matching at discrete periods for fast-moving entities in scalable DVEs. The mathematical ideas in this paper are timely and useful for investigating complex simulation tasks in data-exhaustive exascale multiagent system simulations [1,2]. I really enjoyed reading this insightful paper. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments