Improved Interactive Protocol for Synchronizing From Deletions

TL;DR

This paper presents an enhanced data synchronization protocol that efficiently handles multiple deletions using advanced error correction codes, significantly reducing communication costs in distributed systems.

Contribution

It introduces a novel synchronization protocol integrating multi-deletion correction codes, improving upon previous single-deletion methods with better efficiency and generalized bounds.

Findings

Reduces communication cost compared to baseline protocols.

Outperforms previous methods in experimental tests.

Provides a generalized upper bound on transmitted bits.

Abstract

Data synchronization is a fundamental problem with applications in diverse fields such as cloud storage, genomics, and distributed systems. This paper addresses the challenge of synchronizing two files, one of which is a subsequence of the other and related through a constant rate of deletions, using an improved communication protocol. Building upon prior work, we integrate advanced multi-deletion correction codes into an existing baseline protocol, which previously relied on single-deletion correction. Our proposed protocol reduces communication cost by leveraging more general partitioning techniques as well as multi-deletion error correction. We derive a generalized upper bound on the expected number of transmitted bits, applicable to a broad class of deletion correction codes. Experimental results demonstrate that our approach outperforms the baseline in communication cost. These findings establish the efficacy of the improved protocol in achieving low-redundancy synchronization in scenarios where deletion errors occur.