Optimizing the CMTS to Improve Quality of Service in Next Generation Networks Based on ACO Algorithm
In this paper, the authors focus on the network topological design for providing Quality of Service (QoS) in Next Generation Network (NGN) and propose an effective Ant Colony Optimization (ACO) algorithm to solve the Capacitated Minimum Spanning Tree (cMTS) problem in dynamic environment. To improve QoS of communication network with considering the network provisioning capability and dynamic environment, they formulate this problem with minimizing the communication cost (as a kind of performance measures for network's QoS). Their objective functions are determined by pheromone matrix of ants satisfies capacity constraints to find good approximate solutions of cMST problems. Numerical experiments show that their algorithm have achieved much better than recent researches.