Performance Evaluation of the Fast Consistency Algorithms in Large Decentralized Systems

摘要: Weak consistency algorithms allow us to propagate changes in a large, arbitrary changing storage network self-organizing way. These generate very little traffic overhead. In this paper we evaluate our own weak algorithm, which is called the ”Fast Consistency Algorithm”, and whose main aim optimizing propagation of introducing preference for nodes zones have greatest demand. We conclude that considering application parameters such as demand event or change mechanism to: 1) prioritize probabilistic interactions with neighbors higher demand, 2) including on logical topology, gives surprising improvement speed perceived by most users.