Designing fault-tolerant systems using automorphisms
Journal of Parallel and Distributed Computing
Analyzing the fault tolerance of double-loop networks
IEEE/ACM Transactions on Networking (TON)
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
Multiple-Edge-Fault Tolerance with Respect to Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Optimal 1-edge fault-tolerant designs for ladders
Information Processing Letters
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Algorithm for constructing fault-tolerant solutions of the circulant graph configuration
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
The Basic Fault-tolerant System
IEEE Micro
Reliable Loop Topologies for Large Local Computer Networks
IEEE Transactions on Computers
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Proceedings of the 2008 Spring simulation multiconference
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
Computers & Mathematics with Applications
Developing fault-tolerant distributed loops
Information Processing Letters
Extending a distributed loop network to tolerate node failures
Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
| Hi-index | 0.00 |
We study the problem of extending a circulant digraph network by adding spare nodes and extra links to make it fault-tolerant. The optimization criterion used is to reduce the node-degree of the overall network. Our formulation can tolerate any desired number of node failures; and moreover, it can be applied to networks whose edges are directed or undirected. Our results show the solutions obtained are efficient.