Book section Open Access
Amarilli, Antoine;
Ben Hamouda, Fabrice;
Bourse, Florian;
Morisset, Robin;
Naccache, David;
Rauzy, Pablo
This work revisits set reconciliation, the problem of synchronizing two multisets of fixed-size values while minimizing transmission complexity. We propose a new number-theoretic reconciliation protocol called Divide and Factor (D&F;) that achieves optimal asymptotic transmission complexity — as do previously known alternative algorithms. We analyze the computational complexities of various D&F; variants, study the problem of synchronizing sets of variable-size files using hash functions and apply D&F; to synchronize file hierarchies taking file locations into account. We describe btrsync, our open-source D&F; implementation, and benchmark it against the popular software rsync. It appears that btrsync transmits much less data than rsync, at the expense of a relatively modest computational overhead.
Name | Size | |
---|---|---|
article.pdf
md5:48ecbc5a2794e217e0a780b9cf9227ea |
465.1 kB | Download |
Views | 246 |
Downloads | 82 |
Data volume | 38.1 MB |
Unique views | 241 |
Unique downloads | 82 |