Unifying divergence bounding and locality awareness in replicated systems with vector-field consistency

Data replication is a very relevant technique for improving performance, availability, and scalability. These are requirements of many applications such as multiplayer distributed games, cooperative software tools, etc. However, consistency of the replicated shared state is hard to ensure. Current consistency models and middleware systems lack the required adaptability and efficiency. Thus, developing such robust applications is still a daunting task.We propose a new consistency model, named Vector-Field Consistency (VFC) that unifies (i) several forms of consistency enforcement and a multidimensional criteria (time, sequence, and value) to limit replica divergence with (ii) techniques based on locality-awareness (w.r.t. players position).Based on the VFC model, we propose a generic meta-architecture that can be easily instantiated both to centralized and (dynamically) partitioned architectures: (i) a single central server in which the VFC algorithm runs or (ii) a set of servers in which each one is responsible for a slice of the data being shared. The first approach is clearly more adapted to ad hoc networks of resource-constrained devices, while the second, being more scalable, is well adapted to large-scale networks. We developed and evaluated two prototypes of VFC (for ad hoc and large-scale networks) with very good performance results.

[1]  Archan Misra,et al.  Matrix: Adaptive Middleware for Distributed Multiplayer Games , 2005, Middleware.

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

[3]  Gerald W. Kimble,et al.  Information and Computer Science , 1975 .

[4]  George Varghese,et al.  Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications , 2001, SIGCOMM 2001.

[5]  Thomas A. Funkhouser,et al.  RING: a client-server system for multi-user virtual environments , 1995, I3D '95.

[6]  Amin Vahdat,et al.  The costs and limits of availability for replicated services , 2001, TOCS.

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

[8]  Carsten Griwodz,et al.  State replication for multiplayer games , 2002, NetGames '02.

[9]  Graham Morgan,et al.  Interest management middleware for networked games , 2005, I3D '05.

[10]  HERBERT A. SIMON,et al.  The Architecture of Complexity , 1991 .

[11]  Giuseppe Vizzari,et al.  Awareness in collaborative ubiquitous environments: The Multilayered Multi-Agent Situated System approach , 2007, TAAS.

[12]  Arthur J. Bernstein,et al.  Bounded ignorance: a technique for increasing concurrency in a replicated system , 1994, TODS.

[13]  Amin Vahdat,et al.  Design and evaluation of a continuous consistency model for replicated services , 2000, OSDI.

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

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

[16]  Wang Yue,et al.  An Interest Management Mechanism Based on N-Tree , 2008, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing.

[17]  Lars C. Wolf Proceedings of the 1st workshop on Network and system support for games , 2002 .

[18]  Chris GauthierDickey,et al.  A measurement study of virtual populations in massively multiplayer online games , 2007, NetGames '07.

[19]  Honghui Lu,et al.  Peer-to-peer support for massively multiplayer games , 2004, IEEE INFOCOM 2004.

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

[21]  Lars C. Wolf,et al.  On the suitability of dead reckoning schemes for games , 2002, NetGames '02.

[22]  José Legatheaux Martins,et al.  Reservations for Conflict Avoidance in a Mobile Database System , 2003, MobiSys '03.

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

[24]  Rafael Alonso,et al.  Data caching issues in an information retrieval system , 1990, TODS.

[25]  Srinivasan Seshan,et al.  Donnybrook: enabling large-scale, high-speed, peer-to-peer games , 2008, SIGCOMM '08.

[26]  Srinivasan Seshan,et al.  Colyseus: A Distributed Architecture for Online Multiplayer Games , 2006, NSDI.

[27]  Cláudio Fernando Resin Geyer,et al.  A3: A Novel Interest Management Algorithm for Distributed Simulations of MMOGs , 2008, 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications.

[28]  Katherine L. Morse,et al.  Interest Management in Large-Scale Distributed Simulations , 1996 .

[29]  Marios Assiotis,et al.  A distributed architecture for MMORPG , 2006, NetGames '06.

[30]  Johnny W. Wong,et al.  Scalability Analysis of the Hierarchical Architecture for Distributed Virtual Environments , 2008, IEEE Transactions on Parallel and Distributed Systems.

[31]  Yasushi Saito,et al.  Optimistic replication , 2005, CSUR.

[32]  Jin Chen,et al.  Locality aware dynamic load management for massively multiplayer games , 2005, PPoPP.

[33]  Stephen John Turner,et al.  A scalable architecture for supporting interactive games on the internet , 2002, Proceedings 16th Workshop on Parallel and Distributed Simulation.

[34]  Ravi Jain,et al.  Escrow techniques for mobile sales and inventory applications , 1997, Wirel. Networks.