Multi-constrained Routing Algorithm Based on PSPSO_FWA in DAG

Abstract

This paper analyzes the existing multiconstrained QoS routing methods, builds a mathematical model that satisfies multiconstrained QoS routing, and converts multiple constraints into a fitness function through a penalty function. On this basis, a new multiconstrained routing algorithm PSPSO_FWA in DAG is proposed. The algorithm first prunes the network topology map, deletes the path that does not satisfy the multiple constraints, and reduces the search space. Then use particle swarm optimization (PSO) to search, to solve the problem of falling into local optimum and speed up local search, the fireworks algorithm (FWA) is introduced for optimization. The simulation shows the success rate of PSPSO_FWA algorithm is increased by 2.47% compared with the current PSO algorithm, and the problem is about 1.95% higher than the PSO_ACO algorithm. The average cost of the last search is about 2.27% higher than that of the PSO algorithm, which is about 1.46% higher than the PSO_ACO algorithm.