{1,2,3}-Restricted Connectivity of $(n,k)$-Enhanced Hypercubes

2019 ◽  
Vol 63 (9) ◽  
pp. 1355-1371 ◽  
Author(s):  
Hui Yu ◽  
Jiejie Yang ◽  
Limei Lin ◽  
Yanze Huang ◽  
Jine Li ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Failure Rate ◽  
Upper Bound ◽  
Measurement Accuracy ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Connectivity Property ◽  
Lower Vertex ◽  
Connectivity Measure

Abstract The connectivity of a graph is a classic measure for fault tolerance of the network. Restricted connectivity measure is a crucial subject for a multiprocessor system’s ability to tolerate fault processors, and improves the connectivity measurement accuracy. Furthermore, if a network possesses a restricted connectivity property, it is more reliable with a lower vertex failure rate compared with other networks. The $\left (n,k\right )$-dimensional enhanced hypercube, denoted by $Q_{n,k}$, a variant of hypercube, which is a well-known interconnection network. In this paper, we analyze the fault tolerant properties for $\left (n,k\right )$-enhanced hypercube, and establish the $1$-restricted connectivity of $Q_{n,k} (n\ge k+1)$ and $\{2,3\}$-restricted connectivity of $(n,k)$-enhanced hypercube $Q_{n,k} (n=k+1)$. Furthermore, we propose the tight upper bound of $\{2,3\}$-restricted connectivity of $Q_{n,k} (n> k+1)$. Moreover, we show many figures to better illustrate the process of the proofs.

Designing a New Class of Fault Tolerant Multistage Interconnection Networks

2005 ◽  
Vol 06 (04) ◽  
pp. 361-382 ◽  
Author(s):  
K. V. Arya ◽  
R. K. Ghosh
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Multistage Interconnection Networks ◽  
Multistage Interconnection Network ◽  
New Class

This paper proposes a technique to modify a Multistage Interconnection Network (MIN) to augment it with fault tolerant capabilities. The augmented MIN is referred to as Enhanced MIN (E-MIN). The technique employed for construction of E-MIN is compared with the two known physical fault tolerance techniques, namely, extra staging and chaining. EMINs are found to be more generic than extra staged networks and less expensive than chained networks. The EMIN realizes all the permutations realizable by the original MIN. The routing strategies under faulty and fault free conditions are shown to be very simple in the case of E-MINs.

scholarly journals Hierarchical Hexagon: A New Fault-Tolerant Interconnection Network for Parallel Systems

2021 ◽  
Vol 21 (1) ◽  
pp. 32-49
Author(s):  
Laxminath Tripathy ◽  
Chita Ranjan Tripathy
Keyword(s):  
Fault Tolerance ◽  
Hamiltonian Cycle ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Parallel Systems ◽  
Node Degree ◽  
Topological Parameters ◽  
Massively Parallel Systems ◽  
Network Cost ◽  
Hypercube Networks

Abstract A new interconnection network topology called Hierarchical Hexagon HH(n) is proposed for massively parallel systems. The new network uses a hexagon as the primary building block and grows hierarchically. Our proposed network is shown to be superior to the star based and the hypercube networks, with respect to node degree, diameter, network cost, and fault tolerance. We thoroughly analyze different topological parameters of the proposed topology including fault tolerance routing and embedding Hamiltonian cycle.

scholarly journals A job checkpointing system for computational grids

2013 ◽  
Vol 3 (1) ◽  
Author(s):  
Mohammed Amoon
Keyword(s):  
Fault Tolerance ◽  
Failure Rate ◽  
Failure Time ◽  
Fault Tolerant ◽  
Turnaround Time ◽  
Computational Grids ◽  
Simulation Experiments ◽  
Geographically Distributed ◽  
Grid Load ◽  
Grid Resources

AbstractFault tolerance is an important property in computational grids since the resources are geographically distributed. Job checkpointing is one of the most common utilized techniques for providing fault tolerance in computational grids. The efficiency of checkpointing depends on the choice of the checkpoint interval. Inappropriate checkpointing interval can delay job execution. In this paper, a fault-tolerant scheduling system based on checkpointing technique is presented and evaluated. When scheduling a job, the system uses both average failure time and failure rate of grid resources combined with resources response time to generate scheduling decisions. The system uses the failure rate of the assigned resources to calculate the checkpoint interval for each job. Extensive simulation experiments are conducted to quantify the performance of the proposed system. Experiments have shown that the proposed system can considerably improve throughput, turnaround time, grid load and failure tendency of computational grids.

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions

2019 ◽  
Vol 30 (08) ◽  
pp. 1301-1315 ◽  
Author(s):  
Liqiong Xu ◽  
Shuming Zhou ◽  
Weihua Yang
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Cayley Graphs ◽  
Disjoint Paths ◽  
Local Connectivity ◽  
Communication Links ◽  
Restricted Condition ◽  
Vertex Disjoint

An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. Connectivity is an important metric for fault tolerance of interconnection networks. A graph [Formula: see text] is said to be maximally local-connected if each pair of vertices [Formula: see text] and [Formula: see text] are connected by [Formula: see text] vertex-disjoint paths. In this paper, we show that Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected and are also [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have a triangle, [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have no triangles. Furthermore, under the restricted condition that each vertex has at least two fault-free adjacent vertices, Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected if their corresponding transposition generating graphs have no triangles.

The Generalized Connectivity of Bubble-Sort Star Graphs

2019 ◽  
Vol 30 (05) ◽  
pp. 793-809
Author(s):  
Shu-Li Zhao ◽  
Rong-Xia Hao
Keyword(s):  
Fault Tolerance ◽  
Upper Bound ◽  
Interconnection Networks ◽  
Interconnection Network ◽  
Star Graph ◽  
Important Indicator ◽  
Star Graphs ◽  
Generalized Connectivity ◽  
Internally Disjoint Trees

The connectivity plays an important role in measuring the fault tolerance and reliability of interconnection networks. The generalized [Formula: see text]-connectivity of a graph [Formula: see text], denoted by [Formula: see text], is an important indicator of a network’s ability for fault tolerance and reliability. The bubble-sort star graph, denoted by [Formula: see text], is a well known interconnection network. In this paper, we show that [Formula: see text] for [Formula: see text], that is, for any three vertices in [Formula: see text], there exist [Formula: see text] internally disjoint trees connecting them in [Formula: see text] for [Formula: see text], which attains the upper bound of [Formula: see text] given by Li et al. for [Formula: see text].

scholarly journals Cycle checking algorithm for verifying the connectivity of a fault tolerant network structure

2018 ◽  
Vol 7 (4) ◽  
pp. 2729
Author(s):  
Nethravathi B ◽  
Kamalesh V. N
Keyword(s):  
Fault Tolerance ◽  
Network Structure ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Network Structures ◽  
Network Graph ◽  
Design Algorithm ◽  
Node Connectivity ◽  
Network Topologies ◽  
The Stability

The key challenges while designing a communication network structures and critical network topologies is to take accounts of aspects related to failures. Over years efforts are being made for constructing quality fault tolerance network structures. The performance of a network application depends on the stability and survivability of underlined interconnection network structure. Node –connectivity of a network graph is a globally accepted deterministic measure for measuring the fault tolerance in a network structure. Once the network is designed and constructed by any one of the existing design algorithm and claimed that the constructed network is k-connected network, this research paper proposes a cute cycle based method to verify the same. 

SEGIN-Minus: A New Approach to Design Reliable and Fault-Tolerant MIN

2020 ◽  
Vol 13 (3) ◽  
pp. 370-380
Author(s):  
Shilpa Gupta ◽  
Gobind Lal Pahuja
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Network Reliability ◽  
Low Cost ◽  
Destination Node ◽  
Node Pair ◽  
Output Terminal ◽  
Multiple Processors

Background: VLSI technology advancements have resulted the requirements of high computational power, which can be achieved by implementing multiple processors in parallel. These multiple processors have to communicate with their memory modules by using Interconnection Networks (IN). Multistage Interconnection Networks (MIN) are used as IN, as they provide efficient computing with low cost. Objective: the objective of the study is to introduce new reliable MIN named as a (Shuffle Exchange Gamma Interconnection Network Minus) SEGIN-Minus, which provide reliability and faulttolerance with less number of stages. Methods: MUX at input terminal and DEMUX at output terminal of SEGIN has been employed with reduction in one intermidiate stage. Fault tolerance has been introduced in the form of disjoint paths formed between each source-destnation node pair. Hence reliability has been improved. Results: Terminal, Broadcast and Network Reliability has been evaluated by using Reliability Block Diagrams for each source-destination node pair. The results have been shown, which depicts the hiher reliability values for newly proposed network. The cost analysis shows that new SEGINMinus is a cheaper network than SEGIN. Conclusion: SEGIN-Minus has better reliability and Fault-tolerance than priviously proposed SEGIN.

Fault Tolerant Guidance of Under-Actuated Satellite Formation Flying Using Inter-Vehicle Coulomb Force

2019 ◽  
Vol 2 (1) ◽  
pp. 43-52
Author(s):  
Alireza Alikhani ◽  
Safa Dehghan M ◽  
Iman Shafieenejad
Keyword(s):  
Fault Tolerance ◽  
Formation Flying ◽  
Fault Tolerant ◽  
Coulomb Force ◽  
Control Law ◽  
Triangular Form ◽  
Satellite Formation Flying ◽  
Satellite Formation ◽  
Guidance Law ◽  
Tolerance Approach

In this study, satellite formation flying guidance in the presence of under actuation using inter-vehicle Coulomb force is investigated. The Coulomb forces are used to stabilize the formation flying mission. For this purpose, the charge of satellites is determined to create appropriate attraction and repulsion and also, to maintain the distance between satellites. Static Coulomb formation of satellites equations including three satellites in triangular form was developed. Furthermore, the charge value of the Coulomb propulsion system required for such formation was obtained. Considering Under actuation of one of the formation satellites, the fault-tolerance approach is proposed for achieving mission goals. Following this approach, in the first step fault-tolerant guidance law is designed. Accordingly, the obtained results show stationary formation. In the next step, tomaintain the formation shape and dimension, a fault-tolerant control law is designed.

Fault Tolerant Reliable Protocol (FTRP) Performance Evaluation in Wireless Sensor Networks: An Extensitive Study

2019 ◽  
pp. 1-36
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Biological Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Good Performer ◽  
Wide Range

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.

scholarly journals Fault Analysis and Non-Redundant Fault Tolerance in 3-Level Double Conversion UPS Systems Using Finite-Control-Set Model Predictive Control

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2210
Author(s):  
Luís Caseiro ◽  
André Mendes
Keyword(s):  
Fault Tolerance ◽  
Model Predictive Control ◽  
Predictive Control ◽  
Fault Tolerant ◽  
Finite Control ◽  
Control Set ◽  
Corrective Actions ◽  
Uninterruptible Power ◽  
Hardware Reconfiguration ◽  
Redundant Fault

Fault-tolerance is critical in power electronics, especially in Uninterruptible Power Supplies, given their role in protecting critical loads. Hence, it is crucial to develop fault-tolerant techniques to improve the resilience of these systems. This paper proposes a non-redundant fault-tolerant double conversion uninterruptible power supply based on 3-level converters. The proposed solution can correct open-circuit faults in all semiconductors (IGBTs and diodes) of all converters of the system (including the DC-DC converter), ensuring full-rated post-fault operation. This technique leverages the versatility of Finite-Control-Set Model Predictive Control to implement highly specific fault correction. This type of control enables a conditional exclusion of the switching states affected by each fault, allowing the converter to avoid these states when the fault compromises their output but still use them in all other conditions. Three main types of corrective actions are used: predictive controller adaptations, hardware reconfiguration, and DC bus voltage adjustment. However, highly differentiated corrective actions are taken depending on the fault type and location, maximizing post-fault performance in each case. Faults can be corrected simultaneously in all converters, as well as some combinations of multiple faults in the same converter. Experimental results are presented demonstrating the performance of the proposed solution.

Sign in / Sign up

Export Citation Format

Share Document