The Research On QoS Multicast Routing Based On Genetic Simulatied Annealing Algorithm

With the development of Internet, the recent emergence of multimediacommunications and cooperative works in distributed environments provides anincentive to development of multicast communication. A fundamental issue inmulticast communication is how to determine an efficient multicast routing,namely, search simple, effective and robust multicast routing algorithms.Multicast routing algorithms are used to compute multicast trees that satisfy theneeds of QoS. The problem in search of multicast routing with many QoSconstraints is a NP-complete problem. Thus, most previous researchers havefocused on developing heuristic algorithms to solve this problem. However,these algorithms have high computation complexity so they are not fit inpracticality. Aiming at the limitation of genetic algorithm, the paper proposes anovel genetic simulated annealing algorithm which combine genetic algorithmwith simulated annealing algorithm. The genetic simulated annealing algorithmis used to solve the QoS multicast routing problem, and three typical respects ofresearch have been put forward.First of all, aiming at the limitation of genetic algorithm, the fitnessfunction is adjusted, and the optimized reserved strategy is used. The crossoverand mutation methods are improved, and simulated annealing algorithm iscombined with. Thus, an approach based on genetic simulated annealingalgorithm is proposed, which is used to solve delay constraint minimum-costmulticast routing problem.Secondly, a multicast routing algorithm based on delay and delay variationconstraint is proposed. In the algorithm, integral sequence encoding methodbased on the preparative paths set is adopted, and a heuristic crossover andmutation strategy is applied. The filial generation of genetic operation isoptimized by using simulated annealing algorithm, and convergence speed ismended.Finally, the paper studies the bandwidth, delay, delay jitter, and percentageof packet loss constraint minimum-cost multicast routing problem, defines anetwork model for researching the routing problem, and proposes a multi-constrained QoS multicast routing algorithm based on genetic simulatedannealing algorithm.The simulation results show that three multicast routing algorithms abovehave fast convergence speed and better performance. They can meet thecorresponding needs of QoS in multimedia communication networks.