Conditional fault diameter of star graph networks

被引:52
作者
Rouskov, Y [1 ]
Latifi, S [1 ]
Srimani, PK [1 ]
机构
[1] UNIV NEVADA,DEPT ELECT ENGN,LAS VEGAS,NV 89154
关键词
D O I
10.1006/jpdc.1996.0028
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optimally fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults. We investigate star graphs under the conditions of forbidden faulty sets, where all the neighbors of any node cannot be faulty simultaneously; we show that under these conditions star graphs can tolerate upto (2n - 5) faulty nodes and the fault diameter is increased only by 2 in the worst case in presence of maximum number of faults. Thus, star graphs enjoy the similar property of strong resilience under forbidden faulty sets like the n-cubes. We have developed algorithms to trace the vertex disjoint paths under different conditions. (C) 1996 Academic Press, Inc.
引用
收藏
页码:91 / 97
页数:7
相关论文
共 17 条
[1]  
Akers S. B., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P393
[2]   A GROUP-THEORETIC MODEL FOR SYMMETRIC INTERCONNECTION NETWORKS [J].
AKERS, SB ;
KRISHNAMURTHY, B .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (04) :555-566
[3]  
[Anonymous], 2001, GRAPH THEORY
[4]   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
[5]   GENERALIZED MEASURES OF FAULT TOLERANCE WITH APPLICATION TO N-CUBE NETWORKS [J].
ESFAHANIAN, AH .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) :1586-1591
[6]  
FRAGOPOULOU P, 1991, P INT C PARALLEL PRO, V3, P100
[7]   COMBINATORIAL ANALYSIS OF THE FAULT-DIAMETER OF THE N-CUBE [J].
LATIFI, S .
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (01) :27-33
[8]   ON THE FAULT-DIAMETER OF THE STAR GRAPH [J].
LATIFI, S .
INFORMATION PROCESSING LETTERS, 1993, 46 (03) :143-150
[9]   CONDITIONAL CONNECTIVITY MEASURES FOR LARGE MULTIPROCESSOR SYSTEMS [J].
LATIFI, S ;
HEGDE, M ;
NARAGHIPOUR, M .
IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (02) :218-222
[10]   OPTIMAL BROADCASTING ON THE STAR GRAPH [J].
MENDIA, VE ;
SARKAR, D .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1992, 3 (04) :389-396