Developing fault-tolerant distributed loops

Authors:
A. A. Farrag
Affiliations:
Faculty of Computer Science, Dalhousie University, Halifax, N.S., Canada, B3H 3J5
Venue:
Information Processing Letters
Year:
2010

Citing 12
Cited 3

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
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
The Fault-Tolerant Extension Problem for Complete Multipartite Networks

IEEE Transactions on Parallel and Distributed Systems
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
Introduction to the Configurable, Highly Parallel Computer

Computer
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

Extending a distributed loop network to tolerate node failures

Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks

Theoretical Computer Science
Fault-tolerant circulant digraphs networks

Proceedings of the 2013 Research in Adaptive and Convergent Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

Distributed loops are highly regular structures that have been applied to the design of many locally distributed systems. This family of networks includes many important configurations such as rings and circulant graphs, for examples. In this paper, we examine the problem of extending a distributed loop so as to tolerate any number of node failures. We study this problem when the parameters that define the loop are given numerically as constants, or symbolically as variables. Our results indicate that the (fault-tolerant) solutions obtained are efficient.