{"department":[{"_id":"DaAl"}],"type":"journal_article","article_processing_charge":"Yes (via OA deal)","ddc":["000"],"status":"public","file":[{"file_size":799337,"relation":"main_file","date_created":"2018-12-17T14:21:22Z","file_id":"5711","date_updated":"2020-07-14T12:48:01Z","content_type":"application/pdf","creator":"dernst","file_name":"2018_DistributedComputing_Lenzen.pdf","access_level":"open_access","checksum":"872db70bba9b401500abe3c6ae2f1a61"}],"_id":"76","publication_status":"published","quality_controlled":"1","month":"09","author":[{"first_name":"Christoph","last_name":"Lenzen","full_name":"Lenzen, Christoph"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel"}],"citation":{"short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. <i>Distributed Computing</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00446-018-0342-6\">10.1007/s00446-018-0342-6</a>","chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” <i>Distributed Computing</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00446-018-0342-6\">https://doi.org/10.1007/s00446-018-0342-6</a>.","mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” <i>Distributed Computing</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00446-018-0342-6\">10.1007/s00446-018-0342-6</a>.","apa":"Lenzen, C., &#38; Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. <i>Distributed Computing</i>. Springer. <a href=\"https://doi.org/10.1007/s00446-018-0342-6\">https://doi.org/10.1007/s00446-018-0342-6</a>","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” <i>Distributed Computing</i>. Springer, 2018.","ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing."},"title":"Near-optimal self-stabilising counting and firing squads","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"date_published":"2018-09-12T00:00:00Z","file_date_updated":"2020-07-14T12:48:01Z","date_created":"2018-12-11T11:44:30Z","scopus_import":"1","doi":"10.1007/s00446-018-0342-6","publication":"Distributed Computing","day":"12","date_updated":"2023-09-13T09:01:06Z","language":[{"iso":"eng"}],"year":"2018","publist_id":"7978","publisher":"Springer","abstract":[{"lang":"eng","text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C&gt;1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f&lt;n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","external_id":{"isi":["000475627800005"]},"oa":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"oa_version":"Published Version","isi":1}