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

Massive collaborative editing becomes a reality through leading projects such as Wikipedia. This massive collaboration is currently supported with a costly central service. In order to avoid such costs, we aim to provide a peer-to-peer collaborative editing system. Existing approaches to build distributed collaborative editing systems either do not scale in terms of number of users or in terms of number of edits. We present the Logoot approach that scales in these both dimensions while ensuring causality, consistency and intention preservation criteria. We evaluate the Logoot approach and compare it to others using a corpus of all the edits applied on a set of the most edited and the biggest pages of Wikipedia.

[1]  David Sun,et al.  Leveraging single-user applications for multi-user collaboration: the coword approach , 2004, CSCW.

[2]  Chengzheng Sun,et al.  Operational transformation in real-time group editors: issues, algorithms, and achievements , 1998, CSCW '98.

[3]  Joonwon Lee,et al.  How to Design Optimistic Operations for Peer-to-Peer Replication , 2006, JCIS.

[4]  Rich Salz,et al.  InterNetNews: Usenet Transport for Internet Sites , 1992, USENIX Summer.

[5]  Yasushi Saito,et al.  Optimistic replication , 2005, CSUR.

[6]  Pascal Molli,et al.  Data consistency for P2P collaborative editing , 2006, CSCW '06.

[7]  Yanchun Zhang,et al.  Achieving convergence, causality preservation, and intention preservation in real-time cooperative editing systems , 1998, TCHI.

[8]  Pascal Molli,et al.  Wooki: A P2P Wiki-Based Collaborative Writing Tool , 2007, WISE.

[9]  Jean Ferrié,et al.  Concurrent operations in a distributed and mobile collaborative environment , 1998, Proceedings 14th International Conference on Data Engineering.

[10]  Jean Ferrié,et al.  Asynchronous reconciliation based on operational transformation for P2P collaborative environments , 2007, 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007).

[11]  Jean Ferrié,et al.  Serialization of concurrent operations in a distributed collaborative environment , 1997, GROUP.

[12]  J. Nahman,et al.  A new algorithm for service restoration in large-scale urban distribution systems , 1994 .

[13]  Florian Schintke,et al.  Scalaris: reliable transactional p2p key/value store , 2008, ERLANG '08.

[14]  Marc Shapiro,et al.  Designing a commutative replicated data type , 2007, ArXiv.

[15]  Rui Li,et al.  An Approach to Ensuring Consistency in Peer-to-Peer Real-Time Group Editors , 2005, Computer Supported Cooperative Work (CSCW).

[16]  Pascal Molli,et al.  An Undo Framework for P2P Collaborative Editing , 2008, CollaborateCom.

[17]  Friedemann Mattern,et al.  Virtual Time and Global States of Distributed Systems , 2002 .

[18]  Pascal Molli,et al.  Tombstone Transformation Functions for Ensuring Consistency in Collaborative Editing Systems , 2006, 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing.

[19]  Clarence A. Ellis,et al.  Concurrency control in groupware systems , 1989, SIGMOD '89.

[20]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[21]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[22]  B. Neuman.  Scale in Distributed Systems , 1994 .

[23]  Mukesh Singhal,et al.  An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments , 1997, J. Parallel Distributed Comput..