{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:20:50Z","timestamp":1743153650851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031352591"},{"type":"electronic","value":"9783031352607"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-35260-7_1","type":"book-chapter","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T08:01:47Z","timestamp":1686211307000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TADA: A Toolkit for\u00a0Approximate Distributed Agreement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8361-6162","authenticated-orcid":false,"given":"Eduardo Louren\u00e7o","family":"da Concei\u00e7\u00e3o","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0519-9675","authenticated-orcid":false,"given":"Ana","family":"Nunes Alonso","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-7346","authenticated-orcid":false,"given":"Rui Carlos","family":"Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3341-9217","authenticated-orcid":false,"given":"Jos\u00e9 Orlando","family":"Pereira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"key":"1_CR1","unstructured":"Atomix: A reactive java framework for building fault-tolerant distributed systems. https:\/\/atomix.io\/"},{"key":"1_CR2","unstructured":"Bft-smart: High-performance byzantine fault-tolerant state machine replication. http:\/\/bft-smart.github.io\/library\/"},{"key":"1_CR3","unstructured":"etcd: A distributed, reliable key-value store for the most critical data of a distributed system. https:\/\/etcd.io\/"},{"key":"1_CR4","unstructured":"Jgroups - a toolkit for reliable messaging. http:\/\/www.jgroups.org\/"},{"key":"1_CR5","unstructured":"jgroups-raft: Implementation of the raft consensus protocol in jgroups. http:\/\/belaban.github.io\/jgroups-raft\/"},{"key":"1_CR6","unstructured":"Mirbft. https:\/\/labs.hyperledger.org\/labs\/mir-bft.html"},{"key":"1_CR7","unstructured":"The Raft consensus algorithm. https:\/\/raft.github.io\/"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: International Conference on Principles of Distributed Systems, pp. 229\u2013239 (2005). https:\/\/doi.org\/10.1007\/11516798_17","DOI":"10.1007\/11516798_17"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bhatti, N.T., Hiltunen, M.A., Schlichting, R.D., Chiu, W.: Coyote: a system for constructing fine-grain configurable communication services. ACM Trans. Comput. Syst. 16(4), 321\u2013366 (1998). https:\/\/doi.org\/10.1145\/292523.292524","DOI":"10.1145\/292523.292524"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2018.08.001","volume":"758","author":"S Bonomi","year":"2019","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile byzantine faults. Theoret. Comput. Sci. 758, 17\u201329 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.001","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Cady, S.T., Dom\u00ednguez-Garc\u00eda, A.D., Hadjicostis, C.N.: Finite-time approximate consensus and its application to distributed frequency regulation in islanded ac microgrids. In: 2015 48th Hawaii International Conference on System Sciences, pp. 2664\u20132670. IEEE (2015)","DOI":"10.1109\/HICSS.2015.321"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983). https:\/\/doi.org\/10.1137\/0212045","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N., Pinter, S., Stark, E., Wheil, W.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986). https:\/\/doi.org\/10.1145\/5925.5931","journal-title":"J. ACM"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of byzantine faults. J. ACM 51(5), 780\u2013799 (2004). https:\/\/doi.org\/10.1145\/1017460.1017463","DOI":"10.1145\/1017460.1017463"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"El-Mhamdi, E.M., Guerraoui, R., Guirguis, A., Rouault, S.: Garfield: system support for byzantine machine learning. arXiv preprint arXiv:2010.05888 (2020)","DOI":"10.1109\/DSN48987.2021.00021"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"AD Fekete","year":"1990","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. Distrib. Comput. 4, 9\u201329 (1990). https:\/\/doi.org\/10.1007\/BF01783662","journal-title":"Distrib. Comput."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"2","author":"MJ Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merrit, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 2, 26\u201339 (1986). https:\/\/doi.org\/10.1007\/BF01843568","journal-title":"Distrib. Comput."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Fouto, P., Costa, P.A., Pregui\u00e7a, N., Leit\u00e3o, J.: Babel: a framework for developing performant and dependable distributed protocols. In: 2022 41st International Symposium on Reliable Distributed Systems (SRDS), pp. 146\u2013155 (2022). https:\/\/doi.org\/10.1109\/SRDS55811.2022.00022","DOI":"10.1109\/SRDS55811.2022.00022"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Ghinea, D., Liu-Zhang, C.D., Wattenhofer, R.: Optimal synchronous approximate agreement with asynchronous fallback. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pp. 70\u201380 (2022)","DOI":"10.1145\/3519270.3538442"},{"key":"1_CR21","unstructured":"Haeberlen, A., Kouznetsov, P., Druschel, P.: The case for byzantine fault detection. In: HotDep (2006)"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: Byzantine fault detectors for solving consensus. Comput. J. 46(1), 16\u201335 (2003). https:\/\/doi.org\/10.1093\/comjnl\/46.1.16","DOI":"10.1093\/comjnl\/46.1.16"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001), pp. 51\u201358 (2001)","DOI":"10.1145\/568425.568433"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Lamport, L., Melliar-Smith, P.M.: Byzantine clock synchronization. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, PODC 1984, pp. 68\u201374. Association for Computing Machinery, New York (1984). https:\/\/doi.org\/10.1145\/800222.806737","DOI":"10.1145\/800222.806737"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Leidenfrost, R., Elmenreich, W., Bettstetter, C.: Fault-tolerant averaging for self-organizing synchronization in wireless ad hoc networks. In: 2010 7th International Symposium on Wireless Communication Systems, pp. 721\u2013725 (2010). https:\/\/doi.org\/10.1109\/ISWCS.2010.5624283","DOI":"10.1109\/ISWCS.2010.5624283"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Li, C., Wang, Y., Hurfin, M.: Clock synchronization in mobile ad hoc networks based on an iterative approximate byzantine consensus protocol. In: 2014 IEEE 28th International Conference on Advanced Information Networking and Applications (2014)","DOI":"10.1109\/AINA.2014.30"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Lundelius, J., Lynch, N.: A new fault-tolerant algorithm for clock synchronization. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, PODC 1984, pp. 75\u201388. Association for Computing Machinery, New York (1984). https:\/\/doi.org\/10.1145\/800222.806738","DOI":"10.1145\/800222.806738"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Mahaney, S.R., Schneider, F.B.: Inexact agreement: accuracy, precision, and graceful degradation (1985). https:\/\/doi.org\/10.1145\/323596.323618","DOI":"10.1145\/323596.323618"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Mendes, H., Herlihy, M.: Multidimensional approximate agreement in byzantine asynchronous systems. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 391\u2013400. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2488608.2488657","DOI":"10.1145\/2488608.2488657"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Miranda, H., Pinto, A., Rodrigues, L.: Appia, a flexible protocol kernel supporting multiple coordinated channels. In: Proceedings 21st International Conference on Distributed Computing Systems, pp. 707\u2013710 (2001). https:\/\/doi.org\/10.1109\/ICDSC.2001.919005","DOI":"10.1109\/ICDSC.2001.919005"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BFb0056493","volume-title":"Distributed Computing","author":"R Plunkett","year":"1998","unstructured":"Plunkett, R., Fekete, A.: Approximate agreement with mixed mode faults: algorithm and lower bound. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 333\u2013346. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056493"},{"key":"1_CR32","unstructured":"Primi, M., Sciascia, D.: Libpaxos: an open-source paxos. http:\/\/libpaxos.sourceforge.net\/"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Raghu Vamsi Krishna, T., Barnwal, R.P., Ghosh, S.K.: Cat: consensus-assisted trust estimation of MDS-equipped collaborators in vehicular ad-hoc network. Veh. Commun. 2(3), 150\u2013157 (2015). https:\/\/doi.org\/10.1016\/j.vehcom.2015.06.001","DOI":"10.1016\/j.vehcom.2015.06.001"},{"issue":"9","key":"1_CR34","doi-asserted-by":"publisher","DOI":"10.1115\/1.4036031","volume":"139","author":"T Sadikhov","year":"2017","unstructured":"Sadikhov, T., Haddad, W.M., Yucelen, T., Goebel, R.: Approximate consensus of multiagent systems with inaccurate sensor measurements. J. Dyn. Syst. Meas. Contr. 139(9), 091003 (2017)","journal-title":"J. Dyn. Syst. Meas. Contr."},{"key":"1_CR35","unstructured":"Stathakopoulou, C., David, T., Vukolic, M.: Mir-BFT: high-throughput BFT for blockchains. CoRR abs\/1906.05552 (2019). http:\/\/arxiv.org\/abs\/1906.05552"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35260-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T08:02:10Z","timestamp":1686211330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35260-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031352591","9783031352607"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35260-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Distributed Applications and Interoperable Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dais2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2023\/dais","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}