SPFA algorithm-based dynamic route control method calculating forwarding path

Abstract

The present invention discloses an SPFA algorithm-based dynamic route control method calculating a forwarding path. The method comprises the steps of calculating an optimal path according to network information by using the SPFA algorithm; screening out ids of switches that the optimal path passes among all switches; analyzing a starting IP address of the path; deleting flow tables in accordance with the starting IP in all switches that the optimal path passes; and acquiring link information, and creating and delivering the flow table to be delivered in each switch according to the link information and an optimal path forwarding sequence. Through adoption of the method, interdomain link waste is greatly reduced and the link is more intelligent; according to reliability, security and error processing demands, the path is optimized specifically and effectively; the robustness and availability are enhanced, the self-check capability is enhanced, regular self-check of the system is completed and potential problems are reported; and developers can learn the project from a long-term perspective and perform long-term maintenance and further development for the project, so that a new era of route optimization in an SDN domain is ushered in.

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