An efficient adaptive routing algorithm for the faulty star graph

被引：2

作者：

Bai, LQ ^{[1
]}

Maeda, H ^{[1
]}

Ebara, H ^{[1
]}

Nakano, H ^{[1
]}

机构：

[1] Osaka Univ, Dept Commun, Suita, Osaka 565, Japan

来源：

1997 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS | 1997年

关键词：

D O I：

10.1109/ICPADS.1997.652533

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper introduces an adaptive distributed routing algorithm for the faulty star graph. By giving two routing Pules based on the properties of nodes, an optimal routing function for the fault-free star graph is presented. For a given destination in the n-star graph, n - 1 node-disjoint and edge-disjoint subgraphs, which are derived from n - 1 adjacent edges Elf the destination, can be constructed by applying this routing function and the concept of Breadth First Search. When faults are encountered, the algorithm can route messages to the destination by finding a fault-free subgraphs based on the local failure information. As long as the number f of faults (node faults and/or edge faults) is less than the degree n - 1 of the n-star graph, the algorithm can adaptively find a path of length at most d + 4f to route messages successfully from a source to a destination, where d is the distance between two nodes.

引用

页码：82 / 87

页数：6