Multiconstrained Routing Based On Particle Swarm Optimization And Fireworks Algorithm

With the advent of the information age,people have increasingly higher needs for Quality of Service.As one of the most important links in network transmission,Qo S routing has a decisive effect on network communication performance.Qo S routing is a multiconstrained routing problem.Its purpose is to carry out an algorithm that satisfies all the given constraints and searches for an optimal path given any number of constraints.To achieve this goal,we need to fulfill a general and efficient multiconstrained Qo S routing algorithm.Based on the existing algorithms,this thesis presents two multiconstrained Qo S routing algorithms based on swarm intelligence algorithm: PSO?FWA and PSPSO?FWA.The multiconstrained Qo S routing algorithm based on Particle Swarm Optimization selects local optimal solution or miss global optimal solution.To solve this problem,this thesis proposes a new multiconstrained Qo S routing algorithm PSO?FWA algorithm.The core idea of PSO?FWA algorithm is:(1)Construct a mathematical model of multiconstrained Qo S routing.The normalized weight processing method is used for construction.(2)Search strategy.It uses the PSO algorithm to perform a global search for a given network topology.When the particles of the PSO algorithm have a better position,the fireworks Algorithm(FWA)is used for local search at this position.Then the results of local search and global search are updated to gbest at the same time,so the algorithm can quickly converge.Through many simulation experiments,the PSO?FWA algorithm is simulated and verified.The experimental results show the PSO?FWA algorithm can quickly search for paths that meet the given constraints.Besides,it has a higher success rate and better scalability,which can support multiconstrained routing search under large-scale nodes.Therefore,for solving the multiconstrained Qo S routing problem,the PSO?FWA algorithm is a efficient and practical routing algorithm.The PSO?FWA algorithm has a high success rate and scalability when searching for a given link.But the algorithm also has some problems,such as high time complexity and slow local search.To solve these problems,this thesis presents a new multiconstrained Qo S routing algorithm PSPSO?FWA algorithm based on the PSO?FWA algorithm.The core idea of PSPSO?FWA algorithm is:(1)Pruning.Pruning is to delete the path that does not meet the given constraints from the original network topology map to get a new network topology map.(2)Search strategy.It uses the PSO algorithm to search the network topology graph after pruning,and randomly select some pbest and gbest to form a set.Then it uses the FWA algorithm to perform a local search on this set.Simulation shows the algorithm can quickly perform a global search.At the same time,it can quickly and more finely search the local.This algorithm has a fast convergence speed,optimization ability and scalability.