Byzantine Fireflies

Rachid Guerraoui (1) , Alexandre Maurer (1)

1 EPFL - Ecole Polytechnique Fédérale de Lausanne

This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We assume that n > 2f (n is the number of processes and f is the number of Byzantine processes) and that the initial state of the processes can be arbitrary (self-stabilization). We distinguish the cases where the beeping period is known, unknown or approximately known. We also consider the situation where the processes can produce light continuously.

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

Rachid Guerraoui, Alexandre Maurer. Byzantine Fireflies. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_4⟩. ⟨hal-01199818⟩