Efficient counting with optimal resilience

@article{Lenzen2017EfficientCW,
  title={Efficient counting with optimal resilience},
  author={C. Lenzen and Joel Rybicki},
  journal={SIAM J. Comput.},
  year={2017},
  volume={46},
  pages={1473-1500}
}
Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behavior, the task is to eventually have all correct nodes labeling the pulses with increasing values modulo $c$ in agreement. Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures. In this work, we give new algorithms for the synchronous counting… Expand
11 Citations
Efficient Counting with Optimal Resilience
  • 2
  • PDF
Near-optimal self-stabilising counting and firing squads
  • 8
  • PDF
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
  • 3
  • PDF
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
  • 1
  • Highly Influenced
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
  • 20
  • Highly Influenced
  • PDF
Byzantine Agreement with Unknown Participants and Failures
  • PDF
On the Computational Power of Simple Dynamics
  • 6
  • PDF
Stabilization, Safety, and Security of Distributed Systems
  • 29
...
1
2
...

References

SHOWING 1-10 OF 51 REFERENCES
Towards Optimal Synchronous Counting
  • 14
  • PDF
Efficient Counting with Optimal Resilience
  • 2
  • PDF
Synchronous counting and computational algorithm design
  • 6
  • PDF
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
  • 35
  • Highly Influential
  • PDF
Near-optimal self-stabilising counting and firing squads
  • 8
  • PDF
Communication Efficiency in Self-Stabilizing Silent Protocols
  • 19
  • PDF
...
1
2
3
4
5
...