The results presented in this paper use periodic reconciliation only, with no fast propagation at update time. We varied the interval from 1 to 21 hours. Consistency Algorithms for Optimistic Replication . Proceedings of the First International Conference on Network Protocols, IEEE, October 1993. To encourage files to reach eventual consistency, pairs of file replicas are periodically compared using Ficus reconciliation.
Replicas compare their data by using vector timestamps.
In Proceedings of the First International Conference on Network Protocols. IEEE, October 1993. Our passive end point caching mechanism adopts a token based cache consistency mechanism similar to DFS scheme. This is motivated by the relative simplicity of implementing single writer multiple reader semantics. A recent study by Guy et al.