Routing computing method and network node based on link condition routing protocol

Abstract

The invention discloses a route calculation method based on a link-state routing protocol, and the method essentially includes that a node list and an accessible prefix table are established and maintained, wherein, the identifier and the route information of each node on a shortest path tree are stored in the node list and the corresponding accessible prefix information of each node on the shortest path tree is stored in the accessible prefix table; when the link state in the network changes, the latest path information of each node is obtained by reconstructing the shortest path tree; the latest path information of each node is compared with the corresponding path information in the node list to determine the nodes of which the paths are changed; the path of each accessible prefix in the accessible prefix table is calculated, which corresponds with the nodes of which the routes are changed. The invention further discloses a network node which runs the link-state routing protocol. The technical proposal of the invention is comparatively easy to be realized and has high efficiency.

Description

technical field [0001] The invention relates to network communication technology, in particular to a route calculation method based on a link state routing protocol and a network node running the link state routing protocol. Background technique [0002] A link-state routing protocol (link-state routing protocol) refers to a protocol that collects link states related to all routers in the network and obtains corresponding routing information through calculation. Generally, the interface information and neighbor information of a routing protocol running on a router are called link state. At present, the main link state routing protocols are: Open Shortest Path First Routing (OSPF, Open Shortest Path First) protocol, Open Shortest Path First Routing Version 3 (OSPFv3, Open Shortest Path First Version 3) protocol and intermediate system to intermediate system intra-domain routing Information exchange (IS-IS, Intermediate System-to-Intermediate System intra-domain routing infor...

AI Technical Summary

Problems solved by technology

At the same time, it is also necessary to distinguish and record the different states of all NODEs and LINKs, such as whether the NODE and LINK are valid nodes and valid paths on the shortest path tree, etc., and record the change type of the link state, such as increased or decreased overhead (cost ), new link and link disconnection, etc., and then combine the above information to judge whether local correction of the shortest path tree is needed and which nodes and reachable prefixes on the shortest path tree need to be recalculated, etc., and also invented a A new algorithm that needs to recalculate nodes and leaves on the shortest path tree, but this algorithm requires multiple recursive calculations, and the implementation is too complicated

[0007] In summary, the routing calculation method in the existing link state routing protocol is complex and inefficient

Images