Research Of Tasking-oriented Path Planning Method For Optical Networks

In military operations,communication support staffs need to rationally plan communication paths according to mission requirements.Due to the uneven distribution of optical network resources,the scientific allocation of network resources has always been a difficult problem.Path planning is the key technology to solve this problem.At present,path planning relies mainly on manpower,but this way is difficult to plan the optimal path to meet the needs of tasks.The development of Software Defined Network(SDN)points out the development direction of optical network path planning.Based on the idea of SDN resource unified arrangement and aim to military mission communication requirements,this paper studies task-oriented path planning.The main research work and innovation are as follows:Firstly,the structure and communication characteristics of the military optical network are studied.Optical network path planning model with multiple constraints is constructed based on Dijkstra algorithm with the constraints of three tasks: the lowest transmission delay,the dominator and the lowest transmission risk.Second,a optimal path algorithm constrained by nodes is proposed for constrained nodes.The algorithm approach global optimal path by piecewise solving local optimal.The simulation results show that the algorithm can obtain the global optimal solution with low complexity.Third,aiming at the minimum risk of transmission risk,A dynamic path algorithm for optical networks based on transmission risk constraints is proposed.By Mining and analysis optical network alerts big data,alarm risk is quantified,the warning area is located.Entropy weight method is used to calculate the risk weight of each node and link,and Dijkstra algorithm is used to solve the optimal path finally.The simulation results show that the algorithm can effectively perceive the risk change of the optical network and give the optimal path according to the real-time operation of the optical network.Finally,The optimal path planning under multiple constraints is realized by combining the single constraint path planning algorithms.The performance of the algorithm is tested and the factors affecting its performance are further studied.