-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbibliographie.bib
1230 lines (1123 loc) · 46.6 KB
/
bibliographie.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@techreport{nedelec2015spray,
TITLE = {{Spray: an Adaptive Random Peer Sampling Protocol}},
AUTHOR = {N{\'e}delec, Brice and Tanke, Julian and Frey, Davide and Molli,
Pascal and Mostefaoui, Achour},
URL = {https://hal.archives-ouvertes.fr/hal-01203363},
TYPE = {Technical Report},
INSTITUTION = {{LINA-University of Nantes ; INRIA Rennes - Bretagne
Atlantique}},
YEAR = {2015},
MONTH = Sep,
PDF = {https://hal.archives-ouvertes.fr/hal-01203363/file/spray.pdf},
HAL_ID = {hal-01203363},
HAL_VERSION = {v1},
}
@article{burckhardt2014replicated,
author = {Burckhardt, Sebastian and Gotsman, Alexey and Yang, Hongseok and
Zawirski, Marek},
title = {Replicated Data Types: Specification, Verification, Optimality},
journal = {SIGPLAN Not.},
issue_date = {January 2014},
volume = {49},
number = {1},
month = jan,
year = {2014},
issn = {0362-1340},
pages = {271--284},
numpages = {14},
url = {http://doi.acm.org/10.1145/2578855.2535848},
doi = {10.1145/2578855.2535848},
acmid = {2535848},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {eventual consistency, replication, weak memory},
}
@inproceedings{gifford1979weighted,
author = {Gifford, David K.},
title = {Weighted Voting for Replicated Data},
booktitle = {Proceedings of the Seventh ACM Symposium on Operating Systems
Principles},
series = {SOSP '79},
year = {1979},
isbn = {0-89791-009-5},
location = {Pacific Grove, California, USA},
pages = {150--162},
numpages = {13},
url = {http://doi.acm.org/10.1145/800215.806583},
doi = {10.1145/800215.806583},
acmid = {806583},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Computer network, File suite, File system, Locking, Quorum,
Replicated data, Representative, Transaction, Weak
representative, Weighted voting},
}
@inproceedings{alsberg1976principle,
author = {Alsberg, Peter and Day, John},
title = {A Principle for Resilient Sharing of Distributed Resources},
booktitle = {Proceedings of the 2nd International Conference on Software
Engineering},
series = {ICSE '76},
year = {1976},
location = {San Francisco, California, USA},
pages = {562--570},
numpages = {9},
url = {http://dl.acm.org/citation.cfm?id=800253.807732},
acmid = {807732},
publisher = {IEEE Computer Society Press},
address = {Los Alamitos, CA, USA},
keywords = {Distributed computer systems, Distributed control, Resilient
protocols, Resilient resource sharing, Resource sharing},
}
@techreport{mell2011national,
author = {Mell, Peter and Grance, Timothy},
title = {SP 800-145. The NIST Definition of Cloud Computing},
year = {2011},
publisher = {National Institute of Standards \& Technology},
address = {Gaithersburg, MD, United States},
}
@misc{gellman2013us,
author={Gellman, Barton and Poitras, Laura},
title={{U}.{S}., British intelligence mining data from nine {U}.{S}. Internet companies in broad secret program},
editor={washingtonpost.com},
month={June},
year={2013},
note = {\href{https://www.washingtonpost.com/investigations/us-intelligence-mining-data-from-nine-us-internet-companies-in-broad-secret-program/2013/06/06/3a0c0da8-cebf-11e2-8845-d970ccb04497_story.html}{washingtonpost.com} {[Online; posted 7-June-2013]}}
}
@article{giles2005internet,
author={Giles, Jim},
title={Internet encyclopaedias go head to head},
journal={Nature},
year={2005},
month={Dec},
day={15},
volume={438},
number={7070},
pages={900-901},
issn={0028-0836},
doi={10.1038/438900a},
url={http://dx.doi.org/10.1038/438900a}
}
@inproceedings{mehdi2014merging,
author = {Mehdi, Ahmed-Nacer and Urso, Pascal and Balegas, Valter and
Pergui\c{c}a, Nuno},
title = {Merging OT and CRDT Algorithms},
booktitle = {Proceedings of the First Workshop on Principles and Practice of
Eventual Consistency},
series = {PaPEC '14},
year = {2014},
isbn = {978-1-4503-2716-9},
location = {Amsterdam, The Netherlands},
pages = {9:1--9:4},
articleno = {9},
numpages = {4},
url = {http://doi.acm.org/10.1145/2596631.2596636},
doi = {10.1145/2596631.2596636},
acmid = {2596636},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {algorithms, cloud, collaborative editing, commutative replicated data types, experimentation, operational transformation, performance},
}
@article{birman1999bimodal,
author = {Birman, Kenneth P. and Hayden, Mark and Ozkasap, Oznur and Xiao,
Zhen and Budiu, Mihai and Minsky, Yaron},
title = {Bimodal Multicast},
journal = {ACM Trans. Comput. Syst.},
issue_date = {May 1999},
volume = {17},
number = {2},
month = may,
year = {1999},
issn = {0734-2071},
pages = {41--88},
numpages = {48},
url = {http://doi.acm.org/10.1145/312203.312207},
doi = {10.1145/312203.312207},
acmid = {312207},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{bailis2013eventual,
author = {Bailis, Peter and Ghodsi, Ali},
title = {Eventual Consistency Today: Limitations, Extensions, and Beyond},
journal = {Commun. ACM},
issue_date = {May 2013},
volume = {56},
number = {5},
month = may,
year = {2013},
issn = {0001-0782},
pages = {55--63},
numpages = {9},
url = {http://doi.acm.org/10.1145/2447976.2447992},
doi = {10.1145/2447976.2447992},
acmid = {2447992},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{jelasity2007gossip,
title={Gossip-based peer sampling},
author={Jelasity, M{\'a}rk and Voulgaris, Spyros and Guerraoui, Rachid and Kermarrec, Anne-Marie and Van Steen, Maarten},
journal={ACM Transactions on Computer Systems (TOCS)},
volume={25},
number={3},
pages={8},
year={2007},
publisher={ACM}
}
@article{dabek2004vivaldi,
author = {Dabek, Frank and Cox, Russ and Kaashoek, Frans and Morris, Robert},
title = {Vivaldi: A Decentralized Network Coordinate System},
journal = {SIGCOMM Comput. Commun. Rev.},
issue_date = {October 2004},
volume = {34},
number = {4},
month = aug,
year = {2004},
issn = {0146-4833},
pages = {15--26},
numpages = {12},
url = {http://doi.acm.org/10.1145/1030194.1015471},
doi = {10.1145/1030194.1015471},
acmid = {1015471},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Vivaldi, internet topology, network coordinates}
}
@inproceedings{blasa2011symmetric,
month = {November},
author = {Francesco Blasa and Simone Cafiero and Giancarlo Fortino and
Giuseppe Di Fatta},
note = {ISBN: 9781612081731},
booktitle = {Proceedings of AP2PS 2011, the Third International Conference on
Advances in P2P Systems},
title = {Symmetric Push-Sum Protocol for decentralised aggregation},
publisher = {IARIA},
pages = {27--32},
year = {2011},
keywords = {peer-to-peer computing; distributed aggregation algorithms; gossip protocols; extreme scale computing},
url = {http://centaur.reading.ac.uk/27055/}
}
@INPROCEEDINGS{flajolet2008hyperloglog,
author = {Philippe Flajolet and {\'E}ric Fusy and Olivier Gandouet and et al.},
title = {Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm},
booktitle = {Proceedings of the 2007 International Conference on Analysis of Algorithms},
year = {2007},
publisher = {}
}
@incollection{tolgyeski2009adaptive,
year={2009},
isbn={978-3-642-03868-6},
booktitle={Euro-Par 2009 Parallel Processing},
volume={5704},
series={Lecture Notes in Computer Science},
editor={Sips, Henk and Epema, Dick and Lin, Hai-Xiang},
doi={10.1007/978-3-642-03869-3_50},
title={Adaptive Peer Sampling with Newscast},
url={http://dx.doi.org/10.1007/978-3-642-03869-3_50},
publisher={Springer Berlin Heidelberg},
author={T{\"o}lgyesi, Norbert and Jelasity, M{\'a}rk},
pages={523-534},
language={English}
}
@article{eugster2003lightweight,
author = {Eugster, P. Th. and Guerraoui, R. and Handurukande, S. B. and
Kouznetsov, P. and Kermarrec, A.-M.},
title = {Lightweight Probabilistic Broadcast},
journal = {ACM Transactions on Computer Systems (TOCS)},
issue_date = {November 2003},
volume = {21},
number = {4},
month = nov,
year = {2003},
issn = {0734-2071},
pages = {341--374},
numpages = {34},
url = {http://doi.acm.org/10.1145/945506.945507},
doi = {10.1145/945506.945507},
acmid = {945507},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Broadcast, buffering, garbage collection, gossip, noise,
randomization, reliability, scalability},
}
@article{erdos1959random,
title={On random graphs I.},
author={Erd{\H o}s, P and R{\' e}nyi, A},
journal={Publ. Math. Debrecen},
volume={6},
pages={290--297},
year={1959}
}
@MISC{mane05network,
author = {Eep Mane and Eep Mopuru and Kriti Mehra and Eep Mane and Eep Mopuru
and Kriti Mehra and Jaideep Srivastava},
title = {Network Size Estimation In A Peer-to-Peer Network},
year = {2005}
}
@incollection{voulgaris2005epidemic,
year={2005},
isbn={978-3-540-28700-1},
booktitle={Euro-Par 2005 Parallel Processing},
volume={3648},
series={Lecture Notes in Computer Science},
editor={Cunha, JoséC. and Medeiros, PedroD.},
doi={10.1007/11549468_125},
title={Epidemic-Style Management of Semantic Overlays for Content-Based
Searching},
url={http://dx.doi.org/10.1007/11549468_125},
publisher={Springer Berlin Heidelberg},
author={Voulgaris, Spyros and van Steen, Maarten},
pages={1143-1152},
language={English}
}
@article{jelasity2009tman,
title = "T-Man: Gossip-based fast overlay topology construction ",
journal = "Computer Networks ",
volume = "53",
number = "13",
pages = "2321 - 2339",
year = "2009",
note = "Gossiping in Distributed Systems ",
issn = "1389-1286",
doi = "http://dx.doi.org/10.1016/j.comnet.2009.03.013",
url = "http://www.sciencedirect.com/science/article/pii/S1389128609001224",
author = "Márk Jelasity and Alberto Montresor and Ozalp Babaoglu",
keywords = {Gossip-based protocols;Overlay networks,Bootstrapping,Self-organizing middleware}
}
@INPROCEEDINGS{montresor2004robust,
author={Montresor, A. and Jelasity, M. and Babaoglu, O.},
booktitle={2004 International Conference on Dependable Systems and Networks},
title={Robust aggregation protocols for large-scale overlay networks},
year={2004},
month={June},
pages={19-28},
keywords={distributed memory systems;large-scale systems;peer-to-peer computing;protocols;resource allocation;aggregation protocols;antientropy aggregation;antientropy epidemic communication model;distributed networks;distributed storage systems;distributed systems;load-balancing protocols;overlay networks;peer-to-peer networks;Aggregates;Computer networks;Computer science;Control systems;Distributed computing;Large-scale systems;Monitoring;Peer to peer computing;Protocols;Robustness},
doi={10.1109/DSN.2004.1311873}}
@INPROCEEDINGS{jelasity2004epidemic,
author={Jelasity, M. and Montresor, A.},
booktitle={Proceedings. 24th International Conference on Distributed Computing
Systems, 2004},
title={Epidemic-style proactive aggregation in large overlay networks},
year={2004},
month={},
pages={102-109},
keywords={aggregation;computer networks;distributed algorithms;distributed decision making;large-scale systems;protocols;automatic system maintenance;collaborative environment;collective decision making;databases;distributed environment;epidemic-style proactive aggregation protocol;large-scale system;network topology;numeric computation;overlay network;Aggregates;Centralized control;Collaboration;Databases;Decision making;Distributed computing;Intelligent networks;Large-scale systems;Peer to peer computing;Protocols},
doi={10.1109/ICDCS.2004.1281573},
ISSN={1063-6927}}
@article{ganesh2007peer,
year={2007},
issn={0178-2770},
journal={Distributed Computing},
volume={20},
number={4},
doi={10.1007/s00446-007-0027-z},
title={Peer counting and sampling in overlay networks based on random walks},
url={http://dx.doi.org/10.1007/s00446-007-0027-z},
publisher={Springer-Verlag},
author={Ganesh, A.J. and Kermarrec, A.-M. and Le Merrer, E. and Massouli{\'e}, L.},
pages={267-278},
language={English}
}
@inproceedings{montresor2009peersim,
Author = {Alberto Montresor and M\'{a}rk Jelasity},
Title = {PeerSim: A Scalable {P2P} Simulator},
Booktitle = {Proc. of the 9th Int. Conference on Peer-to-Peer (P2P'09)},
Year = {2009},
Month = sep,
Pages = {99-100},
Address = {Seattle, WA}
}
@ONLINE{webtorrent,
title = {WebTorrent},
url = {https://github.com/feross/webtorrent}
}
@ONLINE{peerjs,
title = {PeerJS},
url = {http://peerjs.com}
}
@ONLINE{sharefest,
title = {Sharefest},
url = {https://www.sharefest.me}
}
@ONLINE{webrtc,
title = {WebRTC},
url = {http://www.webrtc.org}
}
@ONLINE{firefoxhello,
title = {Firefox Hello},
url = {https://www.mozilla.org/fr/firefox/hello}
}
@article{kostoulas2007active,
title = "Active and passive techniques for group size estimation in large-scale
and dynamic distributed systems ",
journal = "Journal of Systems and Software ",
volume = "80",
number = "10",
pages = "1639 - 1658",
year = "2007",
note = "Methodology of Security Engineering for Industrial Security Management
Systems ",
issn = "0164-1212",
doi = "http://dx.doi.org/10.1016/j.jss.2007.01.014",
url = "http://www.sciencedirect.com/science/article/pii/S016412120700012X",
author = "Dionysios Kostoulas and Dimitrios Psaltoulis and Indranil Gupta and
Kenneth P. Birman and Alan J. Demers",
keywords = "Large-scale distributed systems",
keywords = "Group size estimation",
keywords = "Probabilistic protocols",
keywords = "Algorithm design and analysis",
keywords = "Epidemics "
}
@ARTICLE{baquero2012extrema,
author={Baquero, C. and Almeida, P.S. and Menezes, R. and Jesus, P.},
journal={IEEE Transactions on Parallel and Distributed Systems},
title={Extrema Propagation: Fast Distributed Estimation of Sums and Network
Sizes},
year={2012},
month={April},
volume={23},
number={4},
pages={668-675},
keywords={distributed algorithms;maximum likelihood estimation;peer-to-peer
computing;resource allocation;telecommunication network
routing;data aggregation;dimension distributed hash
table;direct load balancing;distributed
aggregation;distributed computation;extrema
propagation;global system property;message exchange;message
loss;multipath routing;network size estimation;nonidempotent
function;peer-to-peer network;probabilistic
technique;self-adaptive distributed algorithm;sensor
network;sums
estimation;Convergence;Encoding;Estimation;Exponential
distribution;Measurement;Protocols;Reactive
power;Aggregation;distributed sums;network size
estimation;probabilistic estimation;self-configuration.},
doi={10.1109/TPDS.2011.209},
ISSN={1045-9219}}
@incollection{ganesh2001scamp,
year={2001},
isbn={978-3-540-42824-4},
booktitle={Networked Group Communication},
volume={2233},
series={Lecture Notes in Computer Science},
editor={Crowcroft, Jon and Hofmann, Markus},
doi={10.1007/3-540-45546-9_4},
title={Scamp: Peer-to-Peer Lightweight Membership Service for Large-Scale Group
Communication},
url={http://dx.doi.org/10.1007/3-540-45546-9_4},
publisher={Springer Berlin Heidelberg},
keywords={Scalability; reliability; peer-to-peer; gossip-based probabilistic
multicast; membership; group communication; random graphs},
author={Ganesh, AyalvadiJ. and Kermarrec, Anne-Marie and Massouli{\'e}, Laurent},
pages={44-55},
language={English}
}
@ARTICLE{ganesh2003peer,
author={Ganesh, A.J. and Kermarrec, A.-M. and Massouli{\'e}, L.},
journal={IEEE Transactions on Computers},
title={Peer-to-peer membership management for gossip-based protocols},
year={2003},
month={Feb},
volume={52},
number={2},
pages={139-149},
keywords={Internet;multicast protocols;probability;Internet-wide distributed applications;SCAMP;Scalable Membership protocol;convergence;decentralized protocol;gossip-based protocols;group communication;large-scale groups;peer-to-peer membership management;reliability properties;scalability properties;self-organizing protocol;Computer crashes;Helium;Internet;Knowledge management;Large-scale systems;Multicast protocols;Peer to peer computing;Scalability;Subscriptions;Telecommunication network reliability},
doi={10.1109/TC.2003.1176982},
ISSN={0018-9340},}
@article{voulgaris2005cyclon,
year={2005},
issn={1064-7570},
journal={Journal of Network and Systems Management},
volume={13},
number={2},
doi={10.1007/s10922-005-4441-x},
title={CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays},
url={http://dx.doi.org/10.1007/s10922-005-4441-x},
publisher={Kluwer Academic Publishers-Plenum Publishers},
keywords={Membership management; peer-to-peer; epidemic/gossiping protocols;
unstructured overlays; random graphs},
author={Voulgaris, Spyros and Gavidia, Daniela and van Steen, Maarten},
pages={197-217},
language={English}
}
@article{malkhi2007concise,
year={2007},
issn={0178-2770},
journal={Distributed Computing},
volume={20},
number={3},
doi={10.1007/s00446-007-0044-y},
title={Concise version vectors in WinFS},
url={http://dx.doi.org/10.1007/s00446-007-0044-y},
publisher={Springer-Verlag},
author={Malkhi, Dahlia and Terry, Doug},
pages={209-219},
language={English}
}
@article{lamport1978time,
author = {Lamport, Leslie},
title = {Time, Clocks, and the Ordering of Events in a Distributed System},
journal = {Commun. ACM},
issue_date = {July 1978},
volume = {21},
number = {7},
month = jul,
year = {1978},
issn = {0001-0782},
pages = {558--565},
numpages = {8},
url = {http://doi.acm.org/10.1145/359545.359563},
doi = {10.1145/359545.359563},
acmid = {359563},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {clock synchronization, computer networks, distributed systems, multiprocess systems},
}
@PhDThesis{conway2014language,
title = {Language Support for Loosely Consistent Distributed Programming},
author = {Conway, Neil},
school = {University of California, Berkeley},
year = {2014}}
@inproceedings{almeida2008interval,
author = {Almeida, Paulo S{\'e}rgio and Baquero, Carlos and Fonte, Victor},
title = {Interval Tree Clocks},
booktitle = {Proceedings of the 12th International Conference on Principles of Distributed Systems},
series = {OPODIS '08},
year = {2008},
isbn = {978-3-540-92220-9},
location = {Luxor, Egypt},
pages = {259--274},
numpages = {16},
url = {http://dx.doi.org/10.1007/978-3-540-92221-6_18},
doi = {10.1007/978-3-540-92221-6_18},
acmid = {1496330},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
keywords = {Causality, dynamic systems, logical clock, vector clocks, version vectors},
}
@article{baldoni2002fundamentals,
title={Fundamentals of distributed computing: A practical tour of vector clock systems},
author={Baldoni, Roberto and Raynal, Michel},
journal={IEEE Distributed Systems Online},
volume={3},
number={2},
pages={12},
year={2002},
publisher={IEEE Educational Activities Department}
}
@ARTICLE{sun2009contextbased,
author={Sun, David and Sun, Chengzheng},
journal={IEEE Transactions on Parallel and Distributed Systems},
title={Context-Based Operational Transformation in Distributed Collaborative Editing Systems},
year={2009},
month={Oct},
volume={20},
number={10},
pages={1454-1470},
keywords={causality;data integrity;groupware;human computer interaction;text editing;ubiquitous computing;COT algorithm;causality theory;communication network;consistency maintenance technique;context vector;context-based operational transformation;distributed collaborative editing system;human-computer-human interaction;undo problem;Algorithm design and analysis;Collaboration;Communication networks;Concurrent computing;Context;Distributed computing;HTML;Productivity;Sun;XML;Communication/Networking and Information Technology;Computer Systems Organization;Computer-supported cooperative work;Distributed Systems;Distributed applications;Group and Organization Interfaces;Groupware;Information Interfaces and Representation;Information Interfaces and Representation (HCI);Information Technology and Collaborative computing;Information Technology and Systems Applications;Office Automation;Operational transformation;Synchronous interaction;Theory and models;causality;consistency maintenance;distributed applications.;operation context},
doi={10.1109/TPDS.2008.240},
ISSN={1045-9219},}
@article{charronbost1991concerning,
author = {Charron-Bost, Bernadette},
title = {Concerning the Size of Logical Clocks in Distributed Systems},
journal = {Inf. Process. Lett.},
issue_date = {July 12, 1991},
volume = {39},
number = {1},
month = jul,
year = {1991},
issn = {0020-0190},
pages = {11--16},
numpages = {6},
url = {http://dx.doi.org/10.1016/0020-0190(91)90055-M},
doi = {10.1016/0020-0190(91)90055-M},
acmid = {117606},
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam, The Netherlands, The Netherlands},
keywords = {causality, distributed computing clock, logical time, partially ordered sets},
}
@inproceedings{imine2003proving,
author = {Imine, Abdessamad and Molli, Pascal and Oster, G{\'e}rald and Rusinowitch, Micha\"{e}l},
title = {Proving Correctness of Transformation Functions in Real-time Groupware},
booktitle = {Proceedings of the Eighth Conference on European Conference on Computer Supported Cooperative Work},
series = {ECSCW'03},
year = {2003},
location = {Helsinki, Finland},
pages = {277--293},
numpages = {17},
url = {http://dl.acm.org/citation.cfm?id=1241889.1241904},
acmid = {1241904},
publisher = {Kluwer Academic Publishers},
address = {Norwell, MA, USA},
}
@inproceedings{andre2013supporting,
hal_id = {hal-00903813},
url = {http://hal.inria.fr/hal-00903813},
title = {{Supporting Adaptable Granularity of Changes for Massive-scale
Collaborative Editing}},
author = {Andr{\'e}, Luc and Martin, St{\'e}phane and Oster, G{\'e}rald and
Ignat, Claudia-Lavinia},
abstract = {{Since the Web 2.0 era, the Internet is a huge content editing
place in which users contribute to the content they
browse. Users do not just edit the content but they
collaborate on this content. Such shared content can be
edited by thousands of people. However, current consistency
maintenance algorithms seem not to be adapted to massive
collaborative updating. Shared data is usually fragmented
into smaller atomic elements that can only be added or
removed. Coarse-grained data leads to the possibility of
conflicting updates while fine-grained data requires more
metadata. In this paper we offer a solution for handling an
adaptable granularity for shared data that overcomes the
limitations of fixed-grained data approaches. Our approach
defines data at a coarse granularity when it is created and
refines its granularity only for facing possible conflicting
updates on this data. We exhibit three implementations of our
algorithm and compare their performances with other
algorithms in various scenarios.}},
language = {Anglais},
affiliation = {SCORE - INRIA Nancy - Grand Est / LORIA},
booktitle = {{CollaborateCom - 9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing - 2013}},
address = {Austin, {\'E}tats-Unis},
audience = {internationale },
year = {2013},
month = Oct,
pdf = {http://hal.inria.fr/hal-00903813/PDF/main.pdf},
}
@article{gilbert2002brewer,
author = {Gilbert, Seth and Lynch, Nancy},
title = {Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-tolerant Web Services},
journal = {SIGACT News},
issue_date = {June 2002},
volume = {33},
number = {2},
month = jun,
year = {2002},
issn = {0163-5700},
pages = {51--59},
numpages = {9},
url = {http://doi.acm.org/10.1145/564585.564601},
doi = {10.1145/564585.564601},
acmid = {564601},
publisher = {ACM},
address = {New York, NY, USA},
}
@incollection{mukund2014optimized,
year={2014},
isbn={978-3-642-45248-2},
booktitle={Distributed Computing and Networking},
volume={8314},
series={Lecture Notes in Computer Science},
editor={Chatterjee, Mainak and Cao, Jian-nong and Kothapalli, Kishore and Rajsbaum, Sergio},
doi={10.1007/978-3-642-45249-9_15},
title={Optimized OR-Sets without Ordering Constraints},
url={http://dx.doi.org/10.1007/978-3-642-45249-9_15},
publisher={Springer Berlin Heidelberg},
author={Mukund, Madhavan and Shenoy R., Gautham and Suresh, S.P.},
pages={227-241}
}
@INPROCEEDINGS{fowler1990causal,
author={Fowler, J. and Zwaenepoel, W.},
booktitle={Proceedings., 10th International Conference on Distributed Computing
Systems, 1990},
title={Causal distributed breakpoints},
year={1990},
pages={134-141},
keywords={distributed processing;parallel programming;program
debugging;Gaussian elimination;SUN
workstations;V-System;approximately consistent checkpoint
sets;causal distributed breakpoint;dependency
logging;distributed computation;message passing
overheads;message-passing;sequential breakpoint;Computer
science;Contracts;Distributed computing;Message
passing;Programming profession;Sun;Workstations},
doi={10.1109/ICDCS.1990.89277},}
@INPROCEEDINGS{wu2010partial,
author={Qinyi Wu and Pu, C. and Ferreira, J.E.},
booktitle={IEEE 26th International Conference on Data Engineering (ICDE), 2010},
title={A partial persistent data structure to support consistency in real-time
collaborative editing},
year={2010},
pages={776-779},
keywords={data structures;document handling;groupware;knowledge
representation;synchronisation;co-authored documents;data
consistency;knowledge representation;knowledge
sharing;partial persistent data structure;partial persistent
sequence;querying changes;realtime collaborative
editing;synchronization algorithms;Algorithm design and
analysis;Buildings;Collaboration;Collaborative
tools;Collaborative work;Data models;Data
structures;Educational institutions;History;Information
retrieval},
doi={10.1109/ICDE.2010.5447883},}
@inproceedings{grishchenko2010deep,
author = {Grishchenko, Victor},
title = {Deep hypertext with embedded revision control implemented in regular
expressions},
booktitle = {Proceedings of the 6th International Symposium on Wikis and Open
Collaboration},
series = {WikiSym '10},
year = {2010},
isbn = {978-1-4503-0056-8},
location = {Gdansk, Poland},
pages = {3:1--3:10},
articleno = {3},
numpages = {10},
url = {http://doi.acm.org/10.1145/1832772.1832777},
doi = {10.1145/1832772.1832777},
acmid = {1832777},
publisher = {ACM},
address = {New York, NY, USA},
}
@book{johansen1988groupware,
author = {Johansen, Robert},
title = {GroupWare: Computer Support for Business Teams},
year = {1988},
isbn = {0029164915},
publisher = {The Free Press},
address = {New York, NY, USA},
}
@article{andersson2007dynamic,
author = {Andersson, Arne and Thorup, Mikkel},
title = {Dynamic ordered sets with exponential search trees},
journal = {J. ACM},
issue_date = {June 2007},
volume = {54},
number = {3},
month = jun,
year = {2007},
issn = {0004-5411},
articleno = {13},
url = {http://doi.acm.org/10.1145/1236457.1236460},
doi = {10.1145/1236457.1236460},
acmid = {1236460},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Search trees, ordered lists},
}
@inproceedings{andersson1996faster,
title={Faster deterministic sorting and searching in linear space},
author={Andersson, Arne},
booktitle={Foundations of Computer Science, 1996. Proceedings., 37th Annual
Symposium on},
pages={135--141},
year={1996},
organization={IEEE}
}
@article{singh2011implementation,
title={Implementation and Performance Analysis of Exponential Tree Sorting},
author={Singh, Ajit and Garg, Deepak},
journal={International Journal of Computer Applications ISBN},
pages={978--93},
year={2011}
}
@misc{johnson1975maintenance,
author="Paul R. Johnson and Robert H. Thomas",
title="{Maintenance of duplicate databases}",
series="Request for Comments",
number="677",
howpublished="RFC 677",
publisher="IETF",
organization="Internet Engineering Task Force",
year=1975,
month=jan,
url="http://www.ietf.org/rfc/rfc677.txt",
}
@incollection{weiss2007wooki,
year={2007},
isbn={978-3-540-76992-7},
booktitle={Web Information Systems Engineering – WISE 2007},
volume={4831},
series={Lecture Notes in Computer Science},
editor={Benatallah, Boualem and Casati, Fabio and Georgakopoulos, Dimitrios and Bartolini, Claudio and Sadiq, Wasim and Godart, Claude},
doi={10.1007/978-3-540-76993-4_42},
title={Wooki: A P2P Wiki-Based Collaborative Writing Tool},
url={http://dx.doi.org/10.1007/978-3-540-76993-4_42},
publisher={Springer Berlin Heidelberg},
author={Weiss, Stéphane and Urso, Pascal and Molli, Pascal},
pages={503-512}
}
@article{weiss2010logootundo,
author = {Stéphane Weiss and
Pascal Urso and
Pascal Molli},
title = {Logoot-Undo: Distributed Collaborative Editing System on
P2P Networks},
journal = {IEEE Transactions on Parallel Distributed Systems},
volume = {21},
number = {8},
year = {2010},
pages = {1162-1174},
ee = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.173},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{weiss2009logoot,
title={Logoot: a scalable optimistic replication algorithm for collaborative
editing on P2P networks},
author={Weiss, Stéphane and Urso, Pascal and Molli, Pascal},
booktitle={ICDCS'09. 29th IEEE International Conference on Distributed
Computing Systems, 2009},
pages={404--412},
year={2009},
organization={IEEE}
}
@inproceedings{yu2012stringwise,
author = {Yu, Weihai},
title = {A string-wise CRDT for group editing},
booktitle = {Proceedings of the 17th ACM international conference on Supporting group work},
series = {GROUP '12},
year = {2012},
isbn = {978-1-4503-1486-2},
location = {Sanibel Island, Florida, USA},
pages = {141--144},
numpages = {4},
url = {http://doi.acm.org/10.1145/2389176.2389198},
doi = {10.1145/2389176.2389198},
acmid = {2389198},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {commutative replicated data type, real-time collaborative editor, selective undo},
}
@inproceedings{nedelec2013concurrency,
title = {Concurrency Effects Over Variable-size Identifiers in
Distributed Collaborative Editing},
author = {Brice N{\'e}delec and Pascal Molli and Achour Most{\'e}faoui and
Emmanuel Desmontils},
booktitle = {DChanges},
adress = {Florence, Italy},
year = {2013},
month = Sep,
ee = {http://ceur-ws.org/Vol-1008/paper5.pdf},
crossref = {DBLP:conf/doceng/2013dchanges},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{jelasity2004peer,
author = "M{\'a}rk Jelasity and Rachid Guerraoui and Anne-Marie Kermarrec and Maarten {van Steen}",
title = "The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations",
year = "2004",
booktitle = "Middleware 2004",
series = "Lecture Notes in Computer Science",
volume = "3231",
publisher = "Springer-Verlag",
editor = "Hans-Arno Jacobsen",
pages = "79--98",
pdfurl = "http://www.inf.u-szeged.hu/~jelasity/cikkek/middleware04.pdf",
doi = "10.1007/b101561"
}
@proceedings{DBLP:conf/doceng/2013dchanges,
title = {Proceedings of the International workshop on Document Changes:
Modeling, Detection, Storage and Visualization, Florence,
Italy, September 10, 2013},
booktitle = {DChanges},
publisher = {CEUR-WS.org},
series = {CEUR Workshop Proceedings},
volume = {1008},
year = {2013},
ee = {http://ceur-ws.org/Vol-1008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{nedelec2013lseq,
title={{LSEQ: an Adaptive Structure for Sequences in Distributed Collaborative
Editing}},
author ={N{\'e}delec, Brice and Molli, Pascal and Mostéfaoui, Achour and
Desmontils, Emmanuel},
abstract = {{Distributed collaborative editing systems allow users to work
distributed in time, space and across organisations. Trending
distributed collaborative editors such as Google Docs,
Etherpad or Git have grown in popularity over the years. A
new kind of distributed editors based on a family of
distributed data structure replicated on several sites called
Conflict-free Replicated Data Type (CRDT for short) appeared
recently. This paper considers a CRDT that represents a
distributed sequence of basic elements that can be lines,
words or characters (sequence CRDT). The possible operations
on this sequence are the insertion and the deletion of
elements. Compared to the state of the art, this approach is
more decentralised and scales better in terms of the number
of participants. However, its space complexity is linear with
respect to the total number of inserts and the insertion
points in the document. This makes the overall performances
of such editors dependent on the editing behaviour of
users. This paper proposes and models LSEQ, an adaptive
allocation strategy for a sequence CRDT. LSEQ achieves in the
average a sub-linear spatial-complexity whatever is the
editing behaviour. A series of experiments validates LSEQ
showing that it outperforms existing approaches.}},
keywords = {Distributed Documents; Document Authoring Tools and Systems;
Distributed Collaborative Editing; Real-time Editing;
Conflict-free Replicated Data Types},
language = {Anglais},
affiliation = {GDD - LINA},
booktitle = {{13th ACM Symposium on Document Engineering}},
adress = {Florence, Italy},
editor = {ACM},
audience = {internationale },
doi = {10.1145/2494266.2494278},
year = {2013},
month = Sep,
url = {http://doi.acm.org/10.1145/2494266.2494278},
}
%% inria-00629503, version 1
%% http://hal.inria.fr/inria-00629503
@inproceedings{ahmed2011evaluating,
hal_id = {inria-00629503},
url = {http://hal.inria.fr/inria-00629503},
title = {{Evaluating CRDTs for Real-time Document Editing}},
author = {Ahmed-Nacer, Mehdi and Ignat, Claudia-Lavinia and Oster, Gérald
and Roh, Hyun-Gul and Urso, Pascal},
abstract = {{Nowadays, real-time editing systems are catching on. Tools
such as Etherpad or Google Docs enable multiple authors at
dispersed locations to collaboratively write shared
documents. In such systems, a replication mechanism is
required to ensure consistency when merging concurrent
changes performed on the same document. Current editing
systems make use of operational transformation (OT), a
traditional replication mechanism for concurrent document
editing. Recently, Commutative Replicated Data Types (CRDTs)
were introduced as a new class of replication mechanisms
whose concurrent operations are designed to be natively
commutative. CRDTs, such as WOOT, Logoot, Treedoc, and RGAs,
are expected to be substitutes of replication mechanisms in
collaborative editing systems. This paper demonstrates the
suitability of CRDTs for real-time collaborative editing. To
reflect the tendency of decentralised collaboration, which
can resist censorship, tolerate failures, and let users have
control over documents, we collected editing logs from
real-time peer-to-peer collaborations. We present our
experiment results obtained by replaying those editing logs
on various CRDTs and an OT algorithm implemented in the same
environment.}},
keywords = {benchmark; collaboration; commutative replicated data types;
real-time editing},
language = {Anglais},
affiliation = {SCORE - INRIA Lorraine - LORIA},
booktitle = {{11th ACM Symposium on Document Engineering}},
pages = {103--112},
address = {Mountain View, California, {\'E}tats-Unis},
editor = {ACM },
audience = {internationale },
doi = {10.1145/2034691.2034717 },
year = {2011},
month = Sep,
pdf = {http://hal.inria.fr/inria-00629503/PDF/doce63-ahmednacer.pdf},
}
@article{saito2005optimistic,
author = {Saito, Yasushi and Shapiro, Marc},
title = {Optimistic replication},
journal = {ACM Comput. Surv.},
issue_date = {March 2005},
volume = {37},
number = {1},
month = mar,
year = {2005},
issn = {0360-0300},
pages = {42--81},
numpages = {40},
url = {http://doi.acm.org/10.1145/1057977.1057980},
doi = {10.1145/1057977.1057980},
acmid = {1057980},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Replication, disconnected operation, distributed systems, large scale systems, optimistic techniques},
}