IEEE Transactions on Parallel and Distributed Systems · 2010 · 123 citations · 28 references
ComputingComputer ScienceInformation TechnologyComputer NetworksDistributed SystemsKnowledge StoragePeer-to-peer NetworkingPeer-to-peer NetworksPeer-to-peer SystemsVersion ControlCollaborative Authoring SystemsCollaborative Document EditingConsistency In Peer-to-peer SystemsContent DistributionGlobal Performance AnalysisPeer-to-peer Computing
Peer-to-peer systems provide scalable content distribution for cheap and resist to censorship attempts. However, P2P networks mainly distribute immutable content and provide poor support for highly dynamic content such as produced by collaborative systems. A new class of algorithms called CRDT (Commutative Replicated Data Type), which ensures consistency of highly dynamic content on P2P networks, is emerging. However, if existing CRDT algorithms support the "edit anywhere, anytime” feature, they do not support the "undo anywhere, anytime” feature. In this paper, we present the Logoot-Undo CRDT algorithm, which integrates the "undo anywhere, anytime” feature. We compare the performance of the proposed algorithm with related algorithms and measure the impact of the undo feature on the global performance of the algorithm. We prove that the cost of the undo feature remains low on a corpus of data extracted from Wikipedia.
28
AnO(ND) difference algorithm and its variations
Eugene W. Myers · Algorithmica · 1986 · 899 citations
Concurrency control in groupware systems
Colter Ellis, S. Gibbs · ACM SIGMOD Record · 1989 · 867 citations
Concurrency control in groupware systems
Colter Ellis, S. Gibbs · 1989 · 451 citations · Full text