SDN (Software Defined Network) controller and method for determining shortest path in SDN

Abstract

The invention relates to a communication technology, in particular to an SDN (Software Defined Network) controller and a method for determining a shortest path in an SDN. The method is used for improving route computation efficiency in the SDN. According to the SDN controller provided by the embodiment of the invention, a receiving module receives a connection establishment request sent by a client end, and establishes connection from a designated starting node to a designated ending node; a processing module selects a shortest path algorithm according to the geographical environment information of the designated starting node and the designated ending node, and determines the shortest path from the designated starting node to the designated ending node according to the selected shortest path algorithm. The shortest path algorithm can be adaptively selected in the SDN, so that the selected shortest path algorithm can adapt to the change of an application scene, higher route computation efficiency can be obtained under different application scenes, and the connection establishment speed is further increased.

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, top K shortest path (K Shortest Path, KSP) algorithm, shortest path first (Shortest Path 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 n...

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