Using distributed consistent branching for efficient reconciliation of mobile workspaces
- 1 November 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
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 immediatley 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.Keywords
This publication has 15 references indexed in Scilit:
- Rufis: mobile data sharing using a generic constraint-oriented reconciler2004
- Adaptive plausible clocks2004
- Log-structured storage for efficient weakly-connected replication2004
- Lightweight version vectors for pervasive computing devices2002
- Version stamps-decentralized version vectors2002
- The IceCube approach to the reconciliation of divergent replicas2001
- The Bengal Database Replication SystemDistributed and Parallel Databases, 2001
- Flexible update propagation for weakly consistent replication1997
- Managing update conflicts in Bayou, a weakly connected replicated storage systemACM SIGOPS Operating Systems Review, 1995
- Cheaper matrix clocks1994