Minimal fault diameter for highly resilient product networks

被引:24
作者
Day, K
Al-Ayyoub, AE
机构
[1] Sultan Qaboos Univ, Dept Comp Sci, Muscat, Oman
[2] Jordan Univ Sci & Technol, Dept Comp Sci & Informat Syst, Irbid 22110, Jordan
关键词
fault diameter; fault tolerance; interconnection networks; node-disjoint paths; product networks;
D O I
10.1109/71.879775
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a number of results related to the fault tolerance of Cartesian product networks. We start by presenting a method for building containers (i.e., sets of node-disjoint paths) between any two nodes of a product network based on given containers for the factor networks. Then, we show that the best achievable fault diameter (i.e., diameter under maximum fault conditions), under reasonable network regularity and connectivity conditions, is equal to the fault-free diameter plus one. The concept of high fault resilience is then defined. We then prove that if each factor network is highly resilient, then their Cartesian product has minimal fault diameter. We derive from these results that Cartesian products of several popular networks are highly resilient and have minimal fault diameter equal to diameter plus one. These results spare future efforts that would be needed to individually determine the fault diameter of such networks as has been the practice with previously studied networks.
引用
收藏
页码:926 / 930
页数:5
相关论文
共 19 条
[1]  
BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437
[2]   LEE DISTANCE AND TOPOLOGICAL PROPERTIES OF K-ARY N-CUBES [J].
BOSE, B ;
BROEG, B ;
KWON, Y ;
ASHIR, Y .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (08) :1021-1030
[3]  
DAS SK, 1992, P 4 S FRONT MASS PAR, P270
[4]   Fault diameter of k-ary n-cube networks [J].
Day, K ;
AlAyyoub, AE .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (09) :903-907
[5]   The cross product of interconnection networks [J].
Day, K ;
AlAyyoub, AE .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (02) :109-118
[6]   A COMPARATIVE-STUDY OF TOPOLOGICAL PROPERTIES OF HYPERCUBES AND STAR GRAPHS [J].
DAY, K ;
TRIPATHI, A .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (01) :31-38
[7]   Mesh-connected trees: A bridge between grids and meshes of trees [J].
Efe, K ;
Fernandez, A .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (12) :1281-1291
[8]   PRODUCTS OF NETWORKS WITH LOGARITHMIC DIAMETER AND FIXED DEGREE [J].
EFE, K ;
FERNANDEZ, A .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (09) :963-975
[9]   A GENERAL FRAMEWORK FOR DEVELOPING ADAPTIVE FAULT-TOLERANT ROUTING ALGORITHMS [J].
ELGHAZAWI, T ;
YOUSSEF, A .
IEEE TRANSACTIONS ON RELIABILITY, 1993, 42 (02) :250-258
[10]   GENERALIZED MEASURES OF FAULT TOLERANCE WITH APPLICATION TO N-CUBE NETWORKS [J].
ESFAHANIAN, AH .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) :1586-1591