Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Small Byzantine Quorum Systems
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Failure detection and consensus in the crash-recovery model
Distributed Computing
Synchronous Byzantine quorum systems
Distributed Computing
Distributed Computing
Reconfigurable distributed storage for dynamic networks
Journal of Parallel and Distributed Computing
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Implementing a Register in a Dynamic Distributed System
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Centrifuge: integrated lease management and partitioning for cloud services
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Validity bound of regular registers with churn and byzantine processes
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
IEEE Transactions on Parallel and Distributed Systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 5.23 |
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-fault-tolerant 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 either block protocols or violate the safety of the storage. In this paper, we address the problem of building a safe register storage resilient to byzantine failures in a distributed system affected from churn. A protocol implementing a safe register in an eventually synchronous system is proposed and some feasibility constraints on the arrival and departure of the processes are given. The protocol is proved to be correct under the assumption that the constraint on the churn is satisfied.