CN112333101B

CN112333101B - Network topology path finding method, device, equipment and storage medium

Info

Publication number: CN112333101B
Application number: CN202011111477.9A
Authority: CN
Inventors: 王跃峰
Original assignee: Fiberhome Telecommunication Technologies Co Ltd
Current assignee: Fiberhome Telecommunication Technologies Co Ltd
Priority date: 2020-10-16
Filing date: 2020-10-16
Publication date: 2022-08-12
Anticipated expiration: 2040-10-16
Also published as: CN112333101A

Abstract

The invention discloses a network topology path-finding method, a device, equipment and a storage medium, wherein the method simultaneously enumerates a source node and a sink node of a network transmission link to obtain an enumeration result; constructing a source node topological path and a sink node topological path according to the enumeration result; filtering interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path; the method can simultaneously enumerate from a source and a sink, and can reduce the search level by half along with the increase of the topology depth to detect the meeting point of the path, thereby greatly shortening the search time of the topology node, avoiding traversing many nodes of the topology map, reducing the memory consumption, ensuring the accuracy of the network topology path finding, finding the approximate solution at the fastest speed, reducing the search depth, greatly saving the path finding time and improving the speed and efficiency of the network topology path finding.

Description

Network topology path finding method, device, equipment and storage medium

Technical Field

The present invention relates to the field of network transmission technologies, and in particular, to a method, an apparatus, a device, and a storage medium for network topology path finding.

Background

In the application of the management function of a network topology transmission system, the shortest path (called link for short) between two nodes is often searched, or the minimum closed path (called loop for short) passing through a certain node in the topology is searched; the shortest path algorithm is needed, and the common shortest path algorithm such as breadth-first search algorithm has the following defects: with the increase of the depth of the breadth-first search algorithm, the occupied memory of the breadth node set for searching the route is very large, and the traversal is very time-consuming; in the other shortest path algorithm, the a-Star algorithm has the problem of consuming a large amount of memory when the active destination node is unreachable, namely when the routing map is super large, the nodes of the open list and the closed list have a large number of sources and sinks, the search is slow, and the process memory even exceeds the limit; and as the search depth increases, the number of nodes in the open list increases, and thus, the time for sorting the evaluation values of the open list is extremely consumed.

Disclosure of Invention

The invention mainly aims to provide a network topology routing method, a network topology routing device, network topology routing equipment and a network topology routing storage medium, and aims to solve the technical problems that in the prior art, the time consumed by occupied memory is large when the shortest path of a network topology node is searched through breadth first, a large amount of memory is consumed when a source node and a destination node are unreachable when the shortest path of the network topology node is searched through A, and the node search is slow.

In a first aspect, the present invention provides a network topology path-finding method, which includes the following steps:

simultaneously enumerating a source node and a sink node of a network transmission link to obtain an enumeration result;

constructing a source node topological path and a sink node topological path according to the enumeration result;

and filtering the interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path.

Optionally, the enumerating a source node and a sink node of a network transmission link at the same time to obtain an enumeration result includes:

enumerating all connecting fibers and network elements of a network transmission link from a source node of the network transmission link according to a preset enumeration rule, enumerating source adjacent nodes of all the source nodes, and obtaining a source node enumeration result, wherein the source node enumeration result comprises the source node, the source adjacent nodes, and all the connecting fibers and network elements enumerated from the source node;

and simultaneously enumerating all the connection fibers and the network elements of the network transmission link from the host nodes of the network transmission link according to the preset enumeration rule, enumerating the host adjacent nodes of all the host nodes, and obtaining a host node enumeration result, wherein the host node enumeration result comprises the host nodes, the host adjacent nodes, and all the connection fibers and the network elements enumerated from the host nodes.

Optionally, the constructing a source node topology path and a sink node topology path according to the enumeration result includes:

using each fiber and network element in the source node enumeration result as a source end intermediate node, and combining the source node and the source adjacent node to generate a source node topology path;

and taking each fiber and network element in the enumeration result of the host node as a host end intermediate node, and combining the host node and the host adjacent node to generate a source node topological path.

Optionally, the generating a source node topology path by using each fiber and network element in the source node enumeration result as a source end intermediate node and combining the source node and the source neighboring node includes:

taking each fiber and network element in the enumeration result of the source node as a source end intermediate node, and adding the source end intermediate node, the source node and the source adjacent node into a preset source end open list;

and carrying out valuation sequencing on the preset source end open list according to a preset A-algorithm to obtain a minimum valuation node, moving the minimum valuation node into a preset source end closed list, and generating a source node topology path according to the preset source end closed list.

Optionally, the performing, according to a preset a-algorithm, estimation sorting on the preset source end open list to obtain a minimum estimation node, moving the minimum estimation node into a preset source end closed list, and generating a source node topology path according to the preset source end closed list includes:

carrying out valuation sequencing on the preset source end open list according to a preset A-star algorithm;

traversing adjacent nodes of the minimum evaluation node in the preset source end open list;

judging whether a preset host closing list exists or not;

when the preset sink end closing list exists, splicing all the minimum evaluation nodes to generate a source node topological path;

judging whether the host thread is finished or not when the preset host end closing list does not exist;

when the host thread is finished, splicing all the minimum evaluation nodes to generate a source node topological path;

when the host thread is not finished, judging whether a next traversal thread exists;

when a next traversal thread exists, continuously traversing the adjacent node of the minimum evaluation node in the preset source end open list;

and moving all the minimum evaluation nodes into a preset source end closing list, and splicing all the minimum evaluation nodes to generate a source node topology path.

Optionally, the generating a source node topology path by using each fiber and network element in the enumeration result of the sink node as a sink end intermediate node and combining the sink node and the sink neighboring node includes:

taking all the connection fibers and network elements in the host node enumeration result as host end intermediate nodes, and adding the host end intermediate nodes, the host nodes and the host adjacent nodes into a preset host end open list;

and carrying out estimation sorting on the preset sink open list according to a preset A-x algorithm to obtain a minimum estimation node, moving the minimum estimation node into a preset sink closed list, and generating a sink node topological path according to the preset sink closed list.

Optionally, the performing, according to a preset a-algorithm, valuation sorting on the preset sink open list to obtain a minimum valuation node, moving the minimum valuation node into a preset sink closed list, and generating a sink node topology path according to the preset sink closed list, includes:

carrying out valuation sequencing on the preset sink end open list according to a preset A-star algorithm;

traversing the adjacent nodes of the minimum evaluation node in the preset sink end open list;

judging whether a preset source end closing list exists or not;

when the preset source end closing list exists, all minimum evaluation nodes are spliced to generate a host node topological path;

judging whether the host thread is ended or not when the preset source end closing list does not exist;

when the sink thread is finished, splicing all the minimum evaluation nodes to generate a sink node topological path;

when a next traversal thread exists, continuously traversing the adjacent nodes of the minimum evaluation node in the preset sink end open list;

and moving all the minimum evaluation nodes into a preset sink end closing list, and splicing all the minimum evaluation nodes to generate a source sink node topological path.

Optionally, the filtering interference nodes in the source node topology path and the sink node topology path, and splicing the filtered source node topology path and sink node topology path to obtain a network topology path includes:

identifying a repeating node and a loop node in the source node topological path and the sink node topological path, taking the repeating node and the loop node as interference nodes, and filtering the interference nodes;

and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path.

Optionally, the preset enumeration rule carries a history node path when enumerating nodes, determines a loop node with repeated history node paths, and terminates enumeration of the loop node.

In a second aspect, the present invention further provides a network topology path finding device, where the network topology path finding device includes:

the enumeration module is used for enumerating a source node and a sink node of a network transmission link at the same time to obtain an enumeration result;

the path construction module is used for constructing a source node topological path and a sink node topological path according to the enumeration result;

and the filtering and splicing module is used for filtering the interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path.

In a third aspect, the present invention further provides a network topology routing device, where the network topology routing device includes: the system comprises a memory, a processor and a network topology routing program stored on the memory and operable on the processor, the network topology routing program being configured to implement the steps of the network topology routing method as described above.

In a fourth aspect, the present invention further provides a storage medium, where a network topology routing program is stored, and when executed by a processor, the network topology routing program implements the steps of the network topology routing method as described above.

The network topology path-finding method provided by the invention enumerates the source node and the sink node of the network transmission link at the same time to obtain an enumeration result; constructing a source node topological path and a sink node topological path according to the enumeration result; filtering interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path; the method can simultaneously enumerate from a source and a sink, and can reduce the search level by half along with the increase of the topology depth to detect the meeting point of the path, thereby greatly shortening the search time of the topology node, avoiding traversing many nodes of the topology map, reducing the memory consumption, ensuring the accuracy of the network topology path finding, finding the approximate solution at the fastest speed, reducing the search depth, greatly saving the path finding time and improving the speed and efficiency of the network topology path finding.

Drawings

FIG. 1 is a schematic diagram of an apparatus architecture of a hardware operating environment according to an embodiment of the present invention;

FIG. 2 is a flowchart illustrating a first embodiment of a network topology routing method according to the present invention;

FIG. 3 is a flowchart illustrating a second embodiment of a network topology routing method according to the present invention;

FIG. 4 is a flowchart illustrating a third embodiment of a network topology routing method according to the present invention;

FIG. 5 is a flowchart illustrating a fourth embodiment of a network topology routing method according to the present invention;

FIG. 6 is a flowchart illustrating a fifth embodiment of a network topology routing method according to the present invention;

FIG. 7 is a flowchart illustrating a sixth embodiment of a network topology routing method according to the present invention;

fig. 8 is a functional block diagram of a network topology routing device according to a first embodiment of the present invention.

The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.

Detailed Description

It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

The solution of the embodiment of the invention is mainly as follows: enumerating a source node and a sink node of a network transmission link at the same time to obtain an enumeration result; constructing a source node topological path and a sink node topological path according to the enumeration result; filtering the interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path; the method can simultaneously enumerate from a source and a destination, can reduce the search level by half along with the increase of the topology depth to detect the meeting point of the path, greatly shortens the search time of the topology node, avoids traversing many nodes of the topology map, reduces the memory consumption, ensures the accuracy of the network topology path finding, can find the approximate solution at the fastest speed, reduces the search depth, greatly saves the path finding time, improves the speed and the efficiency of the network topology path finding, and solves the technical problems that in the prior art, the searching of the shortest path of the network topology node through the breadth first consumes a large amount of memory when the shortest path of the network topology node is occupied, and the searching of the node is slow when the source node and the destination node are unreachable.

Referring to fig. 1, fig. 1 is a schematic device structure diagram of a hardware operating environment according to an embodiment of the present invention.

As shown in fig. 1, the apparatus may include: a processor 1001, such as a CPU, a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., a Wi-Fi interface). The Memory 1005 may be a high-speed RAM Memory or a Non-Volatile Memory (Non-Volatile Memory), such as a disk Memory. The memory 1005 may alternatively be a storage device separate from the processor 1001.

Those skilled in the art will appreciate that the configuration of the apparatus shown in fig. 1 is not intended to be limiting of the apparatus and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.

As shown in fig. 1, a memory 1005, which is a storage medium, may include therein an operating system, a network communication module, a user interface module, and a network topology routing program.

The device calls a network topology routing program stored in a memory 1005 through a processor 1001, and executes the following operations:

Further, the processor 1001 may call the network topology routing program stored in the memory 1005, and further perform the following operations:

enumerating all connecting fibers and network elements of a network transmission link from a source node of the network transmission link according to a preset enumeration rule, enumerating source adjacent nodes of all the source nodes, and obtaining a source node enumeration result, wherein the source node enumeration result comprises the source node, the source adjacent nodes and all the connecting fibers and network elements enumerated from the source node;

and carrying out estimation sorting on the preset source end open list according to a preset A-x algorithm to obtain a minimum estimation node, moving the minimum estimation node into a preset source end closed list, and generating a source node topology path according to the preset source end closed list.

traversing adjacent nodes of the minimum evaluation value node in the preset source end open list;

judging whether a preset host closing list exists or not;

and carrying out valuation sequencing on the preset sink open list according to a preset A-algorithm to obtain a minimum valuation node, moving the minimum valuation node into a preset sink closed list, and generating a sink node topological path according to the preset sink closed list.

judging whether a preset source end closing list exists or not;

and when the preset enumeration rule is an enumeration node, carrying a historical node path, determining a loop node with repeated historical node paths, and terminating the enumeration of the loop node.

In this embodiment, through the above scheme, an enumeration result is obtained by simultaneously enumerating a source node and a sink node of a network transmission link; constructing a source node topological path and a sink node topological path according to the enumeration result; filtering interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path; the method can simultaneously enumerate from a source and a destination, can reduce the searching level by half along with the increase of the topology depth to detect the meeting points of the paths, greatly shortens the searching time of the topology nodes, avoids traversing a plurality of nodes of the topology map, reduces the memory consumption, ensures the accuracy of the path searching of the network topology, can find the approximate solution at the fastest speed, reduces the searching depth, greatly saves the path searching time, and improves the speed and the efficiency of the path searching of the network topology.

Based on the hardware structure, the embodiment of the network topology path-finding method is provided.

Referring to fig. 2, fig. 2 is a flowchart illustrating a first embodiment of a network topology routing method according to the present invention.

In a first embodiment, the network topology routing method includes the following steps:

and step S10, enumerating the source node and the sink node of the network transmission link at the same time, and obtaining an enumeration result.

It should be noted that the network transmission link is a transmission link that needs to perform network topology routing currently, and enumerates the source node and the sink node of the network transmission link at the same time, that is, an enumeration algorithm is started from the source node and the sink node in a bidirectional enumeration manner to perform enumeration operation, so as to obtain a corresponding source node enumeration result and a corresponding sink node enumeration result.

It can be understood that, in an actual topology routing, after a source node and a sink node of a network transmission link are enumerated, an enumeration result including a plurality of connection fibers and network elements can be obtained, the connection fibers are optical fiber paths connected between network element nodes, the network elements are network element nodes in the network transmission link, and different connection fibers represent different paths.

And step S20, constructing a source node topological path and a sink node topological path according to the enumeration result.

It should be understood that, after the enumeration result is obtained, a corresponding source node topology path and a corresponding sink node topology path may be constructed according to each node in the enumeration result, that is, each node in the enumeration result is connected to generate a corresponding source node topology path and a corresponding sink node topology path.

And step S30, filtering the interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path.

It can be understood that, the interference node is a node which will cause interference to topology routing in the source node topology path and the sink node topology path, and after filtering the interference nodes in the source node topology path and the sink node topology path, the filtered paths are spliced to generate a network topology path, so that the accuracy of topology routing can be improved, and the memory consumption can be reduced.

In this embodiment, through the above scheme, an enumeration result is obtained by simultaneously enumerating a source node and a sink node of a network transmission link; constructing a source node topological path and a sink node topological path according to the enumeration result; filtering the interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path; the method can simultaneously enumerate from a source and a sink, and can reduce the search level by half along with the increase of the topology depth to detect the meeting point of the path, thereby greatly shortening the search time of the topology node, avoiding traversing many nodes of the topology map, reducing the memory consumption, ensuring the accuracy of the network topology path finding, finding the approximate solution at the fastest speed, reducing the search depth, greatly saving the path finding time and improving the speed and efficiency of the network topology path finding.

Further, fig. 3 is a schematic flow chart of a second embodiment of the network topology route searching method of the present invention, and as shown in fig. 3, the second embodiment of the network topology route searching method of the present invention is proposed based on the first embodiment, in this embodiment, the step S10 specifically includes the following steps:

step S11, enumerating each fiber connection and network element of the network transmission link from a source node of the network transmission link according to a preset enumeration rule, enumerating source neighboring nodes of all the source nodes, and obtaining a source node enumeration result, where the source node enumeration result includes the source node, the source neighboring nodes, and each fiber connection and network element enumerated from the source node.

It should be noted that the preset enumeration rule is a preset node enumeration rule, and enumeration can be started from a source node through the preset enumeration rule, so as to enumerate neighboring nodes of all source nodes, that is, enumerating all source neighboring nodes, the source neighboring nodes are not limited to only nodes adjacent to the source node, but may also be nodes having a neighboring relationship with the source node neighboring nodes, that is, nodes having an adjacent relationship with the source node may all be the source neighboring nodes, and are not limited to the number of the levels of the adjacent relationship, as long as the nodes having an adjacent relationship with the source node may all be the source neighboring nodes, and by enumerating all the source neighboring nodes, a corresponding source node enumeration result may be obtained, where the source node enumeration result includes a source node, and each connection fiber and network element enumerated from the source node, and a source neighboring node, where a network element adjacent to the source node in each network element is used as the source neighboring node.

Further, the preset enumeration rule is that a history node path is carried when nodes are enumerated, a loop node with repeated history node paths is determined, and enumeration of the loop node is terminated.

It should be noted that the node path that the next layer of nodes must take away is to avoid the loop node, so as to facilitate checking the duplicate node, when the node path is duplicated, the enumeration of the loop node corresponding to the node path is terminated, and the loop node can be avoided, so as to terminate the enumeration of the loop node, thereby saving the time for eliminating the duplicate node, and reducing the search depth.

Step S12, simultaneously enumerate all the connection fibers and network elements of the network transmission link from the host nodes of the network transmission link according to the preset enumeration rule, enumerate all the host neighboring nodes of the host nodes, and obtain a host node enumeration result, where the host node enumeration result includes the host nodes, the host neighboring nodes, and all the connection fibers and network elements enumerated from the host nodes.

It can be understood that, while enumeration is started from a source node, enumeration is started from a sink node according to a preset enumeration rule, and enumeration can be started from the sink node by the preset enumeration rule, so as to enumerate neighboring nodes of all sink nodes, that is, enumerate all sink neighboring nodes, the sink neighboring nodes are not limited to only nodes neighboring the sink node, but also nodes neighboring the sink node, that is, nodes having a proximity relationship with the sink node can be used as sink neighboring nodes, and are not limited to the level number of the proximity relationship, as long as nodes having a proximity relationship with the sink node can be used as sink neighboring nodes, and through enumeration of all sink neighboring nodes, a corresponding sink node enumeration result can be obtained, the sink node enumeration result includes the sink node and each connection fiber and network element and the sink neighboring nodes starting from the sink node, and the network element adjacent to the sink node in each network element is used as the sink adjacent node.

According to the scheme, the method includes that each fiber connection and network element of a network transmission link are enumerated from a source node of the network transmission link according to a preset enumeration rule, source neighbor nodes of all the source nodes are enumerated, and a source node enumeration result is obtained, wherein the source node enumeration result includes the source node, the source neighbor nodes and each fiber connection and network element enumerated from the source node; meanwhile, enumerating all the connection fibers and the network elements of the network transmission link from the host nodes of the network transmission link according to the preset enumeration rule, enumerating the host adjacent nodes of all the host nodes to obtain a host node enumeration result, wherein the host node enumeration result comprises the host nodes, the host adjacent nodes and all the connection fibers and the network elements enumerated from the host nodes, and can enumerate from a source and a host simultaneously.

Further, fig. 4 is a schematic flow chart of a third embodiment of the network topology routing method of the present invention, and as shown in fig. 4, the third embodiment of the network topology routing method of the present invention is proposed based on the second embodiment, in this embodiment, the step S20 specifically includes the following steps:

step S21, taking each fiber and network element in the source node enumeration result as a source end intermediate node, and generating a source node topology path by combining the source node and the source neighboring node.

It should be noted that, in the source node enumeration result, there may be more than one connection fiber between two network elements, and different connection fibers represent different paths, so that when a path is constructed, each connection fiber and network element need to be regarded as nodes, that is, each connection fiber and network element need to be regarded as source end intermediate nodes, and a source node topology path can be generated by combining the source node and the source end neighboring nodes, for a connection fiber, each connection fiber has two network elements as child nodes, and each network element may have multiple connection fibers as child nodes.

It can be understood that after the connection fiber is used as a node, the number of nodes of a legal path from the network element to the network element is odd, so that the source and the sink can simultaneously advance to a level in one thread, and the nodes can meet at a certain level as long as the path exists, thereby reducing the time consumption caused by dynamically acquiring and enumerating the connection fiber in the routing process.

Step S22, taking each fiber and network element in the enumeration result of the sink node as a sink end intermediate node, and generating a source node topology path by combining the sink node and the sink neighboring node.

It can be understood that there may be more than one connection fiber between two network elements in the destination node enumeration result, and different connection fibers represent different paths, so that when a path is constructed, each connection fiber and network element need to be regarded as nodes, that is, each connection fiber and network element are regarded as destination intermediate nodes, and a destination node topology path can be generated by combining the destination node and the destination neighboring nodes.

In this embodiment, through the foregoing scheme, each connection fiber and network element in the source node enumeration result are used as a source end intermediate node, and a source node topology path is generated by combining the source node and the source neighboring node; and taking each fiber and network element in the enumeration result of the host node as a host end intermediate node, and generating a source node topological path by combining the host node and the host adjacent node, so that each node in a network transmission link can be effectively connected according to the comprehensiveness to form a corresponding topological path, the accuracy of network topology routing is improved, and the speed and efficiency of network topology routing are improved.

Further, fig. 5 is a schematic flow chart of a fourth embodiment of the network topology path-finding method of the present invention, and as shown in fig. 5, the fourth embodiment of the network topology path-finding method of the present invention is proposed based on the third embodiment, in this embodiment, the step S21 specifically includes the following steps:

step S211, taking each fiber and network element in the source node enumeration result as a source end intermediate node, and adding the source end intermediate node, the source node, and the source adjacent node into a preset source end open list.

It should be noted that the preset source end open list is a preset list for storing and recording all generated source end nodes which are not subjected to access investigation, and by taking each fiber and network element in the source node enumeration result as a source end intermediate node and adding the source end intermediate node, the source node and the source adjacent node into the preset source end open list, centralized management and recording can be performed on each node, and the change of each node can be conveniently known in real time, so that the accuracy of a topology path is improved.

And step S212, carrying out valuation sequencing on the preset source end open list according to a preset A-algorithm to obtain a minimum valuation node, moving the minimum valuation node into a preset source end closed list, and generating a source node topology path according to the preset source end closed list.

It should be understood that the preset a-algorithm is a preset a-algorithm for calculating the shortest path of a network transmission link, the preset source end open list can be evaluated and sorted through the preset a-algorithm, so that a node meeting requirements is found from the preset source end open list as a minimum evaluation point, the preset source end closed list is a preset list for storing and recording all source end nodes visited, and a source node topology path can be generated according to the preset source end closed list by moving the minimum evaluation node into the preset source end closed list.

Further, the step S212 specifically includes the following steps:

judging whether a preset sink closing list exists or not;

It should be noted that, the estimated value sequencing may be performed on each node in the preset source-end open list through a preset a-x algorithm, so that a corresponding node is determined from the preset source-end open list as a minimum estimated value node, and an adjacent node corresponding to the minimum estimated value node is traversed, which nodes in an adjacent relationship corresponding to the minimum estimated value node are determined, thereby preparing for the splicing generation of a subsequent topology path.

In a specific implementation, the step of sorting the nodes in the preset source-end open list through a preset a-x algorithm may be to calculate an actual cost, that is, a distance, required from a center point of each node to a center point of another node, and determine a corresponding minimum evaluation node by sorting values of the actual cost.

It should be understood that, traversing the neighboring nodes of the minimum evaluation node in the preset source-end open list in a manner of excluding the unreachable nodes and existing nodes among 8 nodes around, or obliquely from the current minimum evaluation node, so as to set the parent node of the neighboring node as the node with the minimum evaluation value and add the node to the preset source-end open list; of course, other traversal manners may be adopted, which is not limited in this embodiment; for example, nodes in the preset source end open list are traversed according to a preset traversal algorithm, so that a minimum evaluation node is determined; and after traversing, moving the current minimum evaluation node into a preset source end closing list to be used as a traversed node.

It can be understood that, before generating a topology path, it is further required to determine whether a preset sink closing list exists, where the preset sink closing list is a preset list used for storing and recording all sink nodes that have been visited and investigated, and whether a sink thread ends or not can be determined by whether the preset sink closing list exists, the sink thread is a thread for performing sink topology routing, a corresponding source thread is a thread for performing source topology routing, and when the preset sink closing list exists, that is, the sink thread ends, at this time, the minimum evaluation nodes can be spliced to generate the source node topology path.

In a specific implementation, the preset source-side open list and the preset sink-side open list are used as global data, and each of the preset source-side open list and the preset sink-side open list corresponds to one exclusive lock, that is, whether a sink flow is finished or not is confirmed before a source node topological path is generated, and whether the source flow is finished or not is confirmed before the sink node topological path is generated, so that synchronous operation of double-thread reading and writing is achieved.

It should be understood that when another thread is detected to end, the representative side has found the other side or no way has been found to be available, so that the thread stops searching, and when the source and sink are not reachable, the node thread closed by a small range will firstly have no way to be available, thereby avoiding traversing many nodes of the map and reducing the consumption of the memory.

In this embodiment, by using the above scheme, each fiber and network element in the source node enumeration result as a source end intermediate node, and adding the source end intermediate node, the source node, and the source adjacent node to a preset source end open list; and carrying out estimation sequencing on the preset source end open list according to a preset A-algorithm to obtain a minimum estimation node, moving the minimum estimation node into a preset source end closed list, and generating a source node topological path according to the preset source end closed list, so that nodes which have accessed to be investigated and nodes which have not accessed to be investigated can be effectively distinguished, centralized management and recording are carried out on each node, the change of each node is conveniently known in real time, the accuracy of the topological path is improved, and the memory loss is reduced.

Further, fig. 6 is a schematic flow chart of a fifth embodiment of the network topology path-finding method of the present invention, and as shown in fig. 6, the fifth embodiment of the network topology path-finding method of the present invention is proposed based on the third embodiment, in this embodiment, the step S22 specifically includes the following steps:

step S221, using each fiber and network element in the enumeration result of the sink node as a sink intermediate node, and adding the sink intermediate node, the sink node, and the sink neighboring node to a preset sink open list.

It should be noted that the preset sink open list is a preset list for storing and recording all sink nodes that have been generated but have not been subjected to access investigation, and by taking each connection fiber and network element in the sink node enumeration result as a sink intermediate node and adding the sink intermediate node, the sink node and the sink adjacent node into the preset sink open list, centralized management and recording can be performed on each node, and the change of each node can be conveniently known in real time, so that the accuracy of a topology path is improved.

And step S222, carrying out valuation sequencing on the preset sink open list according to a preset A-algorithm to obtain a minimum valuation node, moving the minimum valuation node into a preset sink closed list, and generating a sink node topology path according to the preset sink closed list.

It can be understood that the preset sink open list can be subjected to valuation sorting through the preset a-algorithm, so that a node meeting requirements is found from the preset sink open list as a minimum valuation point, the preset sink closed list is a preset list for storing and recording all sink nodes which have visited and investigated, and a sink node topology path can be generated according to the preset sink closed list by moving the minimum valuation node into the preset sink closed list.

Further, the step S222 specifically includes the following steps:

judging whether a preset source end closing list exists or not;

It should be noted that, the estimation ordering may be performed on each node in the preset sink open list through a preset a-star algorithm, so that a corresponding node is determined from the preset sink open list as a minimum estimation node, and neighboring nodes corresponding to the minimum estimation node are traversed, which nodes in a neighboring relationship corresponding to the minimum estimation node are determined, thereby preparing for the generation of the subsequent topology path.

It should be understood that, traversing the neighboring nodes of the minimum evaluation value node in the preset sink open list in a manner of excluding the unreachable nodes and the existing nodes in the 8 nodes around, or obliquely from the current minimum evaluation value node, so as to set the parent node of the neighboring node as the node with the minimum evaluation value and add the node into the preset sink open list; of course, other traversal manners may be adopted, which is not limited in this embodiment; for example, nodes in the preset sink open list are traversed according to a preset traversal algorithm, so that a minimum evaluation node is determined; and after traversing, moving the current minimum evaluation value node into a preset sink end closing list as a traversed node.

In a specific implementation, the step of sorting the nodes in the preset sink open list through a preset a-x algorithm may be to calculate an actual cost, that is, a distance, required from a central point of each node to a central point of another node, and determine a corresponding minimum evaluation node by sorting values of the actual cost.

It can be understood that it is further required to determine whether a preset source end closing list exists before generating a topology path, where the preset source end closing list is a preset list used for storing and recording all source end nodes that have been visited and investigated, whether a source thread ends or not can be determined through whether the preset source end closing list exists, the source thread is a thread performing source end topology routing, a corresponding sink thread is a thread performing sink end topology routing, and when the preset source end closing list exists, that is, the source thread ends, at this time, the minimum valuation nodes can be spliced to generate a sink node topology path.

In a specific implementation, the preset sink end open list and the preset source end open list are used as global data, and each of the preset sink end open list and the preset source end open list corresponds to one exclusive lock, that is, whether a sink flow is finished or not is confirmed before a source node topological path is generated, and whether the source flow is finished or not is confirmed before the sink node topological path is generated, so that synchronous operation of double-thread reading and writing is achieved.

In this embodiment, by using the above scheme, each connection fiber and network element in the enumeration result of the host node as a host intermediate node, and adding the host intermediate node, the host node, and the host neighboring node to a preset host open list; the method comprises the steps of carrying out valuation sequencing on a preset sink open list according to a preset A-algorithm to obtain a minimum valuation node, moving the minimum valuation node into a preset sink closed list, and generating a sink node topological path according to the preset sink closed list, so that nodes which have visited and have not visited can be effectively distinguished, centralized management and recording are carried out on the nodes, changes of the nodes can be conveniently known in real time, the accuracy of the topological path is improved, and memory loss is reduced.

Further, fig. 7 is a flowchart illustrating a sixth embodiment of the network topology path-finding method of the present invention, and as shown in fig. 7, the sixth embodiment of the network topology path-finding method of the present invention is proposed based on the first embodiment, and in this embodiment, the step S30 specifically includes the following steps:

step S31, identifying a duplicate node and a loop node in the source node topological path and the sink node topological path, and filtering the duplicate node and the loop node as interference nodes.

It should be noted that the repeating node is a node repeatedly calculated into a path in the source node topological path and the sink node topological path, the loop node is a node that needs to go around a loop in the topology, and both the repeating node and the loop node will cause interference to the final formation of the topological path, so that the accuracy of the topological path is reduced.

And step S32, splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path.

It can be understood that the network topology path can be obtained by splicing the filtered source node topology path and the filtered sink node topology path, and the splicing manner may be to directly find a target node of the source node topology path and a target node of the sink node topology path, and associate the two target nodes to complete the splicing of the paths, or certainly, the splicing may be performed according to a path sequence by using a specific splicing algorithm, which is not limited in this embodiment.

In this embodiment, with the above scheme, by identifying a duplicate node and a return node in the source node topology path and the sink node topology path, the duplicate node and the return node are used as interference nodes to filter the interference nodes; splicing the filtered source node topological paths and the filtered sink node topological paths to obtain network topological paths; the method can quickly find an approximate solution, reduces the depth of path search, greatly saves the path searching time, effectively avoids the interference of an interference node on the generation of the topological path, improves the accuracy of the network topology path searching, and reduces the memory loss.

Correspondingly, the invention further provides a network topology routing device.

Referring to fig. 8, fig. 8 is a functional block diagram of a first embodiment of the network topology routing device of the present invention.

In a first embodiment of the network topology routing apparatus of the present invention, the network topology routing apparatus includes:

an enumeration module 10, configured to enumerate a source node and a sink node of a network transmission link at the same time, and obtain an enumeration result.

And a path constructing module 20, configured to construct a source node topology path and a sink node topology path according to the enumeration result.

And a filtering and splicing module 30, configured to filter the interference nodes in the source node topology path and the sink node topology path, and splice the filtered source node topology path and the filtered sink node topology path to obtain a network topology path.

The steps implemented by each functional module of the network topology path finding device can refer to each embodiment of the network topology path finding method of the present invention, and are not described herein again.

In addition, an embodiment of the present invention further provides a storage medium, where the storage medium may be a computer-readable nonvolatile storage medium, and certainly may also be other types of storage media, which is not limited in this embodiment; the storage medium stores a network topology routing program, and the network topology routing program realizes the following operations when executed by a processor:

Further, the network topology routing program when executed by the processor further implements the following operations:

taking each connection fiber and network element in the source node enumeration result as a source end intermediate node, and adding the source end intermediate node, the source node and the source adjacent node into a preset source end open list;

judging whether a preset host closing list exists or not;

when the preset sink end closing list exists, splicing all minimum valuation nodes to generate a source node topological path;

judging whether a preset source end closing list exists or not;

and the preset enumeration rule carries a history node path when enumerating nodes, determines a loop node with repeated history node paths, and terminates enumeration of the loop node.

In this embodiment, through the above scheme, an enumeration result is obtained by simultaneously enumerating a source node and a sink node of a network transmission link; constructing a source node topological path and a sink node topological path according to the enumeration result; filtering interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path; the method can simultaneously enumerate from a source and a sink, and can reduce the search level by half along with the increase of the topology depth to detect the meeting point of the path, thereby greatly shortening the search time of the topology node, avoiding traversing many nodes of the topology map, reducing the memory consumption, ensuring the accuracy of the network topology path finding, finding the approximate solution at the fastest speed, reducing the search depth, greatly saving the path finding time and improving the speed and efficiency of the network topology path finding.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.

The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.

Claims

1. A network topology path finding method is characterized in that the network topology path finding method comprises the following steps:

filtering interference nodes in the source node topological path and the sink node topological path, and splicing the filtered source node topological path and the filtered sink node topological path to obtain a network topological path;

wherein, the enumerating the source node and the sink node of the network transmission link simultaneously to obtain an enumeration result includes:

simultaneously, enumerating all the connection fibers and network elements of the network transmission link from the host nodes of the network transmission link according to the preset enumeration rule, enumerating all the host nodes adjacent to the host nodes, and obtaining a host node enumeration result, wherein the host node enumeration result comprises the host nodes, the host nodes adjacent to the host nodes, and all the connection fibers and network elements enumerated from the host nodes;

wherein, the constructing a source node topology path and a sink node topology path according to the enumeration result comprises:

2. The method for routing a network topology according to claim 1, wherein the generating a source node topology path by using each fiber and network element in the source node enumeration result as a source end intermediate node and combining the source node and the source neighboring node comprises:

3. The network topology routing method according to claim 2, wherein the estimating and sorting the preset source end open list according to a preset a-algorithm to obtain a minimum estimating node, moving the minimum estimating node into a preset source end closed list, and generating a source node topology path according to the preset source end closed list, comprises:

judging whether a preset host closing list exists or not;

4. The method for routing a network topology according to claim 1, wherein the step of generating a source node topology path by using each fiber and network element in the enumeration result of the sink node as a sink end intermediate node and combining the sink node and the sink neighboring node comprises:

5. The method according to claim 4, wherein the estimating value sorting the preset sink open list according to a preset a-algorithm to obtain a minimum estimating value node, moving the minimum estimating value node into a preset sink closed list, and generating a sink node topology path according to the preset sink closed list, comprises:

judging whether a preset source end closing list exists or not;

when the preset source end closed list exists, all the minimum valuation nodes are spliced to generate a host node topology path;

when the host thread is not finished, judging whether a next traversal thread exists or not;

6. The method for routing according to any one of claims 1 to 5, wherein the filtering the interfering nodes in the source node topology path and the sink node topology path, and splicing the filtered source node topology path and sink node topology path to obtain the network topology path comprises:

7. The network topology path-finding method according to any one of claims 1 to 5, wherein the preset enumeration rule carries a history node path when enumerating nodes, determines a loop node where the history node path is repeated, and terminates enumeration of the loop node.

8. A network topology routing apparatus, the network topology routing apparatus comprising:

the filtering and splicing module is used for filtering interference nodes in the source node topological path and the sink node topological path, splicing the filtered source node topological path and the filtered sink node topological path, and obtaining a network topological path;

the enumeration module is further configured to enumerate, according to a preset enumeration rule, each fiber connection and network element of the network transmission link from a source node of the network transmission link, enumerate source-neighboring nodes of all the source nodes, and obtain a source node enumeration result, where the source node enumeration result includes the source node, the source-neighboring nodes, and each fiber connection and network element enumerated from the source node; simultaneously, enumerating all the connection fibers and network elements of the network transmission link from the host nodes of the network transmission link according to the preset enumeration rule, enumerating all the host nodes adjacent to the host nodes, and obtaining a host node enumeration result, wherein the host node enumeration result comprises the host nodes, the host nodes adjacent to the host nodes, and all the connection fibers and network elements enumerated from the host nodes;

the path building module is further configured to use each fiber connection and network element in the source node enumeration result as a source end intermediate node, and generate a source node topology path by combining the source node and the source adjacent node; and taking each fiber and network element in the enumeration result of the host node as a host end intermediate node, and combining the host node and the host adjacent node to generate a source node topological path.

9. A network topology routing device, the network topology routing device comprising: a memory, a processor, and a network topology routing program stored on the memory and executable on the processor, the network topology routing program configured to implement the steps of the network topology routing method of any of claims 1 to 7.

10. A storage medium having a network topology routing program stored thereon, wherein the network topology routing program, when executed by a processor, implements the steps of the network topology routing method according to any one of claims 1 to 7.