ABTS: A transformation-based consistency control algorithm for wide-area collaborative applications

@article{Shao2009ABTSAT,
  title={ABTS: A transformation-based consistency control algorithm for wide-area collaborative applications},
  author={Bin Shao and Du Li and Ning Gu},
  journal={2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing},
  year={2009},
  pages={1-10}
}
  • Bin ShaoDu LiNing Gu
  • Published 28 December 2009
  • Computer Science
  • 2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing
Operational transformation (OT) is an established optimistic consistency control method in collaborative applications. Most existing OT algorithms are developed under a well-accepted framework with a condition that cannot be formally proved. In addition, they generally support two character-based primitive operations, insert and delete, in a linear data structure. This paper proposes a novel OT algorithm that addresses the above two challenges as follows: First, it is based on a recent… 
View on IEEE
eudl.eu
20 Citations
Highly Influential Citations
7
Background Citations
10
Methods Citations
10

Tables from this paper

20 Citations

Inclusive transformation consistency control algorithm in distributed system

This study proposes a new string-based OT algorithm to address the challenge of swapping and transposing two deletions and it works well in all possible cases of transposingTwo deletions.

A Transformation based New Algorithm for Transforming Deletions in String Wise Operations for Wide-Area Collaborative Applications

This paper has proposed a new algorithm MSITDD that consider transformation of two deletions and give right result in all possible cases satisfying user intentions and has removed the faults of previous ITDD.

String Based New Operations -Find and Replace by New Operational Transformation Algorithms for Wide-Area Collaborative Applications

New algorithms that consider first time in history more new string operations that are Find and replace in addition to primitive operations like insert and delete, which can be applied in a wide range of practical collaborative applications.

An Optimized String Transformation Algorithm for Real-Time Group Editors

  • Bin ShaoDu LiNing Gu
  • Computer Science
    2009 15th International Conference on Parallel and Distributed Systems
  • 2009
A new OT algorithm is proposed that supports string primitives and reduces the time complexity to $O(|H|)$.

Analysis of Operational Transformation Algorithms

This work has done the literature review of the evolution of OT algorithms over the last 25 years since 1989 and categorization is done for all existing OT algorithms on the basis of major existing algorithms such as dOPT, adOPTed, GOT, GOTO, SDT, SOCT2,SOCT3/4, and ABT.

Sequence Related IT Functions for String Based Update Operations by New Operational Transformation Algorithms for Wide-Area Collaborative Applications

New algorithms LocalU and RemoteU are proposed for handling local and remote update operations of strings for both atomic and sequential operations and satisfy correctness criteria like causality preservation and admissibility preservation.

Cut-paste string operation for collaborative groupware applications

A new algorithm for cut-paste string operation is proposed with time complexity and space complexity of the order of O(|H|).

Constant-time operation transformation and integration for collaborative editing

  • Weihai Yu
  • Computer Science
    7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom)
  • 2011
This paper presents an approach that supports string operations and constant-time operation transformation and integration and is based on admissibility preservation, a correctness criterion with which the correctness of the approach can be formally proven.

Supporting String-Wise Operations and Selective Undo for Peer-to-Peer Group Editing

This paper presents an approach that combines and extends OT and CRDT strengths and supports string-wise editing operations and selective undo, and shows that it provides sufficient responsiveness to the end-users.

Consistency Maintenance of Collaborative Shared Documents in Unstable Network Environment

An algorithm to achieve the consistency maintenance of the shared documents during the collaborative editing process in the broken network environment is proposed and a case analysis and correctness proof are given to validate the whole strategy.

References

SHOWING 1-10 OF 12 REFERENCES

An Admissibility-Based Operational Transformation Framework for Collaborative Editing Systems

  • Du LiRui Li
  • Computer Science
    Computer Supported Cooperative Work (CSCW)
  • 2009
This paper proposes an alternative framework, called admissibility-based transformation (ABT), that is theoretically based on formalized, provable correctness criteria and practically no longer requires transformation functions to work under all conditions.

A New Operational Transformation Framework for Real-Time Group Editors

  • Rui LiDu Li
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2007
This paper analyzes the root of correctness problems in OT and establishes a novel operational transformation framework for developing OT algorithms and proving their correctness.

Context-Based Operational Transformation in Distributed Collaborative Editing Systems

This paper analyzes the limitation of the causality theory, proposes a novel theory of operation context as the new foundation for OT systems, and presents a new OT algorithm-Context-based OT (COT)-which provides uniform and efficient solutions to both consistency maintenance and undo problems.

An Approach to Ensuring Consistency in Peer-to-Peer Real-Time Group Editors

  • Du LiRui Li
  • Computer Science
    Computer Supported Cooperative Work (CSCW)
  • 2005
SDT is the first and the only OT algorithm proved to converge in peer-to-peer group editors and is based on a novel consistency model that is more explicitly formulated than previously established models for proving correctness.

Concurrent operations in a distributed and mobile collaborative environment

The principle objective of the paper is to present an algorithm that overcomes drawbacks in distributed and mobile collaborative environments based on the notion of user intention, and also on the construction of equivalent histories by exploiting and combining some general semantic properties such as forward/backward transposition.

Proving correctness of transformation functions in collaborative editing systems

This paper shows how a theorem prover can address this serious bottleneck of operational transformation and designs the tombstone transformation functions, which verify TP1 and TP2, preserve intentions and ensure multi-effect relationships.

Commutativity-based concurrency control in groupware

  • Rui LiDu Li
  • Computer Science
    2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing
  • 2005
A new consistency model is defined which greatly simplifies the design and proof of OT algorithms and is generally difficult to follow and verify in practice.

Concurrency control in groupware systems

An algorithm for concurrency control in real-time groupware systems is presented and its advantages are its simplicity of use and its responsiveness: users can operate directly on the data without obtaining locks.

A performance study of group editing algorithms

  • Du LiRui Li
  • Computer Science
    12th International Conference on Parallel and Distributed Systems - (ICPADS'06)
  • 2006
The experimental results show the extent to which current OT algorithms support synchronous and asynchronous group editing and reveal that the performance of OT actually depends on a number of factors.

Time, clocks, and the ordering of events in a distributed system

A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events, and a bound is derived on how far out of synchrony the clocks can become.