skip to main content
10.1145/1101616.1101633acmconferencesArticle/Chapter ViewAbstractPublication PagesvrstConference Proceedingsconference-collections
Article

Scalable interest management for multidimensional routing space

Published:07 November 2005Publication History

ABSTRACT

Interest management is essential for scalable collaborative virtual environments (CVEs) which sought to reduce bandwidth consumption on the network. Most of the interest management systems such as Data Distribution Management (DDM) service of the High Level Architecture (HLA) concentrate on providing precise message filtering mechanisms. However, in doing so a second problem is introduced: the CPU cycle overheads of filtering process. If the cost in terms of computational resources of interest management itself is too high, it would be unsuitable for real time applications such as multiplayer online games (MOGs) for which runtime performance is important. In this paper we present a scalable interest management algorithm which is suitable for HLA DDM. Our approach employs the collision detection method of I-COLLIDE for fast interest matching. Furthermore, the algorithm has been implemented in our commercialized MOG middleware - Lucid Platform. Experimental evidence demonstrates that it works well in practice.

References

  1. Institute for Simulation and Training, IST-TR-93-10, Distributed Interactive Simulation Operational Concept {Draft2.2}, University of Central Florida, Orlando, Florida. March 1993.Google ScholarGoogle Scholar
  2. S. Rak and D. Van Hook, Evaluation of Grid-based Relevance Filtering for Multicast Group Assignment. In 14th Workshop on Standards for the Interoperability of Distributed Simulations, pages 739--747, 1996.Google ScholarGoogle Scholar
  3. DMSO, Department of Defense, High Level Architecture Interface Specification Version 1.3. 1998.Google ScholarGoogle Scholar
  4. MIC, SD, Hong Kong Polytechnic University, Lucid Platform 1.0, http://www.lucidplatform.com, 2005.Google ScholarGoogle Scholar
  5. J. Calvin, A. Dickens, R. Gaines, P. Metzger, D. Miller, and D. Owen. The SIMNET Virtual World Architecture. In IEEE Virtual Reality Annual International Symposium, pages 450--455, 1993.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. D. Cohen, M. C. Lin, D. Manocha, and M. K. Ponamgi. I-COLLIDE: An interactive and exact collision detection system for large-scale environments. In Symposium on Interactive 3D Graphics, pages 189--196, 218, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. M. Fujimoto. Parallel and Distributed Simlation Systems. John Wiley and Sons, Inc., 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Gottschalk, M. C. Lin, and D. Manocha. OBBTree: A Hierarchical Structure for Rapid Interference Detection. SIGGRPAPH 1996 Proc., 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. Greenhalgh and S. Benford. Massive: a collaborative virtual environment for teleconferencing. ACM transactions on Computer Human Interactions, 2(3):239--261, September 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Klosowski, M. Held, J. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. on Visualization and Computer Graphics, 4(1):21--36, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. R. Macedonia, M. J. Zyda, D. R. Pratt, D. P. Brutzman, and P. T. Barham. Exploiting Reality with Multicast Groups: A Network Architecture for Large-scale Virtual Environments. In Virtual Reality Annual International Symposium, pages 2--10, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. K. Morse, L. Bic, M. Dillencourt, and K. Tsai. Multicast grouping for dynamic data distribution management. In 31st Society for Computer Simulation Conference (SCSC '99), 1999.Google ScholarGoogle Scholar
  13. K. Morse and M. Petty. High Level Architecture Data Distribution Management migration from DoD 1.3 to IEEE 1516. Concurrency and Computation: Practice and Experience, 16(15):1--17, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. K. Morse and J. S. Steinman. Data distribution management in the HLA, multidimensional regions and physically correct filtering. In 1997 Spring Simulation Interoperability Workshop, March 1997.Google ScholarGoogle Scholar
  15. B. Naylor, J. Amanatides, and W. Thibault. Merging BSP trees yields polyhedral set operations. Computr Gaphics (SIGGRAPH '90 Proc.), 24:115--124, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. H. Overmars. Point location in fat subdivisions. Information Proc. Letters, 44(5):261--265, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. H. Samet. Spatial Data Structures: Quadtree, Octrees and Other Hierarchical Methods. Addison-Wesley Publishing Company, 1989.Google ScholarGoogle Scholar

Index Terms

  1. Scalable interest management for multidimensional routing space

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader