Conditional Fault Diameter of Star Graph Networks

1996 ◽  
Vol 33 (1) ◽  
pp. 91-97 ◽  
Author(s):  
Yordan Rouskov ◽  
Shahram Latifi ◽  
Pradip K. Srimani
2017 ◽  
Vol 12 (5) ◽  
pp. 1221-1234 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang ◽  
Weiping Han

Author(s):  
Abderezak Touzene ◽  
Khaled Day

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.  


1998 ◽  
Vol 24 (8) ◽  
pp. 1263-1276 ◽  
Author(s):  
Shahram Latifi ◽  
Pradip K. Srimani

2016 ◽  
Vol 59 (12) ◽  
pp. 1839-1856 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang

2002 ◽  
Vol 51 (1) ◽  
pp. 49-57 ◽  
Author(s):  
K. Fitzgerald ◽  
S. Latifi ◽  
P.K. Srimani

Sign in / Sign up

Export Citation Format

Share Document