Reliability analysis of fault-tolerance voyage data recorder system

Author(s):  
Yanling Hao ◽  
Wenjun Zhou
2020 ◽  
Vol 30 (02) ◽  
pp. 2050009
Author(s):  
Qifan Zhang ◽  
Liqiong Xu ◽  
Weihua Yang ◽  
Shanshan Yin

Let [Formula: see text] be a non-complete graph, a subset [Formula: see text] is called a [Formula: see text]-component cut of [Formula: see text], if [Formula: see text] is disconnected and has at least [Formula: see text] components. The cardinality of the minimum [Formula: see text]-component cut is the [Formula: see text]-component connectivity of [Formula: see text] and is denoted by [Formula: see text]. The [Formula: see text]-component connectivity is a natural extension of the classical connectivity. As an application, the [Formula: see text]-component connectivity can be used to evaluate the reliability and fault tolerance of an interconnection network structure based on a graph model. In a previous work, E. Cheng et al. obtained the [Formula: see text]-component connectivity of the generalized exchanged hypercube [Formula: see text] for [Formula: see text] and [Formula: see text]. In this paper, we continue the work and determine that [Formula: see text] for [Formula: see text]. Moreover, we show that every optimal [Formula: see text]-component cut of [Formula: see text] is trivial for [Formula: see text] and [Formula: see text].


1995 ◽  
Vol 05 (02) ◽  
pp. 199-213 ◽  
Author(s):  
AMIYA NAYAK ◽  
NICOLA SANTORO

A common technique to improve the reliability of loop (or ring) networks is by introducing link redundancy; that is, by providing several alternative paths for communication between pairs of nodes. With alternate paths between nodes, the network can now sustain several node and link failures by bypassing the faulty components. However, faults occurring at strategic locations in a ring can prevent the computation by disrupting I/O operations, blocking the flow of information, or even segmenting the structure into pieces which can no longer be suitable for any practical purpose. An extensive characterization of fault-tolerance in ring topologies is given in this paper. This characterization augments the results known in the literature to date. The characterization has revealed several properties which describe the problem of constructing subrings and linear arrays in the presence of node failures in the original ring for a specified link configuration. Also in this paper, bounds are established on the degree of fault tolerance achievable in a redundant loop network, with a given degree of redundancy, when performing a computation that requires a minimal number of operational nodes. Also the bounds on the size of the problems guaranteed to be solved in the presence of a given number of faults in the network are derived.


Author(s):  
I V Kovalev ◽  
D I Kovalev ◽  
V S Chefonov ◽  
N A Testoedvov ◽  
A A Koltyshev ◽  
...  

Author(s):  
RONALD FERNANDES ◽  
SANJAY KAMAT ◽  
ARKADY KANEVSKY

In this paper we develop a pipeline processing system called NMR pipeline. In an NMR pipeline, processing elements at each stage are replicated to achieve high fault tolerance. Each stage of the pipeline is an N-Modular Redundant (NMR) System. This design combines the benefits of pipeline processing and NMR systems and is suitable for high speed safety-critical computing. Reliability analysis of this system is presented taking into account possible failures of processing and communication elements. The optimality of the system is defined in terms a suitably defined cost function that accounts for the component costs and the costs associated with system unreliability.


Sign in / Sign up

Export Citation Format

Share Document