Routing And Optimization Of Optical Network With Necessary Points Based On Heuristic Algorithm

With the rapid growth of Internet protocol(IP)services,network broadcast,short video and meta-universe services bring huge demand for network traffic,and because of the uncertainty and unpredictability of IP business itself,the dynamic allocation of network bandwidth requirements are becoming more and more urgent.Optical networks have also adapted to the development of The Times,from the original relying on manual configuration of network connections,to today’s intelligent optical networks that allow the dynamic allocation of network resources to routes.The continuous development of network model will also bring about great changes in network structure.This makes the planning and optimization of optical networks become a key area of scientific research.The research content of this paper is mainly aimed at the routing optimization problem in optical network optimization and the routing problem of optical network with necessary nodes which is common in optical network planning.The main research work of this paper is as follows:First of all,for routing optimization,I found that most of the research on network resource allocation still focused on static network structure and state information,or only considered simple network state factors,which failed to provide complete topology information.To solve the above problems,this paper takes multiple node state parameters and link state parameters of physical layer and network layer into consideration and evaluation,and constantly updates route state according to real-time network dynamic information.A survivability-based dynamic load balancing routing optimization algorithm(SDLRO)is proposed.Through the simulation,the network survivability and load balancing capability are enhanced significantly with a small increase in route calculation time.Secondly,to solve the routing problem of optical network with necessary nodes,a heuristic optical network routing algorithm over specific points(HORA-SP).This method transforms the network topology,uses efficient heuristic algorithm to arrange the necessary nodes in order,and finally obtains the optimal path.Through simulation,in most network topologies,the algorithm proposed by us has obvious advantages compared with other algorithms in terms of computation time and solving quality.