Abstract:Real-time collaborative editors are common tools for distributing work across space, time, and organizations. Unfortunately, mainstream editors such as Google Docs rely on central servers and raise privacy and scalability issues. Crate is a real-time decentralized collaborative editor that runs directly in web browsers thanks to WebRTC. Compared to state-of-the-art, Crate is the first real-time editor that only requires browsers in order to support collaborative editing and to transparently handle from small t… Show more
“…CRDT 17,18 is a new framework of data structure where all concurrent updating operations must commute to ensure convergence in collaborative systems. Initially, the algorithm has been successfully applied to different data structures in collaborative systems 33,34 for linear data type, 35 tree document data type, 17 semistructured data type, 36 and JSON document 37 . Recently, many CRDT are proposed to support collaborative editing of semantic stores.…”
With the advent of Web 2.0, numerous collaborative annotation systems have been developed in an effort to enable distant users to annotate the same multimedia resources such as texts, audio, images, and videos. However, the existing systems do not support the semantic aspect of the data available on the Web and ignore the convergence aspect when executing concurrent annotations. Based on the technologies of Semantic Web, this article presents a new conflict-free replicated data type called OAC-Set, which extends Open Annotation Collaboration data model to enable concurrent annotations while guaranteeing convergence, causality, and intention preservation criteria. The experimental results show that our approach is efficient and effective.
“…CRDT 17,18 is a new framework of data structure where all concurrent updating operations must commute to ensure convergence in collaborative systems. Initially, the algorithm has been successfully applied to different data structures in collaborative systems 33,34 for linear data type, 35 tree document data type, 17 semistructured data type, 36 and JSON document 37 . Recently, many CRDT are proposed to support collaborative editing of semantic stores.…”
With the advent of Web 2.0, numerous collaborative annotation systems have been developed in an effort to enable distant users to annotate the same multimedia resources such as texts, audio, images, and videos. However, the existing systems do not support the semantic aspect of the data available on the Web and ignore the convergence aspect when executing concurrent annotations. Based on the technologies of Semantic Web, this article presents a new conflict-free replicated data type called OAC-Set, which extends Open Annotation Collaboration data model to enable concurrent annotations while guaranteeing convergence, causality, and intention preservation criteria. The experimental results show that our approach is efficient and effective.
“…These are not practical assumptions. In practice, processes may join and leave the system at any time; and processes may reconfigure their neighborhood at any time [4]. Figure 3 shows an example of message dissemination in dynamic settings where causal delivery is violated.…”
Section: Background and Motivationsmentioning
confidence: 99%
“…Causal broadcast [1] is a fundamental building block of many distributed applications [2] such as distributed social networks [3], distributed collaborative software [4,5], or distributed data stores [6,7,8,9,10]. Causal broadcast is a reliable broadcast where all connected processes deliver each broadcast message exactly once following the happen before relationship [11,12]: when Alice comments Bob's picture, everyone receives the comment after the picture; unrelated events are delivered in any order.…”
Many distributed protocols and applications rely on causal broadcast to ensure consistency criteria. However, none of causality tracking state-of-the-art approaches scale in large and dynamic systems. This paper presents a new nonblocking causal broadcast protocol suited for dynamic systems. The proposed protocol outperforms state-of-the-art in size of messages, execution time complexity, and local space complexity. Most importantly, messages piggyback control information the size of which is constant. We prove that for both static and dynamic systems. Consequently, large and dynamic systems can finally afford causal broadcast.
“…As with OT, several CRDTs for text documents have been developed, including RGA [Roh et al 2011], Treedoc [Preguiça et al 2009], WOOT [Oster et al 2006b], Logoot , and LSEQ [Nédelec et al 2016[Nédelec et al , 2013. Other datatypes include registers and counters [Shapiro et al 2011a,b], maps [Baquero et al 2016], sets [Bieniusa et al 2012a,b], XML [Martin et al 2010], and JSON trees .…”
Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still poorly understood. Indeed, many published algorithms have later been shown to be incorrect, even some that were accompanied by supposed mechanised proofs of correctness. In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We develop a modular and reusable framework in the Isabelle/HOL interactive proof assistant for verifying the correctness of CRDT algorithms. We avoid correctness issues that have dogged previous mechanised proofs in this area by including a network model in our formalisation, and proving that our theorems hold in all possible network behaviours. Our axiomatic network model is a standard abstraction that accurately reflects the behaviour of real-world computer networks. Moreover, we identify an abstract convergence theorem, a property of order relations, which provides a formal definition of strong eventual consistency. We then obtain the first machine-checked correctness theorems for three concrete CRDTs: the Replicated Growable Array, the Observed-Remove Set, and an Increment-Decrement Counter. We find that our framework is highly reusable, developing proofs of correctness for the latter two CRDTs in a few hours and with relatively little CRDT-specific code.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.