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.
Filters
Customizable Fault Tolerance forWide-Area Replication
2007
Symposium on Reliable Distributed Systems. Proceedings
Preserved Fulltext
We present a new Byzantine fault-tolerant protocol that establishes a reliable virtual communication link between logical machines. ...
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. ...
The HQ protocol [11] combines the use of quorum replication with Byzantine fault-tolerant agreement, using a more lightweight quorum-based protocol during normal-case operation and BFT to resolve contention ...
doi:10.1109/srds.2007.4365685
fatcat:h6qfb4iev5afvjla4a76ww4ofa
Customizable Fault Tolerance forWide-Area Replication
2007
2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)
Preserved Fulltext
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.
We present a new Byzantine fault-tolerant protocol that establishes a reliable virtual communication link between logical machines. ...
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. ...
The HQ protocol [11] combines the use of quorum replication with Byzantine fault-tolerant agreement, using a more lightweight quorum-based protocol during normal-case operation and BFT to resolve contention ...
doi:10.1109/srds.2007.40
dblp:conf/srds/AmirCKL07
fatcat:hqfhzvtbsbehbmran5p2m5rlya
Byzantine replication under attack
2008
2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We present a new Byzantine replication protocol that achieves the criterion and evaluate its performance in fault-free configurations and when under attack. ...
Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, in the presence of Byzantine faults. ...
This paper focused on leader-based Byzantine fault-tolerant SMR protocols. Other approaches are possible, such as using randomization, quorum systems, and hybrid architectures. ...
doi:10.1109/dsn.2008.4630088
dblp:conf/dsn/AmirCKL08
fatcat:mxvpnwmoirgixmt3iavct7wkie
Prime: Byzantine Replication under Attack
2011
IEEE Transactions on Dependable and Secure Computing
Preserved Fulltext
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.
We present a new Byzantine fault-tolerant replication protocol that meets the new correctness criterion and evaluate its performance in fault-free executions and when under attack. ...
Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, even in the presence of Byzantine faults. ...
Like many existing Byzantine fault-tolerant replication protocols, Prime is leader based. ...
doi:10.1109/tdsc.2010.70
fatcat:yjlvjojwafas7pthjml2fhqe4a
Making Reads in BFT State Machine Replication Fast, Linearizable, and Live
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine replication protocol that achieves a performance comparable to non-replicated systems in realistic environments. ...
A reason for such high performance is the set of optimizations introduced in the protocol. ...
The PBFT Algorithm The Practical Byzantine Fault Tolerance (PBFT) [3] algorithm was arguably the first practical approach for tolerating Byzantine faults. ...
arXiv:2107.11144v1
fatcat:bzqzh7usb5gfpgsrxddgpoqfge
Zzyzx: Scalable fault tolerance through Byzantine locking
2010
2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Zzyzx is a Byzantine fault-tolerant replicated state ma chine protocol that outperforms prior approaches and pro vides near-linear throughput scaling. ...
Using a new tech nique called Byzantine Locking, Zzyzx allows a client to extract state from an underlying replicated state machine and access it via a second protocol specialized for use by a single client ...
Guerraoui et al. introduce a modular framework for Byzantine fault-tolerant replicated state machine protocols and the Quorum and Chain subprotocols [14] . ...
doi:10.1109/dsn.2010.5544297
dblp:conf/dsn/HendricksSGR10
fatcat:vkzjwk4okzglxn4334wcyeenvi
From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation
2012
2012 Ninth European Dependable Computing Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present a new algorithm for state machine replication that is built around a leader-driven consensus primitive. ...
consensus to BFT state machine replication. ...
To overcome these drawbacks, Cowling et al. proposed HQ [10] , a hybrid Byzantine fault-tolerant SMR protocol similar to Q/U in the absence of contention. ...
doi:10.1109/edcc.2012.32
dblp:conf/edcc/SousaB12
fatcat:qwpzjtshvvgo7jbuamfn76ezxq
GEMINI: A Hybrid Byzantine Fault Tolerant Protocol for Reliable Composite Web Services Orchestrated Delivery
2016
Journal of clean energy technologies
Preserved Fulltext
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.
GEMINI uses a light-weight replication-based BFT protocol to ensure the BFT for service delivery modules, and uses a speculative quorum-based BFT protocol to ensure components BFT. ...
To overcome such limitation, this paper proposes GEMINI; a hybrid BFT protocol for reliable composite web services orchestrated delivery. ...
Therefore, we proposed GEMINI; a hybrid asynchronous Byzantine fault tolerant protocol for reliable composite web services orchestrated delivery. ...
doi:10.7763/ijcte.2016.v8.1071
fatcat:qomo6h3f3rc7vaozi65twh4him
Byzantine Fault-Tolerance with Commutative Commands
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
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.
First, it presents the first byzantine fault-tolerant generic broadcast protocol. ...
Second, the paper presents an efficient state machine replication protocol that tolerates byzantine failures. ...
The first contribution of this paper is a byzantine fault-tolerant generic broadcast protocol. ...
doi:10.1007/978-3-642-25873-2_23
fatcat:gjf3ruopmjep7a5rwrbc5x6j2i
hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost
2015
IEEE Transactions on Dependable and Secure Computing
Preserved Fulltext
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.
We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. ...
Abstract-We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. ...
ACKNOWLEDGEMENTS We would like to thank Matt Bishop, Jeff Rowe, Haibin Zhang, Hein Meling, Tiancheng Chang, and Leander Jehi for their helpful comments and contributions to the paper. ...
doi:10.1109/tdsc.2014.2312331
fatcat:2vnwqiqeuzbcvb7vkxbv5brtqy
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
2007
Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)
Preserved Fulltext
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.
LBTS uses a novel Byzantine quorum systems replication technique in which most operations are implemented by quorum protocols while stronger operations are implemented by more expensive protocols based ...
This paper presents an efficient implementation of LBTS, a Linearizable Byzantine fault-tolerant Tuple Space. ...
Appendix: LBTS Correctness Proof In this Appendix we prove that our protocols implement a tuple space that satisfies the correctness conditions stated in Section 3. ...
doi:10.1109/nca.2007.14
dblp:conf/nca/BessaniCFL07
fatcat:t4fz53bxnngzbmuy333rv5ksqi
An Efficient Byzantine-Resilient Tuple Space
2009
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This paper presents an efficient implementation of a Linearizable Byzantine faulttolerant Tuple Space (LBTS) that uses a novel Byzantine quorum systems replication technique in which most operations are ...
implemented by quorum protocols while stronger operations are implemented by more expensive protocols based on consensus. ...
APPENDIX
LBTS CORRECTNESS PROOF In this Appendix we prove that our protocols implement a tuple space that satisfies the correctness conditions stated in Section III. ...
doi:10.1109/tc.2009.71
fatcat:yvujwfoq25ap3iflzpre5vsqvq
Two New Protocols for Fault Tolerant Agreement
2011
International Journal of Distributed and Parallel systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The standard protocols such as BFTDC [3] , Zyzzyva [4] and PBFT [5] handle the problem to a greater extent. ...
The dynamic analysis of the protocol reflects that, in a faulty scenario, the proactive approach is computationally more efficient with reduced latency as compared to reactive one. ...
HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance [9] HQ is also a state machine replication protocol designed to handle deterministic as well as arbitrary operations. ...
doi:10.5121/ijdps.2011.2101
fatcat:nawmx2dstzbjdil74sod5uwkjm
Upright cluster services
2009
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles - SOSP '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The UpRight library seeks to make Byzantine fault tolerance (BFT) a simple and viable alternative to crash fault tolerance for a range of cluster services. ...
Our design choices in UpRight favor simplifying adoption by existing applications; performance is a secondary concern. ...
Replication cost UpRight allows applications to add Byzantine fault tolerance to their existing crash tolerance at minimal cost. ...
doi:10.1145/1629575.1629602
dblp:conf/sosp/ClementKLWADR09
fatcat:jug4ayr7inhhtoagd6cut2qobu
Zyzzyva
2008
Communications of the ACM
Preserved Fulltext
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 enticing formulation of this vision is Byzantine Fault-Tolerant (BFT) state machine replication, in which a group of servers collectively act as a correct server even if some of the servers misbehave ...
In this article, we present Zyzzyva, a protocol that uses speculation to reduce the cost of BFT replication. ...
Abd-El-Malek for sharing source code for PBFT, HQ, and Q/U, respectively. We are grateful for M. Herlihy's and B. Liskov's feedback on earlier drafts of this article. ...
doi:10.1145/1400214.1400236
fatcat:a2zmic7lzvaspavpgdzffwbime
« Previous
Showing results 1 — 15 out of 41 results