A synchronization protocol for supporting peer-to-peer multiplayer online games in overlay networks

We propose a new synchronization protocol devised to support multiplayer online games (MOGs) over peer-to-peer architectures. The dissemination of game events is performed through an overlay network. Peers are kept synchronized thanks to an optimistic mechanism which is able to drop obsolete events (i.e., events that lose their importance as the game goes on) and to allow different processing orders for non-correlated events (i.e., events which do not represent competing actions in the virtual world). To allow a fast identification of obsolete events, a gossip protocol is added to the synchronization mechanism, which is in charge of spreading in background information on generated game events. Results coming from extensive simulations confirm the viability of our approach.

[1]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[2]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[3]  Manuel Menezes de Oliveira Neto,et al.  What online gamers really think of the Internet? , 2003, NetGames '03.

[4]  Thorsten Hampel,et al.  A peer-to-peer architecture for massive multiplayer online games , 2006, NetGames '06.

[5]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[6]  Stefano Ferretti,et al.  Cheating detection through game time modeling: A better way to avoid time cheats in P2P MOGs? , 2008, Multimedia Tools and Applications.

[7]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[8]  Stefano Ferretti,et al.  Interactivity maintenance for event synchronization in massive multiplayer online games , 2005 .

[9]  Richard M. Fujimoto,et al.  Parallel and Distribution Simulation Systems , 1999 .

[10]  Michael S. Borella,et al.  Source models of network game traffic , 2000, Comput. Commun..

[11]  Marco Roccetti,et al.  Interactivity-loss avoidance in event delivery synchronization for mirrored game architectures , 2006, IEEE Transactions on Multimedia.

[12]  Jörg Widmer,et al.  A generic proxy system for networked computer games , 2002, NetGames '02.

[13]  Donald F. Towsley,et al.  Adaptive FEC-based error control for Internet telephony , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  André Schiper,et al.  Generic Broadcast , 1999, DISC.

[15]  William Lau,et al.  Enhanced mirrored servers for network games , 2007, NetGames '07.

[16]  Christian Lavault,et al.  A distributed algorithm for constructing a minimum diameter spanning tree , 2004, J. Parallel Distributed Comput..

[17]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[18]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[19]  Xiaozhou Li,et al.  Active and Concurrent Topology Maintenance , 2004, DISC.

[20]  Colin Perkins,et al.  A survey of packet loss recovery techniques for streaming audio , 1998 .

[21]  Khalil Drira,et al.  Causal Broadcast Protocol for Very Large Group Communication Systems , 2001, OPODIS.

[22]  Jacob R. Lorch,et al.  Scaling Peer-to-Peer Games in Low-Bandwidth Environments , 2007, IPTPS.

[23]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[24]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[25]  Johannes Färber,et al.  Network game traffic modelling , 2002, NetGames '02.

[26]  Amin Vahdat,et al.  High-bandwidth data dissemination for large-scale distributed systems , 2008, TOCS.

[27]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[28]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[29]  David Hutchison,et al.  An Overlay Tree Building Control Protocol , 2001, Networked Group Communication.

[30]  Marco Roccetti,et al.  An Optimistic Obsolescence-Based Approach to Event Synchronization for Massively Multiplayer Online Games , 2007 .

[31]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

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

[33]  Roberto Baldoni,et al.  Connectivity in Eventually Quiescent Dynamic Distributed Systems , 2007, LADC.

[34]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[35]  Henning Schulzrinne,et al.  Integrating packet FEC into adaptive voice playout buffer algorithms on the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[36]  Srinivasan Seshan,et al.  Mercury: a scalable publish-subscribe system for internet games , 2002, NetGames '02.

[37]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

[38]  Flaviu Cristian,et al.  The Timed Asynchronous Distributed System Model , 1999, IEEE Trans. Parallel Distributed Syst..

[39]  Ajay D. Kshemkalyani,et al.  An optimal algorithm for generalized causal message ordering , 1996, PODC '96.

[40]  Luís E. T. Rodrigues,et al.  Semantically Reliable Multicast: Definition, Implementation, and Performance Evaluation , 2003, IEEE Trans. Computers.