Filament: A Cohort Construction Service for Decentralized Collaborative Editing Platforms

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10320)


Distributed collaborative editors allow several remote users to contribute concurrently to the same document. Only a limited number of concurrent users can be supported by the currently deployed editors. 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. Our proposal utilises the semantic relations between peers to construct a set of self-organizing overlays to route search requests. The resulting protocol is efficient, scalable, and provides beneficial load-balancing properties over the involved peers. We evaluate our approach and compare it against a standard Chord based DHT approach. Our approach performs as well as a DHT based approach but provides better load balancing.


Network Size Overlay Network Distribute Hash Table Candidate List Edit Document 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This work was partially funded by the DeSceNt project granted by the Labex CominLabs excellence laboratory of the French Agence Nationale de la Recherche (ANR- 10-LABX-07-01).


  1. 1.
  2. 2.
  3. 3.
  4. 4.
  5. 5.
    Baldoni, R., Beraldi, R., Quema, V., Querzoni, L., Tucci-Piergiovanni, S.: Tera: Topic-based event routing for peer-to-peer architectures. In: Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems, DEBS 2007, pp. 2–13 (2007)Google Scholar
  6. 6.
    Chen, C., Tock, Y.: Design of routing protocols and overlay topologies for topic-based publish/subscribe on small-world networks. In: Proceedings of the Industrial Track of the 16th International Middleware Conference. Middleware Industry 2015 (2015)Google Scholar
  7. 7.
    Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication. In: Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems, DEBS 2007, pp. 14–25 (2007)Google Scholar
  8. 8.
    Chockler, G.V., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for pub-sub with many topics. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, 12–15 August 2007, pp. 109–118 (2007)Google Scholar
  9. 9.
    Davoust, A., Skaf-Molli, H., Molli, P., Esfandiari, B., Aslan, K.: Distributed wikis: a survey. Concurrency Comput. Pract. Experience 27(11), 2751–2777 (2015)CrossRefGoogle Scholar
  10. 10.
    DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon’s highly available key-value store. In: SOSP 2007 (2007)Google Scholar
  11. 11.
    Dorrigiv, R., Lopez-Ortiz, A., Prałat, P.: Search algorithms for unstructured peer-to-peer networks. In: 32nd IEEE Conference on Local Computer Networks, LCN 2007, pp. 343–352. IEEE (2007)Google Scholar
  12. 12.
    Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval. 63(3), 241–263 (2006)CrossRefGoogle Scholar
  13. 13.
    Gupta, A., Sahin, O.D., Agrawal, D., El Abbadi, A.: Meghdoot: content-based publish/subscribe over P2P networks. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 254–273. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-30229-2_14 CrossRefGoogle Scholar
  14. 14.
    Jelasity, M., Montresor, A., Babaoglu, O.: T-man: gossip-based fast overlay topology construction. Comput. Netw. 53(13), 2321–2339 (2009)CrossRefMATHGoogle Scholar
  15. 15.
    Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. 25, 8 (2007). CrossRefGoogle Scholar
  16. 16.
    Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 36–43. ACM (2004)Google Scholar
  17. 17.
    Kermarrec, A.-M., Triantafillou, P.: Xl peer-to-peer pub/sub systems. ACM Comput. Surv. (CSUR) 46(2), 16:1–16:45 (2013). Article no 16Google Scholar
  18. 18.
    Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44(2), 35–40 (2010). ACMGoogle Scholar
  19. 19.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95. ACM (2002)Google Scholar
  20. 20.
    Montresor, A., Jelasity, M., Babaoglu, O.: Chord on demand. In: P2P 2005 (2005)Google Scholar
  21. 21.
    Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: P2P 2009 (2009)Google Scholar
  22. 22.
    Oster, G., Mondéjar, R., Molli, P., Dumitriu, S.: Building a collaborative peer-to-peer wiki system on a structured overlay. Comput. Netw. 54(12), 1939–1952 (2010)CrossRefMATHGoogle Scholar
  23. 23.
    Otto, F., Ouyang, S.: Improving search in unstructured P2P systems: intelligent walks (I-Walks). In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 1312–1319. Springer, Heidelberg (2006). doi: 10.1007/11875581_156 CrossRefGoogle Scholar
  24. 24.
    Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured P2P systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 68–79. Springer, Heidelberg (2003). doi: 10.1007/978-3-540-45172-3_6 CrossRefGoogle Scholar
  25. 25.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. SIGCOMM Comput. Commun. Rev. 31(4), 161–172 (2001)CrossRefMATHGoogle Scholar
  26. 26.
    Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001). doi: 10.1007/3-540-45518-3_18 CrossRefGoogle Scholar
  27. 27.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001 (2001)Google Scholar
  28. 28.
    Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Euro-Par 2005 (2005)Google Scholar
  29. 29.
    Voulgaris, S., Rivière, E., Kermarrec, A.M., Steen, M.V.: Sub-2-sub: self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In: IPTPS 2006: the Fifth International Workshop on Peer-to-Peer Systems (2006)Google Scholar
  30. 30.
    Weiss, S., Urso, P., Molli, P.: Logoot-undo: distributed collaborative editing system on P2P networks. IEEE Trans. Parallel Distrib. Syst. 21(8), 1162–1174 (2010)CrossRefGoogle Scholar
  31. 31.
    Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Computer 74 (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  1. 1.Université de Rennes 1 - IRISARennesFrance
  2. 2.ESIRRennesFrance

Personalised recommendations