The proliferation of Internet access and the appearance of new telecommunications services are originating a demand for resilient networks with extremely high capacity. Thus, topologies able to recover connections in case of failure are essential. Given the node location and the traffic matrix, the survivable topological design is the problem of determining the network topology at minimum capital expenditure such that survivability is ensured. This problem is strongly NP-hard and heuristics are traditionally used to search near-optimal solutions. The authors present a genetic algorithm for this problem. As the convergence of the genetic algorithm depends on the used operators, an analysis of their impact on the quality of the obtained solutions is presented as well. Two initial population generators, two selection methods, two crossover operators, and two population sizes are compared, and the quality of the obtained solutions is assessed using an integer linear programming model.
Introduction to the Minitrack on Resilient Networks
