Route selection and capacity assignment in computer communication networks based on genetic algorithm

The joint problem of selecting a route for each communicating node pair and a capacity value for each link in a computer communication network is considered. The network topology and traffic characteristics are given; a set of candidate routes and a set of candidate capacities for each link are also available. The goal is to obtain the least costly feasible design, where the costs include both capacity and queuing components. Genetic algorithms are used in order to obtain verifiable good solutions to the problem. The method has been tested on the ARPA, OCT, USA and ring topologies. Extensive computational results indicate that our method is very effective