On the fault-tolerant metric dimension of certain interconnection networks

2018 ◽  
Vol 60 (1-2) ◽  
pp. 517-535 ◽  
Author(s):  
Hassan Raza ◽  
Sakander Hayat ◽  
Xiang-Feng Pan
IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 145435-145445
Author(s):  
Sakander Hayat ◽  
Asad Khan ◽  
Muhammad Yasir Hayat Malik ◽  
Muhammad Imran ◽  
Muhammad Kamran Siddiqui

1998 ◽  
Vol 09 (01) ◽  
pp. 25-37 ◽  
Author(s):  
THOMAS J. CORTINA ◽  
ZHIWEI XU

We present a family of interconnection networks named the Cube-Of-Rings (COR) networks along with their basic graph-theoretic properties. Aspects of group graph theory are used to show the COR networks are symmetric and optimally fault tolerant. We present a closed-form expression of the diameter and optimal one-to-one routing algorithm for any member of the COR family. We also discuss the suitability of the COR networks as the interconnection network of scalable parallel computers.


2005 ◽  
Vol 06 (04) ◽  
pp. 361-382 ◽  
Author(s):  
K. V. Arya ◽  
R. K. Ghosh

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.


Sign in / Sign up

Export Citation Format

Share Document