Fault tolerant routing in stargraph networks

被引：0

作者：

Zhu, H ^{[1
]}

Peng, C ^{[1
]}

机构：

[1] Fudan Univ, Dept Comp Sci, Shanghai 200433, Peoples R China

来源：

PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS | 2001年

关键词：

fault tolerance; stargraph network; routing; connectivity;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

We propose an approach to solve the routing problem in stargraph networks with a very large number (i.e., up to a constant fraction) of faulty nodes. To keep the network from disconnected, simple and natural conditions are identified based on localized management. After analyzing the properties of the stargraph, we developed 2 efficient routing algorithms on stargraph networks satisfying these conditions.

引用

页码：2003 / 2007

页数：3

共 7 条

[1]

Akers S. B., 1987, Proceedings of the 1987 International Conference on Parallel Processing, P393

[2]

CHEN JE, 2000, ICA 3 PP, P605

[3] 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

[4] An efficient algorithm for k-pairwise disjoint paths in star graphs [J].

Gu, QP ;

Peng, ST .

INFORMATION PROCESSING LETTERS, 1998, 67 (06) :283-287

[5]

KNUTH DE, 1972, ART COMPUTER PROGRAM, V2

[6] ON THE FAULT-DIAMETER OF THE STAR GRAPH [J].

LATIFI, S .

INFORMATION PROCESSING LETTERS, 1993, 46 (03) :143-150

[7]

QIU K, 1992, 92341 QUEENS U DEP C

← 1 →