Asynchronous reconciliation based on operational transformation for P2P collaborative environments

Authors:
Michelle Cart;Jean Ferrie
Affiliations:
LIRMM, University Montpellier 2, CNRS, 161, rue Ada - 34392 Montpellier (France);LIRMM, University Montpellier 2, CNRS, 161, rue Ada - 34392 Montpellier (France)
Venue:
COLCOM '07 Proceedings of the 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing
Year:
2007

Citing 0
Cited 4

Peer-to-peer collaboration over XML documents

CDVE '08 Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering
Peer-to-Peer Semantic Wikis

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Multi-synchronous Collaborative Semantic Wikis

WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
srCE: a collaborative editing of scalable semantic stores on P2P networks

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

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.