An Improved Fuzzy Voting Scheme for Fault Tolerant Systems

2015 ◽  
Vol 6 (2) ◽  
pp. 41-49
Author(s):  
Ram Murti Rawat ◽  
Tarun Kumar Gupta ◽  
Mohammad Sajid ◽  
Shiv Prakash ◽  
Dinesh Prasad Sahu ◽  
...  
Keyword(s):  
Fault Tolerant ◽  
Critical Systems ◽  
Proposed Model ◽  
Safety Critical Systems ◽  
Voting Scheme ◽  
Fault Tolerant Systems ◽  
Fault Masking ◽  
Overall Reliability ◽  
Single Objective ◽  
Better Than

Voting is a widely used fault masking techniques for safety-critical systems to enhance the overall reliability of the system. Researchers over the period have proposed numerous advanced techniques in order to improve on the drawback of the existing methods. In this paper a fuzzy voting scheme has been survey and a generalized improved fuzzy voting scheme has been proposed. A comparative study of these schemes has also been carried out. It is found that proposed model is better than existing models. Single objective, multi-objective objective and many objective will be applied in future.

Consistency Is Not Enough in Byzantine Fault Tolerance

2018 ◽  
pp. 1238-1247
Author(s):  
Wenbing Zhao
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Large Body ◽  
Random Numbers ◽  
Security Requirement ◽  
Critical Systems ◽  
Byzantine Fault Tolerance ◽  
Byzantine Fault ◽  
Mission Critical ◽  
Fault Tolerant Systems

The use of good random numbers is crucial to the security of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious issue arises, i.e., how do we preserve the integrity of the systems while ensuring strong replica consistency? Despite the fact that there exists a large body of work on how to render replicas deterministic under the benign fault model, the solutions regarding the random number control are often overly simplistic without regard to the security requirement, and hence, they are not suitable for practical Byzantine fault tolerance. In this chapter, we present a novel integrity-preserving replica coordination algorithm for Byzantine fault tolerant systems. The central idea behind our CD-BFT algorithm is that all random numbers to be used by the replicas are collectively determined, based on the contributions made by a quorum of replicas, at least f+1 of which are not faulty.

OPTIMAL COMPONENT SELECTION APPROACH FOR FAULT-TOLERANT SOFTWARE SYSTEM UNDER CRB INCORPORATING BUILD-OR-BUY DECISION

2013 ◽  
Vol 20 (06) ◽  
pp. 1350024 ◽  
Author(s):  
P. C. JHA ◽  
RAMANDEEP KAUR ◽  
SHIVANI BALI ◽  
SUSHILA MADAN
Keyword(s):  
Fault Tolerant ◽  
Quality Standards ◽  
Software System ◽  
Critical Systems ◽  
Component Selection ◽  
Proposed Model ◽  
Selection Approach ◽  
Block Scheme ◽  
Commercial Off The Shelf ◽  
Recovery Block

Application Package Software (APS) has emerged as a ready-to-use solution for the software industry. The software system comprises of a number of components which can be either purchased from the vendor in the form of COTS (Commercial Off-the-Shelf) or can be built in-house. Such a decision is known as Build-or-Buy decision. Under the situations wherein the software has the responsibility of supervising life-critical systems, the inception of errors in software due to inadequate or incomplete testing, is not acceptable. Such life-critical systems enforces upon meeting the quality standards of the software as unforbiddenable. This can be achieved by incorporating a fault-tolerant design that enables a system to continue its intended operation rather than failing completely when some part of the system fails. Moreover, while designing a fault-tolerant system, it must be apprehended that 100% fault tolerance can never be achieved and the closer we try to get to 100%, the more costly the system will be. The proposed model shall incorporate consensus recovery block scheme of fault tolerant techniques. Through this paper, we shall focus on build-or-buy decision for an APS in order to facilitate optimal component selection thereby, maximizing the reliability and minimizing the overall cost and source lines of code of the entire system. Further, since the proposed problem has incompleteness and unreliability of input information such as execution time and cost, hence, the environment in the proposed model is taken as fuzzy.

Consistency Is Not Enough in Byzantine Fault Tolerance

2019 ◽  
pp. 88-99
Author(s):  
Wenbing Zhao
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Large Body ◽  
Random Numbers ◽  
Security Requirement ◽  
Critical Systems ◽  
Byzantine Fault Tolerance ◽  
Byzantine Fault ◽  
Mission Critical ◽  
Fault Tolerant Systems

The use of good random numbers is crucial to the security of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious issue arises (i.e., how do we preserve the integrity of the systems while ensuring strong replica consistency?). Despite the fact that there exists a large body of work on how to render replicas deterministic under the benign fault model, the solutions regarding the random number control are often overly simplistic without regard to the security requirement, and hence, they are not suitable for practical Byzantine fault tolerance. In this chapter, the authors present a novel integrity-preserving replica coordination algorithm for Byzantine fault tolerant systems. The central idea behind our CD-BFT algorithm is that all random numbers to be used by the replicas are collectively determined, based on the contributions made by a quorum of replicas, at least f+1 of which are not faulty.

Sign in / Sign up

Export Citation Format

Share Document