imnotteixeira / dissertation

0 stars 0 forks source link

[Paper] Research on Conflict Resolution and Operation Consistency in Real-Time Collaborative Graphic Designing System #54

Closed imnotteixeira closed 3 years ago

imnotteixeira commented 3 years ago

https://www.scopus.com/record/display.uri?eid=2-s2.0-1642294260&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=56acf50be8881758341a862363bf9c81&sot=a&sdt=a&sl=58&s=TITLE-ABS-KEY%28real+W%2f1+time+conflict+resolution+algorithm%29&relpos=46&citeCnt=4&searchTerm=

Real-time collaborative graphic designing system is a special class of Computer-Supported Collaborative Work (CSCW) systems. It allows a group of users simultaneously view and design same graphics documents from geographically dispersed sites connected by computer networks. Conflict resolution and operation consistency remains one of the core issues in this type of systems. This paper discusses the problem about preserving consistency operations in face of conflict, and proposes a multi-version approach to resolve it. In the approach, first operations are divided into two categories, and then a new structure is adopted to represent these operations. It keeps the consistency of operations at very low cost by increasing multiple object versions in face of conflicts. The algorithms presented in this paper have been used in the CoDesign system. The result proves this approach can improve the system performance in the real-time collaborative graphic designing system.

imnotteixeira commented 3 years ago

Proposes a multi-version approach to resolving conflicts in a real-time multi-user graphic designing system. It is a CompatiblePrecedence approach since, unlike a Conflict-Precedence approach where the objects are locked for resolution by users in case of conflict, in this case the conflict resolution is done by the system. It proposes a classification of operations in one of two types: Non Multi-version Operations (NMO) and Multi-version Operations (MO). The first are operations that, when in conflict, can be resolved by choosing one of them. The latter are operations that are better suited to be decided by the users, hence keeping both versions of the operation history is necessary. To represent this model, it uses a left-subtree-child and right-subtree-sibling binary tree. The left-subtree represents the continuous conflict-resolved operations, and each node will have a right-child representing a conflicting operation, thus creating a different branch which can have its own history, by adding left children to that node. Finally, it proposes a set of algorithms to insert operations depending on their category - NMO or MO - and undo operations.