An efficient algorithm for designing optimal backbone topology for a communication networks

In this paper, we present an algorithm to design an optimal backbone network topology, which incorporates some real life constraints of reliability. A network topology is a 1-FT topology if it can survive a single link failure. The problem a designer of a network faces is how to find a reliable network topology for a set of nodes with reduced total link cost. The problem is known to be NP-hard i.e. there exists no polynomial time algorithms to solve this problem. Thus, the problem can be formulated as combinatorial optimization problem. Our algorithm, a variant of enumerative technique, tries to find out a 1-FT network topology with optimal total link cost when runs to its termination. The time complexity of our algorithm is O(N⁴). We have tested our algorithm for a wide range of data set and compared the outcome with the existing approach based on genetic algorithm (GA) and found that our algorithm outperforms the GA based approach in producing quality solution. This electronic document is a "live" template. The various components of your paper [title, text, heads, etc.] are already defined on the style sheet, as illustrated by the portions given in this document.