Jean-Sébastien Boulanger
Jörg Kienzle
ABSTRACT
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer games have to employ sophisticated interest management techniques that only send relevant state changes to each player. This paper compares the performance of different interest management algorithms based on measurements obtained in a real massively multiplayer game using human and computer-generated player actions. We show that interest management algorithms that take into account obstacles in the world reduce the number of update messages between players by up to a factor of 6, and that some computationally inexpensive tile-based interest management algorithms can approximate ideal visibility-based interest management at very low cost. The experiments also show that measurements obtained with computer-controlled players performing random actions can approximate measurements of games played by real humans, provided that the starting positions of the random players are chosen adequately. As the size of the world and the number of players of massively multiplayer games increases, adaptive interest management techniques such as the ones studied in this paper will become increasingly important.
- JSysmon. http://jsysmon.sourceforge.net.]]Google Scholar
- Mammoth: The massively multiplayer prototype. http://mammoth.cs.mcgill.ca, 2006.]]Google Scholar
- H. Abrams, K. Watsen, and M. Zyda. Three-tiered interest management for large-scale virtual environments. In Proceedings of the ACM symposium on Virtual reality software and technology, pages 125--129, 1998.]] Google ScholarDigital Library
- J. W. Barrus, R. C. Waters, and D. B. Anderson. Locales and beacons: efficent and precise support for large multi-user virtual environments. In Proceedings of the IEEE Virtual Reality Annual International Symposium, pages 204--213, 1996.]] Google ScholarDigital Library
- S. Benford and L. E. Fahlen. A spatial model of interaction in large virtual environments. In Third European Conference on Computer Supported Cooperative Work, pages 107--123, 1993.]] Google ScholarDigital Library
- M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer, 1997.]] Google ScholarDigital Library
- S. Fiedler, M. Wallner, and M. Weber. A communication architecture for massive multiplayer games. In Proceedings of the 1st workshop on Network and system support for games, pages 14--22, 2002.]] Google ScholarDigital Library
- T. A. Funkhouser. RING: a client-server system for multi-user virtual environments. In Proceedings of the 1995 symposium on Interactive 3D graphics, pages 85--92, 1995.]] Google ScholarDigital Library
- C. Greenhalgh. Awareness-based communication management in the MASSIVE systems. Distributed Systems Engineering, vol. 5, no. 3:129--137, 1998.]]Google ScholarCross Ref
- S. Han, M. Lim, and D. Lee. Scalable interest management using interest group based filtering for large networked virtual environments. In Proceedings of the ACM symposium on Virtual reality software and technology, pages 103--108, 2000.]] Google ScholarDigital Library
- M. Hosseini, S. Pettifer, and N. D. Georganas. Visibility-based interest management in collaborative virtual environments. In Proceedings of the 4th international conference on Collaborative virtual environments, pages 143--144, 2002.]] Google ScholarDigital Library
- M. R. Macedonia, M. J. Zyda, D. R. Pratt, D. P. Brutzman, and P. T. Barham. Exploiting reality with multicast groups. IEEE Comput. Graph. Appl., 15(5):38--45, 1995.]] Google ScholarDigital Library
- M. Masa and J. Žára. Generalized interest management in virtual environments. In Proceedings of the 4th international conference on Collaborative virtual environments, pages 149--150, 2002.]] Google ScholarDigital Library
- R. D. P. McFarlane. Network software architecture for real-time massively-multiplayer online games. Master's thesis, McGill University, 2005.]]Google Scholar
- G. Morgan, F. Lu, and K. Storey. Interest management middleware for networked games. In Proceedings of the 2005 symposium on Interactive 3D graphics and games, pages 57--64, 2005.]] Google ScholarDigital Library
- K. L. Morse. Interest management in large-scale distributed simulations. Technical report, Department of Information & Computer Science, University of California, Irvine, 1996.]]Google Scholar
- Quazal. Duplication Spaces#8482; Quazal Multiplayer Connectivity White Paper, January 2002. http://www.quazal.com.]]Google Scholar
- S. J. Rak and D. J. V. Hook. Evaluation of grid-based relevance filtering for multicast group assignment, 1996.]]Google Scholar
- S. Singhal and M. Zyda. Networked Virtual Environments: Design and Implementation. SIGGRAPH Series. Addison-Wesley and ACM Press, New York, 1999.]] Google ScholarDigital Library
- L. Zou, M. H. Ammar, and C. Diot. An evaluation of grouping techniques for state dissemination in networked multi-user games. In Proceedings of the ninth Internation Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pages 33--40, 2001.]] Google ScholarDigital Library
Index Terms
- Comparing interest management algorithms for massively multiplayer games
Recommendations
The usability of massively multiplayer online roleplaying games: designing for new users
CHI '04: Proceedings of the SIGCHI Conference on Human Factors in Computing SystemsThis study examines the usability challenges faced by new players of massively multiplayer online role-playing games (MMORPGs), one of the fastest-growing segments of the video game industry. Played in completely online worlds, these games allow players ...
Design issues for Peer-to-Peer Massively Multiplayer Online Games
Massively Multiplayer Online Games (MMOGs) are increasing in both popularity and scale, and while classical Client/Server (C/S) architectures convey some benefits, they suffer from significant technical and commercial drawbacks. This realisation ...
Comments