Document Open Access Logo

Causal Broadcast: How to Forget?

Authors Brice Nédelec, Pascal Molli, Achour Mostéfaoui



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2018.20.pdf
  • Filesize: 0.68 MB
  • 16 pages

Document Identifiers

Author Details

Brice Nédelec
  • LS2N, University of Nantes, 2 rue de la Houssinière, BP 92208, 44322 Nantes Cedex 3, France
Pascal Molli
  • LS2N, University of Nantes, 2 rue de la Houssinière, BP 92208, 44322 Nantes Cedex 3, France
Achour Mostéfaoui
  • LS2N, University of Nantes, 2 rue de la Houssinière, BP 92208, 44322 Nantes Cedex 3, France

Cite AsGet BibTex

Brice Nédelec, Pascal Molli, and Achour Mostéfaoui. Causal Broadcast: How to Forget?. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 20:1-20:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.OPODIS.2018.20

Abstract

Causal broadcast constitutes a fundamental communication primitive of many distributed protocols and applications. However, state-of-the-art implementations fail to forget obsolete control information about already delivered messages. They do not scale in large and dynamic systems. In this paper, we propose a novel implementation of causal broadcast. We prove that all and only obsolete control information is safely removed, at cost of a few lightweight control messages. The local space complexity of this protocol does not monotonically increase and depends at each moment on the number of messages still in transit and the degree of the communication graph. Moreover, messages only carry a scalar clock. Our implementation constitutes a sustainable communication primitive for causal broadcast in large and dynamic systems.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Peer-to-peer architectures
Keywords
  • Causal broadcast
  • complexity trade-off
  • large and dynamic systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Saleh E. Abdullahi and Graem A. Ringwood. Garbage Collecting the Internet: A Survey of Distributed Garbage Collection. ACM Comput. Surv., 30(3):330-373, September 1998. Google Scholar
  2. Peter Bailis, Ali Ghodsi, Joseph M. Hellerstein, and Ion Stoica. Bolt-on Causal Consistency. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD '13, pages 761-772, New York, NY, USA, 2013. ACM. Google Scholar
  3. Dhruba Borthakur. Petabyte Scale Databases and Storage Systems at Facebook. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD '13, pages 1267-1268, New York, NY, USA, 2013. ACM. Google Scholar
  4. Manuel Bravo, Luís Rodrigues, and Peter Van Roy. Saturn: A Distributed Metadata Service for Causal Consistency. In Proceedings of the Twelfth European Conference on Computer Systems, EuroSys '17, pages 111-126, New York, NY, USA, 2017. ACM. Google Scholar
  5. Frank Dabek, Russ Cox, Frans Kaashoek, and Robert Morris. Vivaldi: A Decentralized Network Coordinate System. SIGCOMM Comput. Commun. Rev., 34(4):15-26, 2004. Google Scholar
  6. Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, and Doug Terry. Epidemic algorithms for replicated database maintenance. In Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pages 1-12. ACM, 1987. Google Scholar
  7. Roy Friedman and Shiri Manor. Causal Ordering in Deterministic Overlay Networks. Israel Institute of Technology: Haifa, Israel, 2004. Google Scholar
  8. Ayalvadi J. Ganesh, Anne-Marie Kermarrec, and Laurent Massoulié. Scamp: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication. In Jon Crowcroft and Markus Hofmann, editors, Networked Group Communication, volume 2233 of Lecture Notes in Computer Science, pages 44-55. Springer Berlin Heidelberg, 2001. Google Scholar
  9. Vassos Hadzilacos and Sam Toueg. A Modular Approach to Fault-Tolerant Broadcasts and Related Problems. Technical report, Cornell University, Ithaca, NY, USA, 1994. Google Scholar
  10. Matthias Heinrich, Franz Lehmann, Thomas Springer, and Martin Gaedke. Exploiting single-user web applications for shared editing: a generic transformation approach. In Proceedings of the 21st international conference on World Wide Web, pages 1057-1066. ACM, 2012. Google Scholar
  11. Márk Jelasity, Spyros Voulgaris, Rachid Guerraoui, Anne-Marie Kermarrec, and Maarten Van Steen. Gossip-based peer sampling. ACM Transactions on Computer Systems (TOCS), 25(3):8, 2007. Google Scholar
  12. Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. T-Man: Gossip-based fast overlay topology construction. Computer Networks, 53(13):2321-2339, 2009. Google Scholar
  13. Sveta Krasikova, Raziel C. Gómez, Heverson B. Ribeiro, Etienne Rivière, and Valerio Schiavoni. Evaluating the Cost and Robustness of Self-organizing Distributed Hash Tables. In Proceedings of the 16th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems - Volume 9687, pages 16-31, Berlin, Heidelberg, 2016. Springer-Verlag. Google Scholar
  14. Leslie Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558-565, July 1978. Google Scholar
  15. Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, and David G. Andersen. Don't Settle for Eventual: Scalable Causal Consistency for Wide-area Storage with COPS. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, pages 401-416, New York, NY, USA, 2011. ACM. Google Scholar
  16. Dahlia Malkhi and Doug Terry. Concise version vectors in WinFS. Distributed Computing, 20(3):209-219, 2007. Google Scholar
  17. Alberto Montresor and Márk Jelasity. PeerSim: A Scalable P2P Simulator. In Proceedings of the 9th International Conference on Peer-to-Peer (P2P'09), pages 99-100, Seattle, WA, September 2009. Google Scholar
  18. Madhavan Mukund, Gautham Shenoy R., and S.P. Suresh. Optimized OR-Sets without Ordering Constraints. In Mainak Chatterjee, Jian-nong Cao, Kishore Kothapalli, and Sergio Rajsbaum, editors, Distributed Computing and Networking, volume 8314 of Lecture Notes in Computer Science, pages 227-241. Springer Berlin Heidelberg, 2014. Google Scholar
  19. Brice Nédelec, Pascal Molli, and Achour Mostéfaoui. CRATE: Writing Stories Together with Our Browsers. In Proceedings of the 25th International Conference Companion on World Wide Web, WWW '16 Companion, pages 231-234, Republic and Canton of Geneva, Switzerland, 2016. International World Wide Web Conferences Steering Committee. Google Scholar
  20. Brice Nédelec, Pascal Molli, and Achour Mostéfaoui. Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems. In Proceedings of the 37th IEEE International Symposium on Reliable Distributed Systems, SRDS '18. IEEE, 2018. Google Scholar
  21. Brice Nédelec, Julian Tanke, Davide Frey, Pascal Molli, and Achour Mostéfaoui. An adaptive peer-sampling protocol for building networks of browsers. World Wide Web, August 2017. Google Scholar
  22. Michel Raynal. Distributed algorithms for message-passing systems, volume 500. Springer, 2013. Google Scholar
  23. Reinhard Schwarz and Friedemann Mattern. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing, 7(3):149-174, March 1994. Google Scholar
  24. Marc Shapiro, Nuno Preguiça, Carlos Baquero, and Marek Zawirski. A comprehensive study of Convergent and Commutative Replicated Data Types. Rapport de recherche RR-7506, INRIA, January 2011. Google Scholar
  25. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM '01, pages 149-160, New York, USA, 2001. ACM. Google Scholar
  26. David Sun and Chengzheng Sun. Context-Based Operational Transformation in Distributed Collaborative Editing Systems. IEEE Transactions on Parallel and Distributed Systems, 20(10):1454-1470, October 2009. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail