Fisheye Consistency: Keeping Data in Synch in a Georeplicated World
Roy Friedman, Michel Raynal (IUF, UR1, ASAP), Fran\c{c}ois Ta\"iani, (UR1, ASAP)

TL;DR
This paper introduces fisheye consistency, a hybrid data consistency model for georeplicated systems that combines different consistency levels based on node proximity, supported by a distributed algorithm.
Contribution
It proposes a proximity graph-based framework for hybrid consistency conditions, including a new model called fisheye consistency, with a provably correct distributed algorithm.
Findings
The proximity graph enables tailored consistency levels for different node pairs.
The fisheye consistency model combines causal and sequential consistency.
A distributed algorithm implementing fisheye consistency is proven correct.
Abstract
Over the last thirty years, numerous consistency conditions for replicated data have been proposed and implemented. Popular examples of such conditions include linearizability (or atomicity), sequential consistency, causal consistency, and eventual consistency. These consistency conditions are usually defined independently from the computing entities (nodes) that manipulate the replicated data; i.e., they do not take into account how computing entities might be linked to one another, or geographically distributed. To address this lack, as a first contribution, this paper introduces the notion of proximity graph between computing nodes. If two nodes are connected in this graph, their operations must satisfy a strong consistency condition, while the operations invoked by other nodes are allowed to satisfy a weaker condition. The second contribution is the use of such a graph to provide a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
