Applicability of Bio-inspired and Graph-Theoretic Algorithms for the Design of Complex Fault-Tolerant Graphs

Fault-tolerant networks are needed for many applications, such as telecommunication networks, electricity networks, traffic, routing, and others. Several methods for constructing fault-tolerant networks out of a given set of nodes exists, among them classical graph-theoretic ones, and recently also several bio-inspired algorithms have been proposed for such application. In this paper we study the performance of these different algorithms for that problem. Performance means that both the complexity of the algorithm for a given problem size and the quality of the generated networks are taken into account. We conclude that classical algorithms that belong to a certain complexity class are efficient for small to medium size problems, while at some point, for larger problems, bio-inspired solutions are more efficient to get a solution.