Article ID Journal Published Year Pages File Type
427874 Information Processing Letters 2010 5 Pages PDF
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.

Research highlights► Fault-tolerance of the distributed loop configuration is examined. ► Solutions are developed for tolerating any number of node failures. ► Formulation is applicable when the parameters that define the distributed loop are given numerically or symbolically.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,