Data consistency for P2P collaborative editing

  title={Data consistency for P2P collaborative editing},
  author={G{\'e}rald Oster and Pascal Urso and Pascal Molli and Abdessamad Imine},
  booktitle={Conference on Computer Supported Cooperative Work},
Peer-to-peer (P2P) networks are very efficient for distributing content. We want to use this potential to allow not only distribution but collaborative editing of this content. Existing collaborative editing systems are centralised or depend on the number of sites. Such systems cannot scale when deployed on P2P networks. In this paper, we propose a new model for building a collaborative editing system. This model is fully decentralised and does not depend on the number of sites. 

Figures from this paper

Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks

The Logoot approach is evaluated and compared to others using a corpus of all the edits applied on a set of the most edited and the biggest pages of Wikipedia to provide a peer-to-peer collaborative editing system.

Logoot-Undo: Distributed Collaborative Editing System on P2P Networks

This paper presents the Logoot-Undo CRDT algorithm, which integrates the "undo anywhere, anytime” feature, and it is proved that the cost of the undo feature remains low on a corpus of data extracted from Wikipedia.

DTNDocs: A delay tolerant peer-to-peer collaborative editing system

This study develops the DTNDocs Android application to explore the possibility of developing a delay tolerant P2P collaborative editing system and uses IBR-DTN to communicate over adelay tolerant network and a modified LogootSplit algorithm for ensuring consistency in shared contents.

Managing Difference-Based Objects with Sub-networks in Peer-to-Peer Environments

This study addresses the issue of P2P modification by representing shared objects by their differences by storing them in a sub-network that is generated for each object.

Building a collaborative peer-to-peer wiki system on a structured overlay

P2P consistency support for large-scale interactive applications

Logoot: a P2P collaborative editing system

The Logoot approach is presented, evaluated and compared to others with a corpus of all the editions applied on a set of the most edited and biggest page of the Wikipedia, to provide a peer-to-peer collaborative editing system.

XWiki Concerto: A P2P Wiki System Supporting Disconnected Work

The XWiki Concerto system is presented, the P2P version of the XWiki server, based on replicating wiki pages on a network of wiki servers based on the Woot algorithm, designed to be scalable, to support the dynamic aspect of P1P networks and network partitions.

Scalable Tree-Based Consistency Maintenance in Heterogeneous P2P File Sharing Systems

The proposed scheme reduces the latency of SMART proposed by Nakashima and Fujita by 35%, and completes the propagation of update information within one second even if the number of replicas is 5000.

UniWiki: A Collaborative P2P System for Distributed Wiki Applications

A peer to peer solution for distributing and managing dynamic content, that combines two widely studied technologies: distributed hash tables (DHT) and optimistic replication, that is based on a Distributed Interception Middleware.



Real time group editors without Operational transformation

The WOOT (WithOut Operational Transformation) framework that ensures intention consistency without following the OT approach is described, which is drastically simpler, more efficient and does not require vector clocks or central sites.

A survey of peer-to-peer content distribution technologies

This survey proposes a framework for analyzing peer-to-peer content distribution technologies and focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in and affected by the architectural design decisions adopted by current peer- to-peer systems.

Epidemic information dissemination in distributed systems

Four key problems: membership maintenance, network awareness, buffer management,buffer management, and message filtering are described and some preliminary approaches to address them are suggested.

Optimistic replication

This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.

Copies convergence in a distributed real-time collaborative environment

Two new algorithms are presented that are based upon the impleðmentation of a continuous global order which enables that condition to be released, and simplifies the operation inteðgration process.

Providing high availability using lazy replication

This paper describes a new way of implementing causal operations that performs well in terms of response time, operation-processing capacity, amount of stored state, and number and size of messages; it does better than replication methods based on reliable multicast techniques.

A Majority consensus approach to concurrency control for multiple copy databases

A “majority consensus” algorithm which represents a new solution to the update synchronization problem for multiple copy databases is presented and can function effectively in the presence of communication and database site outages.

Preserving operation effects relation in group editors

A novel approach to solving divergence and operation effects relation violation in the same framework is proposed, which preserves the effects relation of concurrent operations so that convergence is achieved automatically.

Managing update conflicts in Bayou, a weakly connected replicated storage system

The motivation for and design of these mechanisms for conflict detection and per -write conflict resolution based on client-provid ed procedures are presented and the experiences gained with an initial implementation of the system are described.

Concurrent Undo Operations in Collaborative Environments Using Operational Transformation

This paper aims to highlight two general conditions that need to be satisfied by any transformation adapted to undo, and presents a general undo algorithm based on the definition of a generic undo-fitted transformation, which automatically verifies these conditions.