Optimizing the CMTS to Improve Quality of Service in Next Generation Networks based on ACO Algorithm

In this paper, we 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, we formulate this problem with minimizing the communication cost (as a kind of performance measures for network’s QoS). Our objective functions are determined by pheromone matrix of ants satisfies capacity constraints to find good approximate solutions of cMST problems. Numerical experiments show that our algorithm have achieved much better than recent researches. Index Terms — Capacitated Minimum Spanning Tree (cMTS), Communication Network, Quality of Service (QoS), Next Generation Network, Ant Colony Optimization

[1]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Bryant A. Julstrom,et al.  A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem , 2000, SAC '00.

[4]  Mitsuo Gen,et al.  Matrix-based Genetic Algorithm Approach on Bicriteria Minimum Spanning Tree Problem with Interval Coefficients , 1998 .

[5]  Günther R. Raidl,et al.  A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem , 2002 .

[6]  Dac-Nhuong Le,et al.  A Novel Ant Colony Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem , 2013 .

[7]  Mitsuo Gen,et al.  Node-Based Genetic Algorithm for Communication Spanning Tree Problem , 2006, IEICE Trans. Commun..

[8]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[9]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[10]  T. C. Hu Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[11]  A. Cayley A theorem on trees , 2009 .

[12]  Bryant A. Julstrom,et al.  Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..

[13]  Mitsuo Gen,et al.  Genetic algorithm approach on multi-criteria minimum spanning tree problem , 1999, Eur. J. Oper. Res..

[14]  Chao-Hsien Chu,et al.  Genetic algorithms for communications network design - an empirical study of the factors that influence performance , 2001, IEEE Trans. Evol. Comput..

[15]  Francis Suraweera,et al.  Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem , 1994, Evo Workshops.

[16]  Lawrence Davis,et al.  A Genetic Algorithm for Survivable Network Design , 1993, International Conference on Genetic Algorithms.

[17]  David W. Corne,et al.  A new evolutionary approach to the degree-constrained minimum spanning tree problem , 1999, IEEE Trans. Evol. Comput..