Using distributed consistent branching for efficient reconciliation of mobile workspaces

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...

Full description

Saved in:
Bibliographic Details
Published in2006 International Conference on Collaborative Computing : Networking, Applications, and Worksharing : 17-20 November 2006 : Atlanta, GA pp. 1 - 9
Main Authors Hupfeld, F., Gordon, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2006
Subjects
Algorithm design and analysis
Change detection algorithms
Collaborative work
Frequency
Mobile communication
Scalability
Online AccessGet full text
ISBN9781424404285
1424404282
DOI10.1109/COLCOM.2006.361837

Cover

More Information
Summary: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
ISBN:9781424404285
1424404282
DOI:10.1109/COLCOM.2006.361837