Logoot-Undo: Distributed Collaborative Editing System on P2P Networks

被引:61
作者
Weiss, Stephane [1 ]
Urso, Pascal [1 ]
Molli, Pascal [1 ]
机构
[1] Nancy Univ, LORIA, F-54506 Vandoeuvre Les Nancy, France
关键词
Collaborative editing; P2P; group undo; scalability; optimistic replication; CRDT; ALGORITHM;
D O I
10.1109/TPDS.2009.173
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:1162 / 1174
页数:13
相关论文
共 39 条
[11]  
Ferrié J, 2004, LECT NOTES COMPUT SC, V3290, P155
[12]  
Johnson P.R., 1975, 677 RFC
[13]   Necessary and sufficient conditions on information for causal message ordering and their optimal implementation [J].
Kshemkalyani, AD ;
Singhal, M .
DISTRIBUTED COMPUTING, 1998, 11 (02) :91-111
[14]   TIME, CLOCKS, AND ORDERING OF EVENTS IN A DISTRIBUTED SYSTEM [J].
LAMPORT, L .
COMMUNICATIONS OF THE ACM, 1978, 21 (07) :558-565
[15]   A new operational transformation framework for real-time group editors [J].
Li, Rui ;
Li, Du .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (03) :307-319
[16]  
Morris J.C., 2007, P 2007 INT S WIK, P69, DOI DOI 10.1145/1296951.1296959
[17]   An O(ND) Difference Algorithm and Its Variations [J].
Myers, Eugene W. .
ALGORITHMICA, 1986, 1 (1-4) :251-266
[18]  
Neuman B.C., 1994, CHAPTER SCALE DISTRI, P463
[19]  
OSTER G, 2009, P COLL PEER TO PEER, P21
[20]  
OSTER G, 2006, P 2 INT C COLL COMP