Improved Interactive Protocol for Synchronizing From Deletions

2025-12-06

AI Summary

This paper addresses the two-file synchronization problem where one file is a subsequence of the other, related via a constant deletion rate. To overcome the high redundancy and poor adaptability of conventional single-deletion synchronization protocols, we propose a novel interactive synchronization protocol that integrates multi-deletion error-correcting codes with generalized adaptive chunking, thereby relaxing the restrictive single-deletion repair assumption. Theoretically, we derive an upper bound on the communication bit complexity applicable to multiple classes of deletion codes. Algorithmically, we enhance recovery efficiency through probabilistic modeling and interactive alignment optimization. Experiments demonstrate that, across varying deletion rates, our protocol significantly reduces transmission overhead compared to baseline methods—achieving average reductions of 32%–58%—while improving synchronization throughput. The approach is particularly suitable for applications including cloud storage, genomic sequence alignment, and distributed systems.

Technology Category

• Search and Optimization: Evolutionary Computation
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Multiagent Systems: Agent Communication

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Security and Privacy: Large-scale security measurements
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs

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.

Problem

• Synchronizing files with constant deletion rates
• Reducing communication cost via multi-deletion codes
• Generalizing upper bounds for deletion correction protocols

Innovation

• Integrates multi-deletion correction codes into baseline protocol
• Uses general partitioning techniques to reduce communication cost
• Derives generalized upper bound for transmitted bits across codes