Return
Synchronization and Deduplication in Coded Distributed Storage Networks
DOI:10.1109/TNET.2015.2502274.png)
Abstract
En 中文
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.
Keywords:
Deduplication
deletions
distributed storage codes
file synchronization
insertions
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K

