{"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"volume":66,"isi":1,"has_accepted_license":"1","external_id":{"arxiv":["1705.06173"],"isi":["000496514100001"]},"article_type":"original","intvolume":"        66","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"date_updated":"2023-08-30T07:07:23Z","abstract":[{"text":"We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of thennodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e.,the initial state of the system may be arbitrary, and there can be up to f<n/3 ongoing Byzantine faults, i.e.,nodes that deviate from the protocol in an arbitrary manner. Furthermore, we assume that the local clocks ofthe nodes may progress at different speeds (clock drift) and communication has bounded delay. In this model,we study the pulse synchronisation problem, where the task is to guarantee that eventually all correct nodesgenerate well-separated local pulse events (i.e., unlabelled logical clock ticks) in a synchronised manner.Compared to prior work, we achieveexponentialimprovements in stabilisation time and the number ofcommunicated bits, and give the first sublinear-time algorithm for the problem:•In the deterministic setting, the state-of-the-art solutions stabilise in timeΘ(f)and have each nodebroadcastΘ(flogf)bits per time unit. We exponentially reduce the number of bits broadcasted pertime unit toΘ(logf)while retaining the same stabilisation time.•In the randomised setting, the state-of-the-art solutions stabilise in timeΘ(f)and have each nodebroadcastO(1)bits per time unit. We exponentially reduce the stabilisation time to polylogfwhileeach node broadcasts polylogfbits per time unit.These results are obtained by means of a recursive approach reducing the above task ofself-stabilisingpulse synchronisation in thebounded-delaymodel tonon-self-stabilisingbinary consensus in thesynchro-nousmodel. In general, our approach introduces at most logarithmic overheads in terms of stabilisation timeand broadcasted bits over the underlying consensus routine.","lang":"eng"}],"status":"public","day":"01","quality_controlled":"1","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"publisher":"ACM","oa":1,"scopus_import":"1","publication_status":"published","_id":"6972","doi":"10.1145/3339471","publication_identifier":{"issn":["0004-5411"]},"title":"Self-stabilising Byzantine clock synchronisation is almost as easy as consensus","month":"09","issue":"5","oa_version":"Published Version","citation":{"short":"C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).","apa":"Lenzen, C., &#38; Rybicki, J. (2019). Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3339471\">https://doi.org/10.1145/3339471</a>","ama":"Lenzen C, Rybicki J. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. <i>Journal of the ACM</i>. 2019;66(5). doi:<a href=\"https://doi.org/10.1145/3339471\">10.1145/3339471</a>","ista":"Lenzen C, Rybicki J. 2019. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 66(5), 32.","ieee":"C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” <i>Journal of the ACM</i>, vol. 66, no. 5. ACM, 2019.","mla":"Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” <i>Journal of the ACM</i>, vol. 66, no. 5, 32, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3339471\">10.1145/3339471</a>.","chicago":"Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” <i>Journal of the ACM</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3339471\">https://doi.org/10.1145/3339471</a>."},"type":"journal_article","publication":"Journal of the ACM","article_number":"32","date_created":"2019-10-24T17:12:48Z","ddc":["000"],"year":"2019","file":[{"relation":"main_file","file_size":2183085,"file_name":"2019_JACM_Lenzen.pdf","date_created":"2019-10-25T12:58:38Z","content_type":"application/pdf","date_updated":"2020-07-14T12:47:46Z","creator":"dernst","checksum":"7e5d95c478e0e393f4927fcf7e48194e","file_id":"6975","access_level":"open_access"}],"article_processing_charge":"Yes","date_published":"2019-09-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:46Z","language":[{"iso":"eng"}],"author":[{"full_name":"Lenzen, Christoph","first_name":"Christoph","last_name":"Lenzen"},{"orcid":"0000-0002-6432-6646","first_name":"Joel","full_name":"Rybicki, Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"DaAl"}]}