Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Rampart Toolkit for Building High-Integrity Services
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
Synchronous Byzantine quorum systems
Distributed Computing
Distributed Computing
Tolerating Byzantine Faulty Clients in a Quorum System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
| Hi-index | 0.00 |
State machine replication is a general approach for building a Byzantine fault-tolerant (BFT) distributed systems like a grid or a cloud or a data center. Various BFT protocols based on state machine replication have been introduced for modern distributed systems to tolerate byzantine failures and thus provide more reliable services. However, most of them have not fully considered the adverse affects of Churn (nodes entering and leaving the system at will) on the correctness and availability of services. In this paper, we propose a new churn tolerance algorithm based on the BFT protocol approach using state machine replication. It is capable of tolerating both Byzantine failures and arbitrary churn when the constraint on the number of faults in the distributed system is satisfied.