A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn
[chapter]
2011
Lecture Notes in Computer Science
Distributed storage service is one of the main abstractions provided to the developers of distributed applications due to its capability to hide the complexity generated by the messages exchanged between processes. Many protocols have been proposed to build byzantine-faulttolerant storage services on top of a message-passing system, but they do not consider the possibility to have servers joining and leaving the computation (churn phenomenon). This phenomenon, if not properly mastered, can
doi:10.1007/978-3-642-24550-3_5
fatcat:ogb2vhowsvaspeo4ruudttqa7q