Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

2014

Electrical and Computer Engineering

Cleveland State University

Fault-tolerant computing

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Application Aware For Byzantine Fault Tolerance, Hua Chai Jan 2014

Application Aware For Byzantine Fault Tolerance, Hua Chai

ETD Archive

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 replicas. However, most state-of-the-art BFT algorithms are designed for generic stateful applications that require the total ordering of all incoming requests and the sequential execution of such requests. In this dissertation research, we recognize that a straightforward application of existing BFT algorithms is often inappropriate …


Byzantine Fault Tolerance For Distributed Systems, Honglei Zhang Jan 2014

Byzantine Fault Tolerance For Distributed Systems, Honglei Zhang

ETD Archive

The growing reliance on online services imposes a high dependability requirement on the computer systems that provide these services. Byzantine fault tolerance (BFT) is a promising technology to solidify such systems for the much needed high dependability. BFT employs redundant copies of the servers and ensures that a replicated system continues providing correct services despite the attacks on a small portion of the system. In this dissertation research, I developed novel algorithms and mechanisms to control various types of application nondeterminism and to ensure the long-term reliability of BFT systems via a migration-based proactive recovery scheme. I also investigated a …