Abstract
In the synchronous c-counting problem, we are given a synchronous system of n nodes, where up to f of the nodes may be Byzantine, that is, have arbitrary faulty behaviour. The task is to have all of the correct nodes count modulo c in unison in a self-stabilising manner: regardless of the initial state of the system and the faulty nodes’ behavior, eventually rounds are consistently labelled by a counter modulo c at all correct nodes. We provide a deterministic solution with resilience f
Cite
CITATION STYLE
Lenzen, C., & Rybicki, J. (2015). Efficient counting with optimal resilience. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9363, pp. 16–30). Springer Verlag. https://doi.org/10.1007/978-3-662-48653-5_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
