A peer-to-peer simulation technique for instanced massively multiplayer games

We propose a peer-to-peer event ordering and simulation technique aimed at networked real-time action games. Partially based on replicated simulators, its goal is to support decentralized play out in small-scale game sessions on instanced action spaces while being resistant to collusion cheating. The action spaces are linked to persistent-state social spaces of larger scale which are supported by centralized simulation. Together, these two kinds of spaces offer support for massively multiplayer online games (MMOGs) that offer a mix of socialization on large-scale persistent environments and fast interaction on small-scale temporary ones. Although player nodes on action spaces are required to run a conservative and an optimistic simulator simultaneously, we show that 2.2 simultaneous simulation steps are executed on average and that 11.95 simultaneous steps occur as the average peak situation for 20-player sessions with 150 ms to 300 ms network delays between nodes, 5% probability of any late events introducing errors, and rollback and re-execution operations having their execution spreaded through 100 ms of real time or longer

[1]  Christophe Diot,et al.  MiMaze, a Multiuser Game on the Internet , 1997 .

[2]  Alejandro P. Buchmann,et al.  Addressing cheating in distributed MMOGs , 2005, NetGames '05.

[3]  Daniel Zappala,et al.  Low latency and cheat-proof event ordering for peer-to-peer games , 2004, NOSSDAV '04.

[4]  David L. Mills,et al.  Network Time Protocol (Version 3) Specification, Implementation and Analysis , 1992, RFC.

[5]  Jorge L. V. Barbosa,et al.  FreeMMG: A Scalable and Cheat-Resistant Distribution Model for Internet Games , 2004, Eighth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[6]  Brian Neil Levine,et al.  Cheat-proof playout for centralized and distributed online games , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Christophe Diot,et al.  Design and evaluation of MiMaze a multi-player game on the Internet , 1998, Proceedings. IEEE International Conference on Multimedia Computing and Systems (Cat. No.98TB100241).

[8]  Yahn W. Bernier,et al.  Latency Compensating Methods in Client/Server In-game Protocol Design and Optimization , 2003 .

[9]  Suiping Zhou,et al.  A dynamic load sharing algorithm for massively multiplayer online games , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[10]  Sugih Jamin,et al.  An Efficient Synchronization Mechanism for Mirrored Game Architectures , 2002, NetGames '02.

[11]  Alex Jarett.  IGDA Online Games White Paper , 2002 .

[12]  Filip De Turck,et al.  Dynamic microcell assignment for massively multiplayer online gaming , 2005, NetGames '05.

[13]  Brian Randell,et al.  A systematic classification of cheating in online games , 2005, NetGames '05.

[14]  Richard M. Fujimoto,et al.  ZERO LOOKAHEAD AND REPEATABILITY IN THE HIGH LEVEL ARCHITECTURE , 1999 .

[15]  Jan Ohlenburg,et al.  Improving collision detection in distributed virtual environments by adaptive collision prediction tracking , 2004, IEEE Virtual Reality 2004.