Byzantine Fault-Tolerance with Commutative Commands
نویسندگان
چکیده
State machine replication is a popular approach to increasing the availability of computer services. While it has been largely studied in the presence of crash-stop failures and malicious failures, all existing state machine replication protocols that provide byzantine faulttolerance implement some variant of atomic broadcast. In this context, this paper makes two contributions. First, it presents the first byzantine fault-tolerant generic broadcast protocol. Generic broadcast is more general than atomic broadcast, in that it allows applications to deliver commutative commands out of order—delivering a command out of order can be done in fewer communication steps than delivering a command in the same order. Second, the paper presents an efficient state machine replication protocol that tolerates byzantine failures. Our protocol requires fewer message delays than the best existing solutions under similar conditions. Moreover, processing of commutative commands on replicas requires only two MAC operations. The protocol is speculative in that it may rollback non-commutative commands.
منابع مشابه
Application Aware for Byzantine Fault Tolerance
Driven by the need for higher reliability of many distributed systems, various replication-based fault tolerance technologies have been widely studied. A prominent technology is Byzantine fault tolerance (BFT). BFT can help achieve high availability and trustworthiness by ensuring replica consistency despite the presence of hardware failures and malicious faults on a small portion of the replic...
متن کاملTangaroa: a Byzantine Fault Tolerant Raft
We propose a Byzantine Fault Tolerant variant of the Raft consensus algorithm, BFTRaft, inspired by the original Raft[1] algorithm and the Practical Byzantine Fault Tolerance algorithm[2]. BFT Raft maintains the safety, fault tolerance, and liveness properties of Raft in the presence of Byzantine faults, while also aiming towards to Raft’s goal of simplicity and understandability. We have imple...
متن کاملByung-gon Chun
International Computer Science Institute, Berkeley, CA 2007 – Present Postdoctoral Researcher, Networking Group, working with Prof. Scott Shenker, Dr. Petros Maniatis, and Dr. Sylvia Ratnasamy Diverse replication for single-machine Byzantine-fault tolerance: Investigate exploiting cores in many-core systems to defend against software attacks. Explore different isolation and software diversity m...
متن کاملIntrusion-Tolerant Group Management for Mobile Ad-Hoc Networks
This paper presents PICO, a distributed protocol that manages group membership and keying in mobile adhoc networks (MANETs). PICO tolerates a limited number of Byzantine nodes and an additional limited number of crashed nodes. It allows clients to join or leave a dynamically changing group and provides group members with a dynamically updated group encryption key. Since MANETs are characterized...
متن کاملDistributed Computing Column 39: Byzantine Generals: The Next Generation
The relevance of Byzantine fault tolerance in the context of cloud computing has been questioned[3]. While arguments against Byzantine fault tolerance seemingly makes sense in the context of a singlecloud, i.e., a large-scale cloud infrastructure that resides under control of a single, typically commercialprovider, these arguments are less obvious in a broader context of the Int...
متن کامل