Skip to content Home Contact Mobile MyRMIT Library A-Z
RMIT UniversityResearch Repository
 

Conflict management for real-time collaborative editing in mobile replicated architecture

Citro, S, McGovern, J and Ryan, C 2007, 'Conflict management for real-time collaborative editing in mobile replicated architecture', in Proceedings of the Thirtieth Australasian Computer Science Conference, Ballarat, Vic., 30 January - 2 February 2007.

Document type: Conference Paper
Collection: Conference Papers

Title Conflict management for real-time collaborative editing in mobile replicated architecture
Author(s) Citro, S
McGovern, J
Ryan, C
Year 2007
Conference name Australasian Computer Science Conference
Conference location Ballarat, Vic.
Conference dates 30 January - 2 February 2007
Proceedings title Proceedings of the Thirtieth Australasian Computer Science Conference
Publisher Australian Computer Society
Place of publication Australia
Abstract Mobile technology is particularly suited to a fully distributed (replicated) architecture for collaborative work. Users can maintain their own document copies, and can continue to work in the absence of a central server. However, in a replicated architecture, conflicts can occur when two or more users concurrently modify the same object in a shared document. Such conflicts can be classified as non-exclusive or exclusive. Non-exclusive conflicts, where conflicting operations can be realized at the same time, can be handled using conventional consistency management techniques such as operational transformation. On the other hand, exclusive conflicts can only be realised in different document versions. Although post-locking (Xue, Zhang, and Sun 2001) can be used to limit the number of versions that are created and thus reduce storage requirements in constrained mobile devices, it introduces two problems: a partial-intention problem and the need to synchronise locks before the conflict can be resolved. This paper introduces an algorithm that integrates operational transformation and multi-versioning to resolve the different types of conflict. The algorithm uses delayed post-locking to solve the partial-intention problem by making use of user intention locks. It also uses conflict tables to better facilitate the resolution of conflict as soon as possible without requiring sites to receive all operations.
Subjects Computer Software not elsewhere classified
Copyright notice © 2007 Australian Computer Society, Inc.
 
Versions
Version Filter Type
Access Statistics: 19 Abstract Views  -  Detailed Statistics
Created: Tue, 01 Sep 2009, 10:52:41 EST by Catalyst Administrator