An Improved Genetic Algorithm for Cost-Delay-Jitter QoS Multicast Routing

In this paper, an improved genetic algorithm is presented to solve the multicast routing problem, which is known as NP-complete problem. The contribution of this work includes: (1) the adaptive niche technique and new migration rules are designed to improve the performance of genetic algorithm. (2) In order to fulfil the adaptability of the basic operators of genetic algorithm, the artificial immune system is involved to dynamically control the crossover operator and the mutation operator. (3) A tree encoding based on the theory of generating the spanning tree is proposed to map the solution space of the multicast tree of QoS multicast routing problem, which basic definitions and axioms of the topology are described especially the character of spanning tree and the nature of the cut edge and cut set of a tree. Experiment result shows that this improved genetic algorithm has higher accuracy and performance than traditional methods

[1]  Marcin Kolodziej,et al.  Parallel Genetic Algorithm for Graph Coloring Problem , 2004, International Conference on Computational Science.

[2]  Y. Donoso,et al.  Multitree Routing for Multicast Flows : A Genetic Algorithm Approach , 2004 .

[3]  Wang Xingwei.  Intelligent QoS Multicast Routing Algorithms in Next Generation Internet , 2004 .

[4]  Wojciech Bozejko,et al.  Parallel Genetic Algorithm for the Flow Shop Scheduling Problem , 2003, PPAM.

[5]  Hidefumi Sawai,et al.  Parallel distributed processing of a parameter-free GA by using hierarchical migration methods , 1999 .

[6]  Wen Xian Yang,et al.  An improved genetic algorithm adopting immigration operator , 2004, Intell. Data Anal..

[7]  Gong Dunwei,et al.  Adaptive niche hierarchy genetic algorithm , 2002, 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings..

[8]  Larry D. Wittie,et al.  Multicast Communication on Network Computers , 1985, IEEE Software.

[9]  Richard J. Harris,et al.  Solving QoS multicast routing with genetic algorithms , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.

[10]  Mario Gerla,et al.  Constructing shared-tree for group multicast with QoS constraints , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[11]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[12]  Lixia Zhang,et al.  Adaptive shared tree multicast in mobile wireless networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[13]  M. R. Rao,et al.  The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

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

[15]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[16]  Douglas S. Reeves,et al.  Multicast routing for real-time communication of high-speed networks , 1996 .