Graph of Game Worlds: New Perspectives on Video Game Architectures
Article No.: 2, Pages 1 - 21
Abstract
Software architectures of video games have evolved radically over the past decade. Researchers and practitioners have proposed architectural patterns such as stand-alone configuration, peer-to-peer, client server and hybrid, and some of them have successfully been used in commercial game titles. A conceptual framework for game architectures—Game Worlds Graph (GWG)—is presented in this paper for three purposes: 1) classifying existing architectures, 2) communicating and sense-making of game architectures, and 3) exploring and discovering future game architectures. The framework is based on the Game World and the World Connector concepts, which reveal some essential characteristics of game architectures—thus can be more descriptive and informative than existing taxonomies.
References
[1]
DeMaria, R. and J. L. Wilson, High score! The Illustrated History of Electronic Games, 2 ed2004: McGraw Hill.
[2]
Blow, J., Game Development: Harder Than You Think. Queue, 2004. 1(10): p. 28--37.
[3]
Hsu, C.-C., et al. On the Design of Multiplayer Online Video Game Systems. 2003. Orlando, FL, United states: SPIE.
[4]
Huey-Ing, L. and L. Yun-Ting. DaCAP - A Distributed Anti-Cheating Peer to Peer Architecture for Massive Multiplayer On-line Role Playing Game. in Cluster Computing and the Grid, 2008. CCGRID'08. 8th IEEE International Symposium on. 2008.
[5]
Roccetti, M., S. Ferretti, and C. E. Palazzi. The Brave New World of Multiplayer Online Games: Synchronization Issues with Smart Solutions. in Object Oriented Real-Time Distributed Computing (ISORC), 2008 11th IEEE International Symposium on. 2008.
[6]
Cecin, F., et al. FreeMMG: a hybrid peer-to-peer and client-server model for massively multiplayer games. 2004. ACM New York, NY, USA.
[7]
Bouras, C., et al., Networking Aspects for Gaming Systems, in The Third International Conference on Internet and Web Applications and Services 2008.
[8]
Wierzbicki, A. and T. Kucharski. “P2P scrabble. Can P2P games commence?”. in peer-to-peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on. 2004.
[9]
Mauve, M., S. Fischer, and J. Widmer, A generic proxy system for networked computer games, in Proceedings of the 1st workshop on Network and system support for games 2002, ACM: Braunschweig, Germany.
[10]
Hampel, T., T. Bopp, and R. Hinn, A peer-to-peer architecture for massive multiplayer online games, in Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games 2006, ACM: Singapore.
[11]
Kabus, P., et al., Addressing cheating in distributed MMOGs, in Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games 2005, ACM: Hawthorne, NY.
[12]
Rhalibi, A. E. and M. Merabti, Agents-based modeling for a peer-to-peer MMOG architecture. Comput. Entertain., 2005. 3(2): p. 3--3.
[13]
Clements, P. and R. Kazman, Software Architecture in Practices2003: Addison-Wesley Longman Publishing Co., Inc. 528.
[14]
Dybå T and T. Dingsøyr, Empirical studies of agile software development: A systematic review. Information and Software Technology, 2008. 50 (9--10): p. 833--859.
[15]
Meng Z., W. Alf Inge, and G. Hong, From 101 to nnn: A Review of Computer Game Architectures. Will be submitted to ACM Computers in Entertainment.
[16]
Chan, H. T. and R. K. C. Chang. Strifeshadow Fantasy: a massive multi-player online game. in Consumer Communications and Networking Conference, 2004. CCNC 2004. First IEEE. 2004.
[17]
Buyukkaya, E., M. Abdallah, and R. Cavagna. VoroGame: A Hybrid P2P Architecture for Massively Multiplayer Games. in Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE. 2009.
[18]
Rowstron, A. and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale peer-to-peer Systems, in Middleware 2001, R. Guerraoui, Editor 2001, Springer Berlin/Heidelberg. p. 329--350.
[19]
Stoica, I., et al., Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev., 2001. 31(4): p. 149--160.
[20]
Aurenhammer, F., Voronoi diagrams- a survey of a fundamental geometric data structure. ACM Comput. Surv., 1991. 23(3): p. 345--405.
[21]
Muller, J., et al., Rokkatan: scaling an RTS game design to the massively multiplayer realm. Comput. Entertain., 2006. 4(3): p. 11.
[22]
Halverson, C. A., Activity Theory and Distributed Cognition: Or What Does CSCW Need to DO with Theories? Computer Supported Cooperative Work (CSCW), 2002. 11(1): p. 243--267.
[23]
Bauer, D., et al. Communication architectures for massive multi-player games. 2004. Kluwer Academic Publishers.
[24]
Yang, L. and P. Sutinrerk, Mirrored arbiter architecture: a network architecture for large scale multiplayer games, in Proceedings of the 2007 summer computer simulation conference 2007, Society for Computer Simulation International: San Diego, California.
[25]
Smed, J., T. Kaukoranta, and H. Hakonen, Aspects of networking in multiplayer computer games. Electronic Library, 2002. 20(2): p. 87--97.
[26]
Dombroviak, K. M. and Ramnath, R., 2007, Taxonomy of Mobile and Pervasive Applications. Proceedings of ACM Symposium on Applied Computing, pp. 1609--1615.
Index Terms
- Graph of Game Worlds: New Perspectives on Video Game Architectures
Recommendations
Flow Experience as a Quality Measure in Evaluating Physically Activating Serious Games
Games and Learning AllianceAbstractThe measurement of the subjective playing experience is important part of the game development process. The enjoyment level that a serious game offers is a key factor in determining whether the player will be engaged in the gameplay and achieve ...
Intrinsically musical game worlds: abstract music generation as a result of gameplay
FDG '19: Proceedings of the 14th International Conference on the Foundations of Digital GamesThis poster submission explores the concept of nuanced dynamic music generation as a core game mechanic. The world in which this game is set is intrinsically musical. All events and actions in the world add to the music rather than being sound effects ...
Roman game domination number of a graph
The Roman game domination number of an undirected graph G is defined by the following game. Players $$\mathcal {A}$$A and $$\mathcal {D}$$D orient the edges of the graph G alternately, with $$\mathcal {D}$$D playing first, until all edges are oriented. ...
Comments
Information & Contributors
Information
Published In
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 28 January 2015
Published in CIE Volume 11, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 312Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format