A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the fault-diameter of the star graph
Information Processing Letters
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
IEEE Transactions on Computers
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
A broadcasting algorithm in star graph interconnection networks
Information Processing Letters
Information Processing Letters
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A Parallel Algorithm for Computing Fourier Transforms on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
Substar Reliability Analysis in Star Networks
Information Sciences: an International Journal
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
Fault tolerant routing in star graphs using fault vector
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Adaptive fault tolerant routing in star graph
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in the network. A distributed faulttolerant routing algorithm for the star network based on this construction method is then presented and evaluated. The proposed algorithm adapts the routing decisions in response to node failures. Node failure and repair conditions may arise dynamically (at any time) provided that the total number of faulty nodes at any given time is less than the nodeconnectivity n-1 of the n-star. We show that if the node failures occur 'reasonably' apart in time, then all messages will be routed on paths of length 驴 + 驴 where 驴 is the minimum distance between the source and the destination and e is 0, 2, or 4. In the unlikely case where more failures occur in a 'short period', the algorithm still delivers all messages but via possibly longer paths.