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
.
EngagedScholarship@CSU Byzantine Fault Tolerance for Nondeterministic Applications BYZANTINE FAULT TOLERANCE FOR NONDETERMINISTIC APPLICATIONS
2006
unpublished
The growing reliance on online services accessible on the Internet demands highly reliable system that would not be interrupted when encountering faults. A number of Byzantine fault tolerance (BFT) algorithms have been developed to mask the most complicated type of faults -Byzantine faults such as software bugs, operator mistakes, and malicious attacks, which are usually the major cause of service interruptions. However, it is often difficult to apply these algorithms to practical applications
fatcat:cs73nerf65gd5bqttervhhvugi