“…To overcome this limitation, several promising works have been proposed to host collaborative editing platforms in decentralized peer-to-peer architectures [4,16,23]. Most of these approaches assume that all users in a system edit the same document.…”
Section: Collaborative Editing and Cohort Constructionmentioning
confidence: 99%
“…Researchers have been looking into peer-to-peer collaborative editing platforms [4,9,11,12,16,23] for some time. Most of these approaches in decentralized peer-to-peer collaborative editing assume that all users in a system participate in the same edition.…”
Section: Related Workmentioning
confidence: 99%
“…They also differ from P2P networks as participants tend to remain stable, producing little churn. Several promising contributions [4,16,23] for decentralized peer-to-peer collaborative editing have already been proposed that can be ported to federations of plug computers. Most of the works generally assume that all nodes in the system edit the same document, or the same set of documents.…”
RésuméDistributed collaborative editors allow several remote users to contribute concurrently to the same document. Unfortunately, the currently deployed editors can only support a limited number of concurrent users. A number of peer-to-peer solutions have therefore been proposed to remove this limitation and allow a large number of users to work collaboratively. These approaches however tend to assume that all users edit the same set of documents, which is unlikely to be the case if such systems should become widely used and ubiquitous. In this paper we discuss a novel cohort-construction approach that allow users editing the same documents to rapidly find each other.
“…To overcome this limitation, several promising works have been proposed to host collaborative editing platforms in decentralized peer-to-peer architectures [4,16,23]. Most of these approaches assume that all users in a system edit the same document.…”
Section: Collaborative Editing and Cohort Constructionmentioning
confidence: 99%
“…Researchers have been looking into peer-to-peer collaborative editing platforms [4,9,11,12,16,23] for some time. Most of these approaches in decentralized peer-to-peer collaborative editing assume that all users in a system participate in the same edition.…”
Section: Related Workmentioning
confidence: 99%
“…They also differ from P2P networks as participants tend to remain stable, producing little churn. Several promising contributions [4,16,23] for decentralized peer-to-peer collaborative editing have already been proposed that can be ported to federations of plug computers. Most of the works generally assume that all nodes in the system edit the same document, or the same set of documents.…”
RésuméDistributed collaborative editors allow several remote users to contribute concurrently to the same document. Unfortunately, the currently deployed editors can only support a limited number of concurrent users. A number of peer-to-peer solutions have therefore been proposed to remove this limitation and allow a large number of users to work collaboratively. These approaches however tend to assume that all users edit the same set of documents, which is unlikely to be the case if such systems should become widely used and ubiquitous. In this paper we discuss a novel cohort-construction approach that allow users editing the same documents to rapidly find each other.
“…Replicas are consistent if their states are identical when they have applied the same set of operations. For our approach, we use the CRDT family of algorithms [36,42] which design operations to be commutative from the start. When reconciliation is performed, operations from the remote log, that have not been previously integrated into the local log, are simply appended to the end of the local log.…”
Within last years multi-synchronous collaborative editing systems became widely used. Multi-synchronous collaboration maintains multiple, simultaneous streams of activity which continually diverge and synchronized. These streams of activity are represented by means of logs of operations, i.e. user modifications. A malicious user might tamper his log of operations. At the moment of synchronization with other streams, the tampered log might generate wrong results. In this paper, we propose a solution relying on hash-chain based authenticators for authenticating logs that ensure the authenticity, the integrity of logs, and the user accountability. We present algorithms to construct authenticators and verify logs. We prove their correctness and provide theoretical and practical evaluations.
“…Afterward, we analyze the common cases that create a conflict during the merge procedure such as undo/redo operations [44], [31] and accidental clean merge [20]. Then, we adapt a solution to solve them by using operation-based approach.…”
Abstract-In asynchronous collaborative systems, merging is an essential component. It allows to reconcile modifications made concurrently as well as managing software change through branching. The collaborative system is in charge to propose a merge result that includes user's modifications. The users now have to check and adapt this result. The adaptation should be as effort-less as possible, otherwise, the users may get frustrated and will quit the collaboration.The objective of this paper is to improve the result quality of the textual merge tool that constitutes the default merge tool of distributed version control systems. The basic idea is to study the behavior of the concurrent modifications during merge procedure. We identified when the existing merge techniques under-perform, and we propose solutions to improve the quality of the merge. We finally compare with the traditional merge tool through a large corpus of collaborative editing.
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.