{'fraction_non_alphanumeric': 0.023613963039014373, 'fraction_numerical': 0.0, 'mean_word_length': 5.678082191780822, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Bilateral anti-entropy for eventual consistency

Eventually consistent systems are often more cost-effective to implement and maintain than their strongly consistent cousins. Gossip-based anti-entropy methods can be used to improve the consistency of such systems. However, observational data suggests that such improvements come at the cost of perennial data egress, significantly mitigating savings in a geo-replicated context. This paper presents observations collected from an eventually consistent system deployed in production clusters across the US, Germany, and Singapore. A bilateral anti-entropy process facilitates data synchronization for an application accessed globally and around-the-clock. Replication metrics such as latency, conflict, and the duration and productivity of anti-entropy sessions seem to indicate that it is possible to quantify tradeoffs between consistency and visibility latency such that staleness can be not only bounded, but fine-tuned.