Unifying divergence bounding and locality awareness in replicated systems with vector-field consistency
- 220 Downloads
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.
KeywordsConsistency management Replicated objects Locality-awareness Multiplayer games
- 3.Balan R, Ebling M, Castro P, Misra A (2005) Matrix: adaptive middleware for distributed multiplayer games. In: ACM/IFIP middleware conferenceGoogle Scholar
- 4.Bezerra CE, Cecin FR, Geyer CFR (2008) A3: A novel interest management algorithm for distributed simulations of mmogs. In: DS-RT ’08: proceedings of the 2008 12th IEEE/ACM international symposium on distributed simulation and real-time applications. IEEE Computer Society, Washington, pp 35–42CrossRefGoogle Scholar
- 5.Bharambe A, Pang J, Seshan S (2006) Colyseus: a distributed architecture for online multiplayer games. In: NSDI’06: proceedings of the 3rd conference on networked systems design & implementation. USENIX Association, Berkeley, pp 3–6Google Scholar
- 7.Cai W, Xavier P, Turner SJ, Lee B-S (2002) A scalable architecture for supporting interactive games on the internet. In: PADS ’02: proceedings of the 16th workshop on parallel and distributed simulation. IEEE Computer Society, Washington, pp 60–67Google Scholar
- 8.Chen J, Wu B, Delap M, Knutsson B, Lu H, Amza C (2005) Locality aware dynamic load management for massively multiplayer games. In: Proceedings of the 10th ACM SIGPLAN symposium on principles and practice of parallel programming, pp 289–300Google Scholar
- 11.Griwodz C (2002) State replication for multiplayer games. In: Proceedings of the 1st workshop on network and system support for games, pp 29–35Google Scholar
- 13.Knutsson B, Lu H, Xu W, Hopkins B (2004) Peer-to-peer support for massively multiplayer games. In: IEEE InfocomGoogle Scholar
- 17.Locatelli MP, Vizzari G (2007) Awareness in collaborative ubiquitous environments: the multilayered multi-agent situated system approach. ACM Trans Auton Adapt Agents 2(4):13:1–13:21Google Scholar
- 18.Lu H (2004) Peer-to-peer support for massively multiplayer games. In: INFOCOMGoogle Scholar
- 20.Morse K et al. (1996) Interest management in large-scale distributed simulations. Information and computer science. University of California, IrvineGoogle Scholar
- 21.Pang J (2007) Scaling peer-to-peer games in low-bandwidth environments. In: Proceedings of the 6th international workshop on peer-to-peer systems IPTPSGoogle Scholar
- 24.Preguiça N, Martins JL, Cunha M, Domingos H (2003) Reservations for conflict avoidance in a mobile database system. In: Proceedings of the 1st Usenix international conference on mobile systems, applications and services (Mobisys)Google Scholar
- 26.Rowstron AIT, Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM international conference on distributed systems platforms, Middleware 2001, Heidelberg, Germany, November 12–16, 2001, pp 329–350Google Scholar
- 28.Simon HA (1962) The architecture of complexity. Proc Am Philos Soc 106:467–482Google Scholar
- 29.Xiang-bin S, Yue W, Qiang L, Ling D, Fang L (2008) An interest management mechanism based on n-tree. In: Ninth ACIS international conference on software engineering, artificial intelligence, networking, and parallel/distributed computing, SNPD ’08, August 2008, pp 917–922Google Scholar