A dynamic routing control method and system for calculating forwarding paths based on SPFA algorithm

Abstract

The invention discloses a dynamic routing control method for calculating forwarding paths based on the SPFA algorithm, which calculates the optimal path through the SPFA algorithm according to network information; screens out the switch id passed by the optimal path from all switches; and analyzes the initial IP address of the path address; delete the flow tables that match the starting IP in all passing switches; obtain the link information, and create and deliver the flow tables that need to be delivered in each switch according to the link information and the optimal path forwarding order. The present invention greatly reduces the waste of inter-domain links, and is more intelligent; it is more specific and effective in terms of reliability, security, and error handling requirements; it makes the robustness and usability stronger, and increases its self-checking ability , to complete the regular self-inspection of the system, and report potential problems, which will help developers understand the status of the project from a long-term perspective, and open a new era of routing optimization in the SDN field for long-term maintenance and further development.

Description

technical field [0001] The invention belongs to the technical field of route control, and in particular relates to a dynamic route control method for calculating a forwarding path based on an SPFA algorithm. Background technique [0002] The main difference between routing and switching is that switching occurs at the second layer of the OSI reference model (the data link layer), while routing occurs at the third layer, the network layer. This difference determines that routing and switching need to use different control information in the process of moving information, so the two implement their respective functions in different ways. Routing is done when data is transferred from one subnet to another. Therefore, routing has the functions of judging network addresses, selecting paths, and forwarding. It can establish flexible connections in a multi-network interconnection environment, and can connect various subnets with completely different data packets and media access m...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a dynamic routing control method based on the SPFA algorithm to calculate the forwarding path, aiming to solve the problem of the waste of bandwidth and the loss of unnecessary data caused by the existence of grouping methods sent from the same router at the same time and arriving at the same destination address , resulting in a large number of redundant calculations and slow update problems

Images