Reliability and Fault Tolerance based Topological Optimization of Computer Networks - Part II: Iterative Techniques

Abstract-Topological optimization of computer networks is concerned with the selection of a subset of the available links such that the reliability and fault-tolerance aspects are maxhized while meeting a cost constraint. In this case. the problem is stated as opthiring the reliability and fault-tolerance of a network subject to a maximum cost constraint. Existing iterative-based techniques consider the simple single-objective version of the problem by considering reliability as the only objective We consider fault-tolerance to be an important network design "ped We consider the use of three iterative techniques, namely Tabu Search, Simulated Anenling, and Genetic Algorithm, in solving the multi-objective topological optimization network design problem. Experimental results for a set of 10 randomly generated networks using the three iterative techniques are presented and compared. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable in- m the overall cost of the network. Keywords: Topological Optimization, Fault Tolerance, Reliability, Genetic Algorithm, Tabu Search, Simulated Annealing, Spanning tree

Reliability and fault tolerance based topological optimization of computer networks - part II: iterative techniques

Topological optimization of computer networks is concerned with the selection of a subset of the available links such that the reliability and fault-tolerance aspects are maximized while meeting a cost constraint. In this case, the problem is stated as optimizing the reliability and fault-tolerance of a network subject to a maximum cost constraint. Existing iterative-based techniques consider the simple single-objective version of the problem by considering reliability as the only objective. We consider fault-tolerance to be an important network design aspect. We consider the use of three iterative techniques, namely tabu search, simulated annealing, and genetic algorithms, in solving the multiobjective topological optimization network design problem. Experimental results for a set of 10 randomly generated networks using the three iterative techniques are presented and compared. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable increase in the overall cost of the network

Reliability based Topological Optimization of Computer Networks - Part II: Iterative Techniques

Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumerative and iterative based techniques were proposed to solve this problem. In this paper (Part II), we present and compare the different proposed iterative techniques for optimizing different aspects (reliability, fault tolerance, and cost) of the designed networks

Reliability based Topological Optimization of Computer Networks - Part II: Iterative Techniques

Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumerative and iterative based techniques were proposed to solve this problem. In this paper (Part II), we present and compare the different proposed iterative techniques for optimizing different aspects (reliability, fault tolerance, and cost) of the designed networks

Reliability and fault tolerance based topological optimization of computer networks - part I: enumerative techniques

Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumeration-based techniques were proposed to solve this problem. They are based on enumerating all possible paths (for terminal reliability) and all the spanning trees (for network reliability). Existing enumeration-based techniques for solving this network optimization problem ignore the fault-tolerance aspect in their solution. We consider fault tolerance to be an important network design aspect In this paper, we propose one algorithm for optimizing the terminal reliability and another for optimizing the network reliability while improving the fault tolerance aspects of the designed networks. Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using existing techniques. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable increase in the overall cost of the network

The Use of Enumerative Techniques in Topological Optimization of Computer Networks Subject to Fault Tolerance and Reliability

Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumeration-based techniques were proposed to solve this problem. They are based on enumerating all the possible paths (for Terminal reliability) and all the spanning trees (for ��Network reliability). Existing enumeration-based techniques for solving this network optimization problem ignore the fault-tolerance aspect in their solution. Fault tolerance is an important network design aspect. A fault tolerant network is able to function even in the presence of some faults in the network. In this paper, we propose one algorithm for optimizing the terminal reliability and another for optimizing the network reliability while improving the fault tolerance aspects of the designed networks. Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using the existing techniques [1], [2]. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable increase in the overall cost of the network while remaining within a maximum pre-specified cost constraint

The Use of Enumerative Techniques in Topological Optimization of Computer Networks Subject to Fault Tolerance and Reliability

Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumeration-based techniques were proposed to solve this problem. They are based on enumerating all the possible paths (for Terminal reliability) and all the spanning trees (for ��Network reliability). Existing enumeration-based techniques for solving this network optimization problem ignore the fault-tolerance aspect in their solution. Fault tolerance is an important network design aspect. A fault tolerant network is able to function even in the presence of some faults in the network. In this paper, we propose one algorithm for optimizing the terminal reliability and another for optimizing the network reliability while improving the fault tolerance aspects of the designed networks. Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using the existing techniques [1], [2]. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable increase in the overall cost of the network while remaining within a maximum pre-specified cost constraint

The Use of Enumerative Techniques in Topological Optimization of Computer Networks Subject to Fault Tolerance and Reliability

Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumeration-based techniques were proposed to solve this problem. They are based on enumerating all the possible paths (for Terminal reliability) and all the spanning trees (for ��Network reliability). Existing enumeration-based techniques for solving this network optimization problem ignore the fault-tolerance aspect in their solution. Fault tolerance is an important network design aspect. A fault tolerant network is able to function even in the presence of some faults in the network. In this paper, we propose one algorithm for optimizing the terminal reliability and another for optimizing the network reliability while improving the fault tolerance aspects of the designed networks. Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using the existing techniques [1], [2]. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable increase in the overall cost of the network while remaining within a maximum pre-specified cost constraint

Quantifying fault recovery in multiprocessor systems

Various aspects of reliable computing are formalized and quantified with emphasis on efficient fault recovery. The mathematical model which proves to be most appropriate is provided by the theory of graphs. New measures for fault recovery are developed and the value of elements of the fault recovery vector are observed to depend not only on the computation graph H and the architecture graph G, but also on the specific location of a fault. In the examples, a hypercube is chosen as a representative of parallel computer architecture, and a pipeline as a typical configuration for program execution. Dependability qualities of such a system is defined with or without a fault. These qualities are determined by the resiliency triple defined by three parameters: multiplicity, robustness, and configurability. Parameters for measuring the recovery effectiveness are also introduced in terms of distance, time, and the number of new, used, and moved nodes and edges