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

• Published in: 2003 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Vol. 2; pp. 736 - 739 vol.2
• Main Authors: El-Barr, M.A., Zakir, A., Sait, S.M., Almulhem, A.
• Format: Conference Proceeding
• Language: English; Japanese
• Published: IEEE 2003
• Subjects: Algorithm design and analysis; Computer network reliability; Constraint optimization; Cost function; Design optimization; Educational institutions; Fault tolerance; Genetic algorithms; Genetic mutations; Simulated annealing
• ISBN: 0780379780; 9780780379787
• DOI: 10.1109/PACRIM.2003.1235886

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.