We consider the problem of synchronizing coded data in distributed storage networks undergoing insertion and deletion edits. We present modifications of distributed storage codes that allow updates in the parity-check values to be performed with one round of communication at low bit rates and with small storage overhead. Our main contributions are novel protocols for synchronizing frequently updated and semi-static data based on functional intermediary coding involving permutation and Vandermonde matrices.
['Salim El Rouayheb', 'Sreechakra Goparaju', 'Han Mao Kiah', 'Olgica Milenkovic']
Synchronization and Deduplication in Coded Distributed Storage Networks