Skip to Main content Skip to Navigation
Conference papers

Asynchronous Reconciliation based on Operational Transformation for P2P Collaborative Environments

Abstract : Reconciling divergent copies is a problem encountered in distributed systems, groupware, version control systems and personal work involving several mobile computing devices. Published reconciliation methods, whether synchronous or asynchronous, require some ordering facility provided either by a central component (master copy, sequencer) or by a fully distributed mechanism (timestamps, state vectors, ...). Nevertheless, scalability is limited. This paper presents an asynchronous algorithm based on Operational Transformations which provides the means to reconcile any number of copies, without this limitation. Copies can be modified (concurrently or not) and then reconciled pair-wise, at any time, regardless of the pair, while their convergence is achieved. Its main advantage is thus to enable free propagation of update operations while ensuring they will be ordered in the same global order.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00189691
Contributor : Jean Ferrié <>
Submitted on : Wednesday, November 21, 2007 - 4:56:32 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM

Identifiers

  • HAL Id : lirmm-00189691, version 1

Collections

Citation

Michelle Cart, Jean Ferrié. Asynchronous Reconciliation based on Operational Transformation for P2P Collaborative Environments. CollaborativeCom'07: 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing, Nov 2007, White Plains, New York, USA, pp.012. ⟨lirmm-00189691⟩

Share

Metrics

Record views

128