Fault tolerant routing in star graph networks in the forbidden fault model

被引：0

作者：

Latifi, S ^{[1
]}

Rouskov, Y ^{[1
]}

Srimani, P ^{[1
]}

机构：

[1] Univ Nevada, Dept Elect Engn, Las Vegas, NV 89154 USA

来源：

INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS | 1997年

关键词：

star graph; fault tolerant routing; forbidden fault model; algorithm;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optima[ly fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults [1, 2]. Star graphs have also been investigated under the conditions of forbidden faulty sets [3] where all the neighbors of any node cannot be faulty simultaneously; we have shown [4] that under these conditions star graphs can tolerate up to (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. Our purpose in the present paper is to develop shortest routing algorithms between arbitrary pair of nodes under this restricted fault model.

引用

页码：1605 / 1613

页数：9

共 50 条

[11] Using fault avoidance for fault tolerant routing in interconnection networks
Samavi, S
Khadivi, P
PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON WIRELESS AND OPTICAL COMMUNICATIONS, 2001, : 123 - 127
[12] A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-star Graph
Chiu, Chiao-Wei
Yang, Chang-Biau
Huang, Kuo-Si
Tseng, Chiou-Ting
2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 2009, : 34 - 39
[13] Cluster fault-tolerant routing in star graphs
Gu, QP
Peng, ST
NETWORKS, 2000, 35 (01) : 83 - 90
[14] Fault-tolerant Routing on Borel Cayley Graph
Ryu, Junghun
Noel, Eric
Tang, K. Wendy
2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,
[15] Fault tolerant algorithms for broadcasting on the star graph network
Lo, NW
Carlson, BS
Tao, DL
IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (12) : 1357 - 1362
[16] Fault tolerant algorithms for broadcasting on the star graph network
Lo, NW
Carlson, BS
Tao, DL
PROCEEDINGS OF THE 39TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I-III, 1996, : 1289 - 1292
[17] FAULT-TOLERANT EXTENSIONS OF STAR NETWORKS
DAWSON, RJ
FARRAG, AA
NETWORKS, 1991, 21 (04) : 373 - 385
[18] Optimal algorithms of node-to-node fault tolerant routing in (n,k)-star graph
Lv, YL
Xiang, YH
Zhou, YH
PROCEEDINGS OF THE 11TH JOINT INTERNATIONAL COMPUTER CONFERENCE, 2005, : 47 - 50
[19] Fault-tolerant Routing based on Directed Safety Levels in a Hyper-Star Graph
Nishiyama, Yo
Hirai, Yuki
Kaneko, Keiichi
2012 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE APPLICATIONS AND TECHNOLOGIES (ACSAT), 2012, : 105 - 109
[20] A performance model of fault-tolerant routing algorithm in interconnect networks
Safaei, F.
Fathy, M.
Khonsari, A.
Ould-Khaoua, M.
COMPUTATIONAL SCIENCE - ICCS 2006, PT 1, PROCEEDINGS, 2006, 3991 : 744 - 752

← 1 2 3 4 5 →