QoS Multicast Routing Optimization Based On Improved Discrete Firefly Algorithm

In recent years,the rapid development of the network,the 5G era has clearly arrived,in the era of 5G,artificial intelligence,Internet of Things,big data,etc.will be widely used,in order to ensure the normal operation of key services,network transmission capabilities are particularly important.Multicast communication is widely used in these applications.Therefore,it is meaningful to study the multicast routing optimization problem that satisfies QoS constraints such as delay,packet loss rate and bandwidth.This paper expounds new insights by analyzing the characteristics of QoS multicast communication and the current research on multicast routing optimization.Since the research on firefly algorithm is still in its infancy,especially in solving the problem of discrete target optimization problem,this paper first proposes an ODFA algorithm for TSP problem,and then expands the problem to the constrained multicast routing problem.The BRDFA algorithm proves that the two algorithms proposed in this paper are effective.The main research contents and related work of this paper can be summarized as follows:1.The basic firefly algorithm is only suitable for the optimization of continuous problems,and the multicast routing optimization problem belongs to the NP-Complete problem,which is a discrete target optimization problem,the basic firefly algorithm.Not applicable to solve such problems.TSP has been proved to have NP-C computational complexity and is used as the benchmark for discrete target optimization problems.Therefore,this paper firstly solves the TSP problem and proposes a discrete firefly algorithm based on OX operation(ODFA)to solve the TSP problem.The balance between optimization and diversification is achieved by utilizing the local search programs C2-Opt and 3-Opt to improve search performance and accelerate convergence.In addition,dynamic variability factors are introduced to prevent local optimism.Experiments are carried out using the examples in the TSPLIB library.The verification analysis proves that the ODFA algorithm is feasible and effective,which provides a basis for studying QoS multicast routing problems later.2.Based on the solution of TSP problem,this paper proposes a discrete firefly algorithm based on BR strategy(BRDFA)to solve the problem of QoS multicast routing.Aiming at the problem that tree coding and decoding is difficult in QoS multicast routing problem,BRDFA algorithm proposes a firefly coding method for the predecessor node.At the same time,the penalty function and tree repair strategy are used to deal with the constraint conditions,which is inefficient and infeasible.For the problem of solution,this paper uses the BR strategy to ensure that the searched multicast trees satisfy the QoS constraints and accelerate the convergence of optimization.In addition,in order to prevent falling into local optimum and increase population diversity,a firefly disturbance mechanism was introduced.The simulation experiment proves that BRDFA has good feasibility and adaptability,and provides a new idea to solve the problem of QoS multicast routing optimization.