Multiple constraints QoS multicast routing optimization algorithm based on Genetic Tabu Search Algorithm

With the fast evolution of real time and multimedia applications, some quality of service (QoS) constraints need to be guaranteed in the underlying network. In this paper, we present a new method for least-cost QoS multicast routing problem based on genetic algorithm and tabu search. This problem has been proven to be NP-complete. The proposed genetic tabu search algorithm (GTS) combine Genetic Algorithm and Tabu Search adequately in order to improve the computing performance. In our method the chromosomes of the multicast tree represented by tree structure coding scheme. This coding scheme simplifies the coding operation and omits the coding and decoding process. A new population initialization method based on Prim`s algorithm is proposed. This method ensures that every chromosome is a reasonable multicast tree without loops. The proposed algorithm is then compared with one of existing multicasting algorithms. The simulation results show that our method has high speed of convergence and effective in solving the considered problem.

[1]  Sadiq M. Sait,et al.  QoS-driven multicast tree generation using Tabu search , 2002, Comput. Commun..

[2]  Liu Ying.  A Delay-Constrained Multicast Routing Algorithm Based on Heuristic Genetic Algorithm , 2003 .

[3]  Zhang Kun,et al.  Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing , 2005 .

[4]  Khalid Al-Begain,et al.  An Overview of Quality of Service (QoS) and QoS Routing in Communication Networks , 2003 .

[5]  Chen Changjia,et al.  A genetic algorithm for multicasting routing problem , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[6]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[7]  M.E. El-Hawary,et al.  Multicast routing with delay and delay variation constraints using genetic algorithm , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[8]  Sun,et al.  Multicast Routing Optimization Algorithm with Bandwidth and Delay Constraints Based on GA , 2005 .

[9]  Mohamed F. Mokbel,et al.  AN EFFICIENT ALGORITHM FOR SHORTEST PATH MULTICAST ROUTING UNDER DELAY AND DELAY VARIATION CONSTRAINTS , 2001 .

[10]  Taieb Znati,et al.  Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks , 2001, J. Parallel Distributed Comput..

[11]  Heng Wang,et al.  Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing , 2005, Comput. Commun..

[12]  Heng Wang,et al.  TSDLMRA: an efficient multicast routing algorithm based on Tabu search , 2004, J. Netw. Comput. Appl..

[13]  Chang Wook Ahn,et al.  A Genetic-Inspired Multicast Routing Optimization Algorithm with Bandwidth and End-to-End Delay Constraints , 2006, ICONIP.

[14]  Guiyang Liu,et al.  Algorithm of QoS multicast routing based on genetic simulated annealing algorithm , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[15]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..