Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
csu1231600826.pdf (818.73 KB)
ETD Abstract Container
Abstract Header
Byzantine Fault Tolerance for Nondeterministic Applications
Author Info
Chen, Bo
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826
Abstract Details
Year and Degree
2008, Master of Science in Electrical Engineering, Cleveland State University, Fenn College of Engineering.
Abstract
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 because such applications often exhibit sophisticated non-deterministic behaviors that the existing BFT algorithms could not cope with. In this thesis, we propose a classification of common types of replica nondeterminism with respect to the requirement of achieving Byzantine fault tolerance, and describe the design and implementation of the core mechanisms necessary to handle such replica nondeterminism within a Byzantine fault tolerance framework. In addition, we evaluated the performance of our BFT library, referred to as ND-BFT using both a micro-benchmark application and a more realistic online porker game application. The performance results show that the replicated online poker game performs approximately 13% slower than its nonreplicated counterpart in the presence of small number of players.
Committee
Wenbing Zhao, PhD (Committee Chair)
Yongjian Fu, PhD (Committee Member)
Ye Zhu, PhD (Committee Co-Chair)
Pages
79 p.
Subject Headings
Computer Science
Keywords
Byzantine fault tolerance
;
replica nondeterminism
;
security
;
replica consistency
;
replication
;
intrusion tolerance
;
performance
;
online poker game
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Chen, B. (2008).
Byzantine Fault Tolerance for Nondeterministic Applications
[Master's thesis, Cleveland State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826
APA Style (7th edition)
Chen, Bo.
Byzantine Fault Tolerance for Nondeterministic Applications.
2008. Cleveland State University, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826.
MLA Style (8th edition)
Chen, Bo. "Byzantine Fault Tolerance for Nondeterministic Applications." Master's thesis, Cleveland State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
csu1231600826
Download Count:
590
Copyright Info
© 2008, all rights reserved.
This open access ETD is published by Cleveland State University and OhioLINK.