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
Fault-tolerant circulant digraphs networks
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.00 |
We examine the problem of extending a distributed loop network by adding spare nodes and links so as to make it more fault-tolerant. The optimization criterion used in finding a fault-tolerant solution is to reduce the node-degree of the overall network. This is important in practice due to the limitation on the number of links allowed per node in VLSI design. Our results indicate that the solutions obtained (numerically or analytically) are efficient, i.e., either optimal or nearly-optimal.