Shortest path determination method in sdn controller and sdn

Abstract

The invention relates to communication technology, in particular to a software-defined network SDN controller and a method for determining the shortest path in SDN, which are used to improve routing calculation efficiency in SDN. In an SDN controller provided by an embodiment of the present invention, the receiving module receives the connection establishment request sent by the client, and establishes a connection from the designated starting node to the designated termination node; The geographical environment information selects the shortest path algorithm, and determines the shortest path from the specified start node to the specified end node according to the selected shortest path algorithm. It realizes the adaptive selection of the shortest path algorithm in SDN, so that the selected shortest path algorithm can adapt to the change of application scenarios, so that higher efficiency of routing calculation can be obtained in different application scenarios, thereby improving the connection establishment speed.

Description

technical field [0001] The present invention relates to communication technology, in particular to a software defined network (Software Defined Network, SDN) controller and a method for determining the shortest path in the SDN. Background technique [0002] The shortest path algorithm is a common routing algorithm, which can be used to determine the shortest path from the start node to the end node in the network. Common shortest path algorithms include: Dijkstra (Dijkstra) algorithm, Bellman-Ford (bellman-ford) algorithm, K Shortest Path (K Shortest Path, KSP) algorithm, Shortest Path First (ShortestPath First, SPF) Algorithm, Floyd (Floyd-Warshall) algorithm, etc. [0003] In a traditional network, each network node in the network maintains the topology information of the entire network, and each network node calculates the route independently using the shortest path algorithm described above. [0004] Software Defined Network (Software Defined Network, SDN) is a new typ...

AI Technical Summary

Problems solved by technology

[0005] At present, the SDN controller adopts a fixed shortest path algorithm (such as a fixed Dijkstra algorithm or a fixed bellman-ford algorithm), which cannot adapt to different application environments or business scenarios. For example, the Dijkstra algorithm is for small-scale networks, or in When the number of path hops in the network is small, the calculation efficiency is high

However, for large-scale networks, or in the case of a large number of path hops, the calculation efficiency is not as good as the parallel bellman-ford algorithm, which leads to low routing calculation efficiency in some scenarios, resulting in slow connection establishment

Images