%0 Conference Proceedings
%T Syncpal: A Simple and Iterative Reconciliation Algorithm for File Synchronizers
%+ Fraunhofer Institute for Applied Information Technology (Fraunhofer FIT)
%A Shekow, Marius
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Kongens Lyngby, Denmark
%Y José Pereira
%Y Laura Ricci
%I Springer International Publishing
%3 Distributed Applications and Interoperable Systems
%V LNCS-11534
%P 1-18
%8 2019-06-17
%D 2019
%R 10.1007/978-3-030-22496-7_1
%K File synchronizer
%K File system
%K Optimistic replication
%K Conflict detection
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Today file synchronizers are tools often used to facilitate collaboration scenarios and data management across multiple devices. They replicate the file system, e.g. from a cloud storage to a device disk, achieving convergence by only transmitting detected changes. A popular variant available in a plethora of products are state-based file synchronizers such as the Dropbox client. They detect operations by computing the difference between a previously persisted state and the respective current state. However, state-based synchronization is difficult because we need to detect and resolve conflicting operations as well as the propagation order of non-conflicting operations. This work presents Syncpal, an algorithm that reconciles two divergent file systems using an iterative approach. It first handles conflicts, one at a time, making sure that resolving one conflict does not negatively affect other ones, while avoiding conflicts whenever possible. It then finds order dependencies (and breaks cycles) between the remaining non-conflicting operations to avoid the violation of operation preconditions during propagation. This work is relevant for file synchronizer researchers and developers who want to improve their products with an algorithm whose iterative nature reduces the overall complexity and the probability of bugs. In addition to our proposed algorithm and a formal analysis of the underlying problem, our validation approach for the proposed algorithm includes the presentation of a full-scale implementation of an exemplary file system model.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-02319573/document
%2 https://inria.hal.science/hal-02319573/file/485766_1_En_1_Chapter.pdf
%L hal-02319573
%U https://inria.hal.science/hal-02319573
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-11534