CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Byzantine Fireflies
Authors
A Cornejo
A Daliot
+9 more
AH Gandomi
D Weyns
F Cristian
H Kopetz
HM Smith
L Lamport
L Lamport
O Simeone
RE Mirollo
Publication date
5 October 2015
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
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. © Springer-Verlag Berlin Heidelberg 2015
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-662-4...
Last time updated on 01/04/2019
Infoscience - École polytechnique fédérale de Lausanne
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:infoscience.tind.io:213732
Last time updated on 09/02/2018