Bounds on the fault-diameter of graphs

Networks ◽  
2017 ◽  
Vol 70 (2) ◽  
pp. 132-140
Author(s):  
Peter Dankelmann
Keyword(s):  
Fault Diameter

Communication Performance Evaluation of the Locally Twisted Cube

2020 ◽  
Vol 31 (02) ◽  
pp. 233-252
Author(s):  
Yuejuan Han ◽  
Lantao You ◽  
Cheng-Kuan Lin ◽  
Jianxi Fan
Keyword(s):  
Performance Evaluation ◽  
Interconnection Networks ◽  
High Performance ◽  
Communication Performance ◽  
Wide Diameter ◽  
Fault Diameter ◽  
Twisted Cube ◽  
Hypercube Network ◽  
High Performance Computers ◽  
Important Variant

The topology properties of multi-processors interconnection networks are important to the performance of high performance computers. The hypercube network [Formula: see text] has been proved to be one of the most popular interconnection networks. The [Formula: see text]-dimensional locally twisted cube [Formula: see text] is an important variant of [Formula: see text]. Fault diameter and wide diameter are two communication performance evaluation parameters of a network. Let [Formula: see text]), [Formula: see text] and [Formula: see text] denote the diameter, the [Formula: see text] fault diameter and the wide diameter of [Formula: see text], respectively. In this paper, we prove that [Formula: see text] if [Formula: see text] is an odd integer with [Formula: see text], [Formula: see text] if [Formula: see text] is an even integer with [Formula: see text].

Conditional fault diameter of crossed cubes

2009 ◽  
Vol 69 (1) ◽  
pp. 91-99 ◽  
Author(s):  
Chien-Ping Chang ◽  
Chia-Ching Wu
Keyword(s):  
Fault Diameter

Anomaly Detection for Equipment Condition via Frequency Spectrum Entropy

2012 ◽  
Vol 433-440 ◽  
pp. 3753-3758 ◽  
Author(s):  
Wei Dong Cheng ◽  
Tian Yang Wang ◽  
Wei Gang Wen ◽  
Heng Wang ◽  
Jian Yong Li
Keyword(s):  
Anomaly Detection ◽  
Normal Condition ◽  
Experimental Test ◽  
Detection Method ◽  
Test Bed ◽  
Motor Shaft ◽  
Maximum Value ◽  
Fault Diameter ◽  
Computation Load ◽  
Spectrum Amplitude

Some of the critical and practical issues regarding the problem of condition monitoring of mobile equipment have been discussed, and an anomaly detection method without priori knowledge has been proposed. The method involves setting amplitude benchmark via spectrum amplitude in normal condition and obtaining the maximum entropy value in abnormal condition. The condition identification is achieved through estimating the amount of anomaly information in spectrum, and a measure of anomaly condition is given by the anomaly degree derived from entropy value dividing the maximum value. The sensitivity, stability and computation load of the method have been also discussed, and the method is validated on an experimental test-bed that the test bearings with different fault diameter support the motor shaft.

scholarly journals Conditional Fault-Diameter of Torus Networks

2005 ◽  
Vol 10 ◽  
pp. 51
Author(s):  
Abderezak Touzene ◽  
Khaled Day
Keyword(s):  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithms ◽  
Star Graph ◽  
Faulty Processor ◽  
Node Connectivity ◽  
Fault Diameter ◽  
Torus Networks ◽  
Vertex Disjoint

We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition, the square torus, whose connectivity is 4, can tolerate up to 5 faulty nodes without becoming disconnected. The conditional node connectivity is, therefore, 6. We also show that the conditional fault-diameter of the square torus is equal to the fault-free diameter plus two. With this result the torus joins a group of interconnection networks (including the hypercube and the star-graph) whose conditional fault-diameter has been shown to be only two units over the fault-free diameter. Two fault-tolerant routing algorithms are discussed based on the proposed vertex disjoint paths construction.  

Conditional Fault Diameter of Star Graph Networks

1996 ◽  
Vol 33 (1) ◽  
pp. 91-97 ◽  
Author(s):  
Yordan Rouskov ◽  
Shahram Latifi ◽  
Pradip K. Srimani
Keyword(s):  
Star Graph ◽  
Fault Diameter ◽  
Star Graph Networks
Sign in / Sign up

Export Citation Format

Share Document