The experimental results indicate that both models can find optimal solutions and prove optimality. Both MIP (Mixed Integer Programming) and CP (Constraint Programming) models are presented and applied to realistic ESDS instances. This deployment aims at minimizing the overall communication costs, while satisfying the constraints imposed by the protocol.
This paper reconsiders the deployment phase of ESDS, in which a particular implementation of communicating software components must be mapped onto a physical architecture. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees that the replicated data will eventually be consistent. However, replication induces significant communication costs to maintain replica consistency.
To achieve fault-tolerance and to increase throughput, objects are replicated at different networked nodes. Providing consistent and fault-tolerant distributed object services is among the fundamental problems in distributed computing.
