A Framework for Performance Evaluation of Decentralized Eventual Consistency Algorithms

Eventual Consistency (EC) model is adopted by numerous large-scale distributed systems. To ensure performance and scalability, this model allows any replica to accept updates without remote synchronization. Nowadays, many EC algorithms are developed to control the behavior of the replicated data in the face of concurrent updates. Among them, those using a central server to order the updates, while others support the decentralization. In this paper, we focus on decentralized EC algorithms. Suitability of such algorithms under users and devices constraints such as execution time, memory requirements, messages size and quality of the result remains to be investigated under different conditions. Evaluate such algorithms in different context and under different parameters require a framework. In this paper, we propose a generic framework designed to evaluate diferent decentralized EC algorithms, in diferent context by controlling diferent parameters. Our framework provides a generic simulator that generates a runnable data following diferent parameters.