DocumentCode
2596963
Title
Using distributed consistent branching for efficient reconciliation of mobile workspaces
Author
Hupfeld, Felix ; Gordon, Minor
Author_Institution
Zuse Institute Berlin, Takustr. 7, 14195 Berlin, Germany, Email: hupfeld@zib.de
fYear
2006
fDate
Nov. 2006
Firstpage
1
Lastpage
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
Algorithm design and analysis; Change detection algorithms; Collaborative work; Frequency; Mobile communication; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Collaborative Computing: Networking, Applications and Worksharing, 2006. CollaborateCom 2006. International Conference on
Conference_Location
Atlanta, GA, USA
Print_ISBN
1-4244-0429-0
Electronic_ISBN
1-4244-0429-0
Type
conf
DOI
10.1109/COLCOM.2006.361860
Filename
4207532
Link To Document