Vector-field consistency

Vector-Field Consistency is a consistency model for replicated data (e.g., objects), described in the paper Nuno Santos, Luís Veiga, Paulo Ferreira (2007). "Vector-Field Consistency for Adhoc Gaming (In ACM/IFIP/Usenix Middleware Conference 2007)" (PDF). {{cite journal}}: Cite journal requires |journal= (help)CS1 maint: multiple names: authors list (link), which was awarded best-paper prize in the ACM/IFIP/Usenix Middleware Conference.

It was initially designed for replicated data management in adhoc gaming in order to minimize bandwidth usage without sacrificing playability. Intuitvely, it captures the notion that although players require, wish, and take advantage of information regarding the whole of the game world (as opposed to a restricted view to rooms, arenas, etc. of limited size employed in many multiplayer games), it needs to know information with greater freshness, frequency, and accuracy as other game entities are located closer and closer to the player's position.

It prescribes a multidimensional divergence bounding scheme, based on a vector-field that employs consistency vectors k=(t,s,v), standing for maximum allowed time - or replica staleness, sequence - or missing updates, and value - or user-defined measured replica divergence, applied to all space coordinates in game scenario or world.

The consistency vector-fields emanate from field-generators designated as pivots (e.g., players) and field intensty attenuates as distance grows from these pivots in concentric or square-like regions. This work unifies locality-awareness techniques employed in message routing and consistency enforcement for multiplayer games, with divergence bounding techniques traditionally employed in replicated database and web scenarios.