TY - GEN
T1 - Persistence in massively multiplayer online games
AU - Zhang, Kaiwen
AU - Kemme, Bettina
AU - Denault, Alexandre
PY - 2008
Y1 - 2008
N2 - The most important asset of a Massively Multiplayer Online Game is its world state, as it represents the combined efforts and progress of all its participants. Thus, it is extremely important that this state is not lost in case of server failures. Survival of the world state is typically achieved by making it persistent, e.g., by storing it in a relational database. The main challenge of this approach is to track the large volume of modifications applied to the world in real time. This paper compares a variety of strategies to persist changes of the game world. While critical events must be written synchronously to the persistent storage, a set of approximation strategies are discussed and compared that are suitable for events with low consistency requirements, such as player movements. An analysis to better understand the possible limitations and bottlenecks of these strategies is presented using experimental data from an MMOG research framework. Our analysis shows that a distance-based solution offers the scalability and efficiency required for large-scale games as well as offering error bounds and eliminating unnecessary updates associated with localized movement.
AB - The most important asset of a Massively Multiplayer Online Game is its world state, as it represents the combined efforts and progress of all its participants. Thus, it is extremely important that this state is not lost in case of server failures. Survival of the world state is typically achieved by making it persistent, e.g., by storing it in a relational database. The main challenge of this approach is to track the large volume of modifications applied to the world in real time. This paper compares a variety of strategies to persist changes of the game world. While critical events must be written synchronously to the persistent storage, a set of approximation strategies are discussed and compared that are suitable for events with low consistency requirements, such as player movements. An analysis to better understand the possible limitations and bottlenecks of these strategies is presented using experimental data from an MMOG research framework. Our analysis shows that a distance-based solution offers the scalability and efficiency required for large-scale games as well as offering error bounds and eliminating unnecessary updates associated with localized movement.
UR - https://www.scopus.com/pages/publications/70349150115
U2 - 10.1145/1517494.1517505
DO - 10.1145/1517494.1517505
M3 - Contribution to conference proceedings
AN - SCOPUS:70349150115
SN - 9781605581323
T3 - Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games, NetGames'08
SP - 53
EP - 58
BT - Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games, NetGames'08
T2 - 7th ACM SIGCOMM Workshop on Network and System Support for Games, NetGames'08
Y2 - 21 October 2008 through 22 October 2008
ER -