Book section Open Access

From Rational Number Reconstruction to Set Reconciliation and File Synchronization

Amarilli, Antoine; Ben Hamouda, Fabrice; Bourse, Florian; Morisset, Robin; Naccache, David; Rauzy, Pablo

Citation Style Language JSON Export

  "DOI": "10.1007/978-3-642-41157-1_1", 
  "container_title": "Lecture Notes in Computer Science", 
  "author": [
      "given": "Antoine", 
      "family": "Amarilli"
      "given": "Fabrice", 
      "family": "Ben Hamouda"
      "given": "Florian", 
      "family": "Bourse"
      "given": "Robin", 
      "family": "Morisset"
      "given": "David", 
      "family": "Naccache"
      "given": "Pablo", 
      "family": "Rauzy"
  "issued": {
    "date-parts": [
  "abstract": "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 \u2014 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.\nWe 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.", 
  "title": "From Rational Number Reconstruction to Set Reconciliation and File Synchronization", 
  "page": "1-18", 
  "type": "chapter", 
  "id": "33991"
Views 276
Downloads 93
Data volume 43.3 MB
Unique views 265
Unique downloads 93


Cite as