Research on High Reliable Routing Optimization Algorithms for Programmable Networks
With the expansion of network scale and the increase of network complexity,the reliability and per-formance of the network become more and more important.In the programmable network,the routing optimization algo-rithm becomes one of the important means to improve the network performance and reliability.In the network,routing optimization is a very important issue,because it directly affects the performance and reliability of the network.Tradi-tional routing algorithms have some problems,such as slow convergence,low resource utilization and so on.In order to solve these problems,this paper proposes a new routing optimization algorithm,which combines Bellman-Ford's two-way Dijkstra algorithm to calculate the shortest path.Specifically,this paper starts with the programmable network,and analyzes the problems of the traditional routing algorithm;Secondly,in order to improve the traditional Dijkstra algo-rithm which can not solve the problem of negative weighted edges,the Bellman-Ford algorithm is integrated into the Dijkstra algorithm to solve the problem of negative weighted edges,and V-1 relaxation operations are performed on all edges to preprocess the upper bound of the distance from the source and sink to each node,so as to reduce the amount of calculation;Then,the search range of Dijkstra algorithm can be reduced by preprocessing the upper bound of the shortest path length from source and sink to all nodes,so as to improve the search efficiency.Finally,the proposed al-gorithm is verified by simulation experiments,and compared with the traditional routing algorithm.The experimental results show that the proposed algorithm is excellent in convergence speed and resource utilization,and can effectively improve the performance and reliability of the network.Therefore,the research of this paper has certain theoretical and practical significance,and has important reference value for the development of network technology.
NETL
NSTL
万方数据
