×

Space-time matching algorithms for interest management in distributed virtual environments. (English) Zbl 1322.68027


MSC:

68M14 Distributed systems
68W15 Distributed algorithms

Software:

VON
Full Text: DOI

References:

[1] Karim Abdel-Malek, Denis Blackmore, and Kenneth Joy. 2006. Swept volumes: Foundations, perspectives, and applications. International Journal of Shape Modeling 12, 1, 87–127. · Zbl 1096.68753 · doi:10.1142/S0218654306000858
[2] 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.
[3] 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.
[4] 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.
[5] 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.
[6] Christer Carlsson and Olof Hagsand. 1993. DIVE—a platform for multi-user virtual environments. Computers & Graphics 17, 6, 663–669. · doi:10.1016/0097-8493(93)90115-P
[7] DMSO. 1998. High Level Architecture Interface Specification Version 1.3.
[8] Richard M. Fujimoto. 2000. Parallel and Distributed Simlation Systems. John Wiley and Sons.
[9] 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. · doi:10.1145/210079.210088
[10] 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.
[11] 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. · doi:10.1109/MNET.2006.1668400
[12] Peter Kogge. 2008. ExaScale Computing Study: Technology Challenges in Achieving Exascale Systems. Technical Report. DARPA IPTO.
[13] 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.
[14] 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). · Zbl 1322.68027
[15] 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). · Zbl 1322.68027
[16] 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 · doi:10.1145/1101616.1101633
[17] 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 · doi:10.1145/1178418.1178431
[18] 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.
[19] 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.
[20] 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.
[21] 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).
[22] 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.
[23] 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).
[24] 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 · doi:10.1109/PADS.2007.14
[25] Mikel Petty and Katherine Morse. 2000. Computational complexity of HLA data distribution management. In Proceedings of the Fall Simulation Interoperability Workshop.
[26] 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. · doi:10.1016/j.simpat.2003.10.004
[27] 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. · Zbl 1132.65001
[28] 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. · doi:10.1109/VR.2000.840515
[29] 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 · doi:10.1145/1044322.1044324
[30] Sandeep Singhal and Michael Zyda. 1999. Networked Virtual Environments: Design and Implementation. Addison-Wesley.
[31] Jouni Smed, Timo Kaukoranta, and Harri Hakonen. 2002. A Review on Networking and Multiplayer Computer Games. Technical Report 454. Turku Centre for Computer Science.
[32] Sony Online Entertainment. 1999. Everquest. Retrieved March 15, 2014, from http://everquest.station.sony.com/.
[33] 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.
[34] 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.
[35] 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.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.