Byzantine Fault Tolerance for Nondeterministic Applications

Bibliographic Details
Main Author:	Chen, Bo
Language:	English
Published:	Cleveland State University / OhioLINK 2008
Subjects:	Computer Science Byzantine fault tolerance replica nondeterminism security replica consistency replication intrusion tolerance performance online poker game
Online Access:	http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826

id	ndltd-OhioLink-oai-etd.ohiolink.edu-csu1231600826
record_format	oai_dc
spelling	ndltd-OhioLink-oai-etd.ohiolink.edu-csu12316008262021-08-03T05:34:43Z Byzantine Fault Tolerance for Nondeterministic Applications Chen, Bo Computer Science Byzantine fault tolerance replica nondeterminism security replica consistency replication intrusion tolerance performance online poker game 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. 2008 English text Cleveland State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826 http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection	NDLTD
language	English
sources	NDLTD
topic	Computer Science Byzantine fault tolerance replica nondeterminism security replica consistency replication intrusion tolerance performance online poker game
spellingShingle	Computer Science Byzantine fault tolerance replica nondeterminism security replica consistency replication intrusion tolerance performance online poker game Chen, Bo Byzantine Fault Tolerance for Nondeterministic Applications
author	Chen, Bo
author_facet	Chen, Bo
author_sort	Chen, Bo
title	Byzantine Fault Tolerance for Nondeterministic Applications
title_short	Byzantine Fault Tolerance for Nondeterministic Applications
title_full	Byzantine Fault Tolerance for Nondeterministic Applications
title_fullStr	Byzantine Fault Tolerance for Nondeterministic Applications
title_full_unstemmed	Byzantine Fault Tolerance for Nondeterministic Applications
title_sort	byzantine fault tolerance for nondeterministic applications
publisher	Cleveland State University / OhioLINK
publishDate	2008
url	http://rave.ohiolink.edu/etdc/view?acc_num=csu1231600826
work_keys_str_mv	AT chenbo byzantinefaulttolerancefornondeterministicapplications
_version_	1719422031058960384

Byzantine Fault Tolerance for Nondeterministic Applications

Similar Items