Research Article
Using distributed consistent branching for efficient reconciliation of mobile workspaces
@INPROCEEDINGS{10.1109/COLCOM.2006.361837, author={Felix Hupfeld and Minor Gordon}, title={Using distributed consistent branching for efficient reconciliation of mobile workspaces}, proceedings={2nd International ICST Conference on Collaborative Computing: Networking, Applications and Worksharing}, publisher={IEEE}, proceedings_a={COLLABORATECOM}, year={2007}, month={5}, keywords={Algorithm design and analysis Change detection algorithms Collaborative work Frequency Mobile communication Scalability}, doi={10.1109/COLCOM.2006.361837} }- Felix Hupfeld
Minor Gordon
Year: 2007
Using distributed consistent branching for efficient reconciliation of mobile workspaces
COLLABORATECOM
IEEE
DOI: 10.1109/COLCOM.2006.361837
Abstract
Optimistic replication allows mobile workspaces to remain accessible during interrupted network access, but require consecutive handling of any conflicts. When conflict handling requires manual intervention by the user, the system must not require that conflicts are resolved immediately after their detection. We present a log-based algorithm for reconciling changes to replicated data that supports deferred manual conflict resolution, while sharing the favorable scalability properties of log-based approaches of small storage and communication overhead. Simulation results validate our design and show that it compares favorably in the relevant metrics with version vector-based designs.
Copyright © 2006–2024 IEEE
