Artificial intelligence search techniques for discrete link capacity assignment in prioritized multiserve networks

In this paper, the discrete link capacity assignment problem for multiservi ce networks is considered. The discreteness of the link capacities is force d by the telecommunications equipment technology and vendors. Here, the des igner is required to find the cheapest capacity assignment while satisfying the performance constraints for different classes of data originated by mu ltiple services offered on the network, In order to solve this difficult op timization problem, two algorithms based on artificial intelligence search techniques, simulated annealing and genetic algorithms, are proposed. Perfo rmance of these methods are compared to a successful heuristic by Maruyama and Tang. The distinction between competing techniques becomes clearer as t he network gets larger.