{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:12Z","timestamp":1750308612921,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:00:00Z","timestamp":1558396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2019,5,21]]},"abstract":"<jats:p>This note is about the interplay between a data structure, the append-only log, and a broadcasting communication abstraction that seems to induce it. We identified real-world systems which have started to exploit this configuration and highlight its desirable properties. Networking research should take note of this development and adjust its research agenda accordingly.<\/jats:p>","DOI":"10.1145\/3336937.3336943","type":"journal-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:01:38Z","timestamp":1558634498000},"page":"37-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Broadcast-Only Communication Model Based on Replicated Append-Only Logs"],"prefix":"10.1145","volume":"49","author":[{"given":"Christian","family":"Tschudin","sequence":"first","affiliation":[{"name":"University of Basel"}]}],"member":"320","published-online":{"date-parts":[[2019,5,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646823.706913"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Andrea Bittau Daniel Giffin Mark Handley David Mazieres Quinn Slack and Eric Smith. 2018. Cryptographic protection of TCP Streams (tcpcrypt). Internet-Draft draft-ietf-tcpinc-tcpcrypt-15. IETF Secretariat. https:\/\/www.ietf.org\/internet-drafts\/draft-ietf-tcpinc-tcpcrypt-15.txt  Andrea Bittau Daniel Giffin Mark Handley David Mazieres Quinn Slack and Eric Smith. 2018. Cryptographic protection of TCP Streams (tcpcrypt) . Internet-Draft draft-ietf-tcpinc-tcpcrypt-15. IETF Secretariat. https:\/\/www.ietf.org\/internet-drafts\/draft-ietf-tcpinc-tcpcrypt-15.txt","DOI":"10.17487\/RFC8548"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2587"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/380749.380767"},{"volume-title":"Physics of Solitons","author":"Dauxois Thierry","key":"e_1_2_1_6_1","unstructured":"Thierry Dauxois and Michel Peyrard . 2010. Physics of Solitons . Cambridge University Press . Thierry Dauxois and Michel Peyrard. 2010. Physics of Solitons. Cambridge University Press."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2363.2433"},{"key":"e_1_2_1_8_1","unstructured":"Google Cloud Pub\/Sub 2018. Google Cloud Pub\/Sub. (2018). https:\/\/cloud.google.com\/pubsub\/docs\/overview.  Google Cloud Pub\/Sub 2018. Google Cloud Pub\/Sub. (2018). https:\/\/cloud.google.com\/pubsub\/docs\/overview."},{"key":"e_1_2_1_9_1","volume-title":"https:\/\/holochain.org\/ (retrieved","author":"Scalable Distribute Holochain","year":"2019","unstructured":"Holochain \u2013 Scalable Distribute Computing 2019. ( 2019 ). https:\/\/holochain.org\/ (retrieved Feb 2019). Holochain \u2013 Scalable Distribute Computing 2019. (2019). https:\/\/holochain.org\/ (retrieved Feb 2019)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282402"},{"key":"e_1_2_1_11_1","volume-title":"See also https:\/\/www.certificate-transparency.org\/","author":"Laurie Ben","year":"2013","unstructured":"Ben Laurie , Adam Langley , and Emilia Kasper . 2013. Certificate Transparency . RFC 6962. ( 2013 ). See also https:\/\/www.certificate-transparency.org\/ . Ben Laurie, Adam Langley, and Emilia Kasper. 2013. Certificate Transparency. RFC 6962. (2013). See also https:\/\/www.certificate-transparency.org\/."},{"key":"e_1_2_1_12_1","unstructured":"Mihai Letia Nuno M. Pregui\u00e7a and Marc Shapiro. 2009. CRDTs: Consistency without concurrency control. (2009). http:\/\/arxiv.org\/abs\/0907.0929  Mihai Letia Nuno M. Pregui\u00e7a and Marc Shapiro. 2009. CRDTs: Consistency without concurrency control. (2009). http:\/\/arxiv.org\/abs\/0907.0929"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47854-7_10"},{"key":"e_1_2_1_14_1","volume-title":"Applied Monotonicity: A Brief History of CRDTs in Riak.","author":"Meiklejohn Christopher","year":"2019","unstructured":"Christopher Meiklejohn . 2019 . Applied Monotonicity: A Brief History of CRDTs in Riak. (2019). http:\/\/christophermeiklejohn.com\/erlang\/lasp\/2019\/03\/08\/monotonicity.html (retrieved Apr 2019). Christopher Meiklejohn. 2019. Applied Monotonicity: A Brief History of CRDTs in Riak. (2019). http:\/\/christophermeiklejohn.com\/erlang\/lasp\/2019\/03\/08\/monotonicity.html (retrieved Apr 2019)."},{"volume-title":"Proc USENIX Annual Technical Conference. 305\u2013319","author":"Ongaro Diego","key":"e_1_2_1_15_1","unstructured":"Diego Ongaro and John K. Ousterhout . 2014. In Search of an Understandable Consensus Algorithm . In Proc USENIX Annual Technical Conference. 305\u2013319 . https:\/\/www.usenix.org\/system\/files\/conference\/atc14\/atc14-paper-ongaro.pdf Diego Ongaro and John K. Ousterhout. 2014. In Search of an Understandable Consensus Algorithm. In Proc USENIX Annual Technical Conference. 305\u2013319. https:\/\/www.usenix.org\/system\/files\/conference\/atc14\/atc14-paper-ongaro.pdf"},{"key":"e_1_2_1_16_1","volume-title":"https:\/\/www.scuttlebutt.nz\/ (retrieved","author":"Secure Scuttlebutt","year":"2018","unstructured":"Secure Scuttlebutt Project 2018. ( 2018 ). https:\/\/www.scuttlebutt.nz\/ (retrieved Feb 2019). Secure Scuttlebutt Project 2018. (2018). https:\/\/www.scuttlebutt.nz\/ (retrieved Feb 2019)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3132106"},{"key":"e_1_2_1_18_1","volume-title":"Scalable Secure Scuttlebutt. (2018). https:\/\/github.com\/dominictarr\/scalable-secure-scuttlebutt\/blob\/master\/paper.md (retrieved","author":"Tarr Dominic","year":"2019","unstructured":"Dominic Tarr . 2018. Scalable Secure Scuttlebutt. (2018). https:\/\/github.com\/dominictarr\/scalable-secure-scuttlebutt\/blob\/master\/paper.md (retrieved Feb 2019 ). Dominic Tarr. 2018. Scalable Secure Scuttlebutt. (2018). https:\/\/github.com\/dominictarr\/scalable-secure-scuttlebutt\/blob\/master\/paper.md (retrieved Feb 2019)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626292"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336937.3336943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336937.3336943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:25Z","timestamp":1750273645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336937.3336943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,21]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5,21]]}},"alternative-id":["10.1145\/3336937.3336943"],"URL":"https:\/\/doi.org\/10.1145\/3336937.3336943","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2019,5,21]]},"assertion":[{"value":"2019-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}