OTN network routing search method, system and storage medium based on graph database

Abstract

The present invention discloses an OTN network route search method, system and storage medium based on a graph database, which uses a starting OTN device node and a terminating OTN device node as user side, access side and core backbone network nodes respectively to search for paths of other core backbone network nodes according to set conditions, and respectively summarizes and forms corresponding route sets, and then performs path screening, group cutting and splicing, and intermediate path search and connection on the paths in the two route sets, so as to obtain a representative route search result set connecting the starting OTN device node and the terminating OTN device node. The present invention can realize OTN network entity relationship mapping route search based on a graph database, effectively reduce the resource consumption of graph database calculation during OTN network route search, and improve the efficiency, accuracy and traversal performance of OTN network route search based on a graph database.

Description

Technical Field

[0001] The present invention belongs to the technical field of database search, and in particular relates to an OTN network routing search method, system and storage medium based on a graph database. Background Art

[0002] Graph databases belong to non-relational databases (NoSQL). Graph databases have very different data storage, query, and data structure from relational databases. The graph data structure directly stores the dependencies between nodes, while relational databases and other types of non-relational databases represent the relationships between data in an indirect way.

[0003] The graph database itself has a lot of underlying algorithms, and the plug-ins derived from it can also improve most of the algorithms and solve most of the user's scenario problems. However, the underlying algorithms in the graph database cannot complete the search of OTN network routes very well, because the OTN network structure is very special. OTN network equipment is divided into three categories: user side, access side, and core backbone network. The user side and access side have simple structures and belong to tree topology structures. Their root nodes are located in the core backbone network, and the core backbone network belongs to mesh topology. Taking the Neo4j graph database as an example, when the number of node hops between two OTN devices is greater than 5, the Neo4j graph database can no longer search for the correct result, because the underlying algorithm of the Neo4j graph database tends to be a breadth-first search. The bidirectional breadth-first algorithm is used in the design to maximize efficiency, and its traversal performance of the depth-first algorithm for networks that may pass through a mesh topology is also poor. Summary of the invention

[0004] The purpose of the present invention is to provide an OTN network routing search method, system and storage medium based on a graph database to solve the above-mentioned problems existing in the prior art.

[0005] In order to achieve the above object, the present invention adopts the following technical solutions:

[0006] In a first aspect, the present invention provides an OTN network routing search method based on a graph database, comprising:

[0007] Obtain the starting OTN device information and the ending OTN device information;

[0008] Determine the node corresponding to the starting OTN device and the node corresponding to the ending OTN device in the graph database according to the starting OTN device information and the ending OTN device information;

[0009] The nodes corresponding to the starting OTN device are respectively used as nodes of the first user side, the first access side and the first core backbone network to search for paths that reach other core backbone network nodes within the range of the set number of nodes as first-type paths, and the first-type paths are aggregated to form a first routing set; the nodes corresponding to the terminating OTN device are respectively used as nodes of the second user side, the second access side and the second core backbone network to search for paths that reach other core backbone network nodes within the range of the set number of nodes as second-type paths, and the second-type paths are aggregated to form a second routing set;

[0010] The first type of paths including the node corresponding to the terminating OTN device in the first routing set are filtered out and aggregated into the result set, and the second type of paths including the node corresponding to the starting OTN device in the second routing set are filtered out and aggregated into the result set;

[0011] The result set is subjected to path deduplication processing, and one identical path is selected to be retained, thereby obtaining a search route set from the starting OTN device node to the ending OTN device node.

[0012] In a possible design, after filtering out the first type of path containing the node corresponding to the terminating OTN device in the first routing set and filtering out the second type of path containing the node corresponding to the starting OTN device in the second routing set, the method further includes:

[0013] Grouping and cutting the remaining first-class paths screened in the first routing set, aggregating the first-class paths retained after grouping and cutting to form a starting routing set, grouping and cutting the remaining second-class paths screened in the second routing set, aggregating the second-class paths retained after grouping and cutting to form a terminating routing set;

[0014] Connecting the first-class paths in the starting routing set and the second-class paths in the ending routing set in opposite directions;

[0015] The path formed by successful splicing is regarded as the third type of path, and the third type of path is summarized into the result set.

[0016] In a possible design, the grouping and cutting of the first type of paths remaining after screening in the first routing set and the grouping and cutting of the second type of paths remaining after screening in the second routing set include:

[0017] The first-category paths remaining in the first routing set are preliminarily grouped according to the starting VP link, and the paths with the same starting VP link are grouped into the same group, so as to obtain the first-level path grouping in the first routing set; the second-category paths remaining in the second routing set are preliminarily grouped according to the starting VP link, and the paths with the same starting VP link are grouped into the same group, so as to obtain the first-level path grouping in the second routing set, wherein the starting VP link is the link between the two starting nodes of the corresponding path;

[0018] On the basis of the primary path grouping in the first routing set, secondary grouping is performed according to the terminating VP link, and the first-type paths with the same terminating VP link in each group of the primary path grouping are grouped into the same group, thereby obtaining the secondary path grouping in the first routing set; on the basis of the secondary path grouping in the second routing set, secondary grouping is performed according to the terminating VP link, and the second-type paths with the same terminating VP link in each group of the secondary path grouping are grouped into the same group, thereby obtaining the secondary path grouping in the second routing set, wherein the terminating VP link is a link between two nodes at the end of the corresponding path;

[0019] On the basis of the secondary path grouping in the first routing set, three groupings are performed according to the path length, and the first-class paths with the same path length in each group of the secondary path grouping are grouped into the same group, thereby obtaining the third-level path grouping in the first routing set; on the basis of the secondary path grouping in the second routing set, three groupings are performed according to the path length, and the second-class paths with the same path length in each group of the secondary path grouping are grouped into the same group, thereby obtaining the third-level path grouping in the second routing set;

[0020] A first-class path is selected from each group of the three-level path grouping in the first routing set to form a starting routing set, and a second-class path is selected from each group of the three-level path grouping in the second routing set to form a terminating routing set.

[0021] In a possible design, the step of splicing the first-type paths in the starting routing set with the second-type paths in the ending routing set in opposite directions includes:

[0022] It is determined whether there are common nodes between each first-type path in the starting routing set and each second-type path in the ending routing set. If there are common nodes, the corresponding first-type paths and second-type paths are spliced ​​through the common nodes.

[0023] In one possible design, the method further includes:

[0024] Extracting the end nodes of each first-type path that has not been successfully spliced ​​in the starting routing set, and the initial nodes of each second-type path that has not been successfully spliced ​​in the ending routing set;

[0025] Substitute each end node and each initial node into the corresponding core backbone network, and find the shortest intermediate path that can be connected between any pair of end nodes and initial nodes;

[0026] The shortest intermediate path is concatenated with the first-type path corresponding to the end node and the second-type path corresponding to the initial node to form a fourth-type path, and the fourth-type path is summarized into the result set.

[0027] In one possible design, the method further includes: sorting each path in the search route set according to the path length and listing them in pages to obtain an arranged search route set.

[0028] In a second aspect, the present invention provides an OTN network routing search system based on a graph database, comprising an acquisition unit, a determination unit, a first search unit, a screening unit and a deduplication unit, wherein:

[0029] An acquisition unit, used for acquiring information of a starting OTN device and information of a terminating OTN device;

[0030] A determination unit, used to determine a node corresponding to the starting OTN device and a node corresponding to the terminating OTN device in a graph database according to the starting OTN device information and the terminating OTN device information;

[0031] The first search unit is used to use the nodes corresponding to the starting OTN device as nodes of the first user side, the first access side and the first core backbone network respectively, to search for paths that reach other core backbone network nodes within the range of a set number of nodes as first-type paths, and to aggregate the first-type paths to form a first routing set; use the nodes corresponding to the terminating OTN device as nodes of the second user side, the second access side and the second core backbone network respectively, to search for paths that reach other core backbone network nodes within the range of a set number of nodes as second-type paths, and to aggregate the second-type paths to form a second routing set;

[0032] A screening unit, configured to screen out the first type of paths including the node corresponding to the terminating OTN device in the first routing set and aggregate them into a result set, and screen out the second type of paths including the node corresponding to the starting OTN device in the second routing set and aggregate them into a result set;

[0033] The deduplication unit is used to perform path deduplication processing on the result set, select and retain the same path, and obtain the search route set from the starting OTN device node to the ending OTN device node.

[0034] In one possible design, the system further includes a cutting unit, a first splicing unit, a summarizing unit, an extracting unit, a second searching unit, a second splicing unit, and an arranging unit, wherein:

[0035] The cutting unit is used to group and cut the remaining first-class paths in the first routing set, aggregate the first-class paths retained after the group cutting to form a starting routing set, and group and cut the remaining second-class paths in the second routing set, aggregate the second-class paths retained after the group cutting to form a terminating routing set;

[0036] A first splicing unit, used for splicing the first-type paths in the starting route set with the second-type paths in the ending route set in opposite directions;

[0037] A summarizing unit, used for taking the path formed by the successful splicing as the third type of path, summarizing the third type of path into a result set, and summarizing the fourth type of path into the result set;

[0038] An extraction unit, used to extract the end nodes of each first-type path that has not been successfully spliced ​​in the starting routing set, and the initial nodes of each second-type path that has not been successfully spliced ​​in the ending routing set;

[0039] The second search unit is used to substitute each end node and each initial node into the corresponding core backbone network to find the shortest intermediate path that can be connected between any pair of end nodes and initial nodes;

[0040] A second concatenation unit is used to concatenate the shortest intermediate path with the first type of path where the corresponding end node is located and the second type of path where the corresponding initial node is located to form a fourth type of path;

[0041] The arrangement unit is used to sort and page the paths in the search route set according to the path length to obtain an arranged search route set.

[0042] In a third aspect, the present invention provides an OTN network routing search system based on a graph database, comprising:

[0043] A memory for storing instructions;

[0044] A processor is used to read the instructions stored in the memory and execute any one of the methods described in the first aspect according to the instructions.

[0045] In a fourth aspect, the present invention provides a computer-readable storage medium, wherein instructions are stored on the computer-readable storage medium, and when the instructions are executed on a computer, the computer is caused to execute any one of the methods described in the first aspect. At the same time, a computer program product containing instructions is also provided, and when the instructions are executed on a computer, the computer is caused to execute any one of the methods described in the first aspect.

[0046] Beneficial effects: The present invention uses the starting OTN device node and the terminating OTN device node as the user side, access side and core backbone network nodes respectively to search for paths of other core backbone network nodes according to set conditions, and respectively summarizes and forms corresponding routing sets, and then performs path screening, group cutting and splicing, and intermediate path search and connection on the paths in the two routing sets to obtain a representative routing search result set connecting the starting OTN device node and the terminating OTN device node. It can realize OTN network entity relationship mapping routing search based on graph database, effectively reduce the resource consumption of graph database calculation during OTN network routing search, and improve the efficiency, accuracy and traversal performance of OTN network routing search based on graph database. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0048] Figure 1 A schematic diagram of the steps of the method in the embodiment of the present invention;

[0049] Figure 2 Schematic diagram of the structure of the first system in an embodiment of the present invention;

[0050] Figure 3 Schematic diagram of the structure of the second system in an embodiment of the present invention. DETAILED DESCRIPTION

[0051] It should be noted that the description of these embodiments is used to help understand the present invention, but does not constitute a limitation of the present invention. The specific structures and functional details disclosed herein are only used to describe the exemplary embodiments of the present invention. However, the present invention can be embodied in many alternative forms, and it should not be understood that the present invention is limited to the embodiments set forth herein.

[0052] It should be understood that the terms first, second, etc. are only used to distinguish descriptions and should not be understood to indicate or imply relative importance. Although the terms first, second, etc. may be used herein to describe various features, these features should not be limited by these terms. For example, a first unit may be referred to as a second unit, and similarly, a second unit may be referred to as a first unit without departing from the scope of the exemplary embodiments of the present invention.

[0053] In the following description, certain details are provided to facilitate a complete understanding of the example embodiments. However, it will be appreciated by those of ordinary skill in the art that the example embodiments may be implemented without these certain details. For example, the system may be shown in a block diagram to avoid obscuring the example with unnecessary details. In other embodiments, well-known processes, structures, and techniques may not be shown in unnecessary detail to avoid obscuring the embodiments.

[0054] Embodiment 1:

[0055] This embodiment provides an OTN network routing search method based on a graph database, such as Figure 1 As shown, the following steps are included:

[0056] S1. Obtain the starting OTN device information and the ending OTN device information.

[0057] S2. Determine the node corresponding to the starting OTN device and the node corresponding to the ending OTN device in the graph database according to the starting OTN device information and the ending OTN device information.

[0058] In specific implementation, the node corresponding to the starting OTN device and the node corresponding to the ending OTN device can be determined in the Neo4j graph database according to the obtained starting OTN device information and ending OTN device information. When starting to search for OTN network routes in the Neo4j graph database, the starting OTN device node and the ending OTN device node are required as input parameters.

[0059] S3. The nodes corresponding to the starting OTN device are respectively used as nodes of the first user side, the first access side and the first core backbone network to search for paths that reach other core backbone network nodes within the range of a set number of nodes as first-type paths, and the first-type paths are aggregated to form a first routing set; the nodes corresponding to the terminating OTN device are respectively used as nodes of the second user side, the second access side and the second core backbone network to search for paths that reach other core backbone network nodes within the range of a set number of nodes as second-type paths, and the second-type paths are aggregated to form a second routing set.

[0060] In the specific implementation, in order to improve the traversal performance of the OTN network route search of the graph database, it is necessary to use the starting OTN device node and the ending OTN device node as nodes of the user side, access side and corresponding core backbone network respectively to perform route search with set conditions. Taking the starting OTN device node as an example, when the starting OTN device node is used as the first user side node, all paths that can reach other core backbone network nodes within the range of 3 to 5 nodes are searched; when the starting OTN device node is used as the first access side node, all paths that can reach other core backbone network nodes within the range of 1 to 2 nodes are searched; when the starting OTN device node is used as the first core backbone network node, all paths that can reach other core backbone network nodes after passing 1 node are searched; all paths searched in the three cases are classified as first-class paths.

[0061] S41. Filter out the first type of paths containing the nodes corresponding to the terminating OTN device in the first routing set and aggregate them into a result set, and filter out the second type of paths containing the nodes corresponding to the starting OTN device in the second routing set and aggregate them into a result set.

[0062] In specific implementation, if some first-class paths in the first routing set contain nodes corresponding to the terminating OTN device, it indicates that these first-class paths are already complete paths connecting the starting OTN device node and the terminating OTN device node, and these first-class paths can be screened out and summarized into the result set. Similarly, if some second-class paths in the second routing set contain nodes corresponding to the starting OTN device, it indicates that these second-class paths are already complete paths connecting the starting OTN device node and the terminating OTN device node, and these second-class paths can be screened out and summarized into the result set.

[0063] S421. Group and trim the remaining first-class paths in the first routing set, aggregate the first-class paths retained after grouping and trimming to form a starting routing set, and group and trim the remaining second-class paths in the second routing set, aggregate the second-class paths retained after grouping and trimming to form a terminating routing set.

[0064] In a specific implementation, the process of grouping and cutting the remaining first-class paths screened in the first routing set and grouping and cutting the remaining second-class paths screened in the second routing set includes:

[0065] First, the remaining first-category paths in the first routing set are preliminarily grouped according to the starting VP link, and the paths with the same starting VP link are grouped into the same group, thereby obtaining the first-level path grouping in the first routing set; the remaining second-category paths in the second routing set are preliminarily grouped according to the starting VP link, and the paths with the same starting VP link are grouped into the same group, thereby obtaining the first-level path grouping in the second routing set, wherein the starting VP link is the link between the two starting nodes of the corresponding path;

[0066] Secondly, based on the primary path grouping in the first routing set, secondary grouping is performed according to the terminating VP link, and the first-type paths with the same terminating VP link in each group of the primary path grouping are grouped into the same group, thereby obtaining the secondary path grouping in the first routing set; based on the secondary path grouping in the second routing set, secondary grouping is performed according to the terminating VP link, and the second-type paths with the same terminating VP link in each group of the secondary path grouping are grouped into the same group, thereby obtaining the secondary path grouping in the second routing set, wherein the terminating VP link is a link between two nodes at the end of the corresponding path;

[0067] Then, on the basis of the secondary path grouping in the first routing set, three groupings are performed according to the path length, and the first-class paths with the same path length in each group of the secondary path grouping are grouped into the same group, thereby obtaining the third-level path grouping in the first routing set; on the basis of the secondary path grouping in the second routing set, three groupings are performed according to the path length, and the second-class paths with the same path length in each group of the secondary path grouping are grouped into the same group, thereby obtaining the third-level path grouping in the second routing set;

[0068] Finally, a first-class path is selected from each group of the three-level path grouping in the first routing set to form a starting routing set, and a second-class path is selected from each group of the three-level path grouping in the second routing set to form a terminating routing set.

[0069] Through such a tree-like hierarchical method, group pruning is performed at the last level, so that each last level group can be simplified, and redundant paths of the same type can be eliminated, leaving only a representative first-class path or second-class path. This ensures high traversal performance of route search while saving resources occupied by database calculation and improving route search efficiency.

[0070] S422. Connect the first-type paths in the starting route set and the second-type paths in the ending route set in opposite directions.

[0071] In a specific implementation, the process of splicing the first-class paths in the starting routing set with the second-class paths in the terminating routing set in opposite directions includes: determining whether there are the same nodes between the first-class paths in the starting routing set and the second-class paths in the terminating routing set; if there are the same nodes, splicing the corresponding first-class paths and the second-class paths through the same nodes.

[0072] S423. The path formed by the successful splicing is used as the third type of path, and the third type of path is summarized into the result set.

[0073] S424. Extract the end nodes of each first-type path that has not been successfully spliced ​​in the starting routing set, and the initial nodes of each second-type path that has not been successfully spliced ​​in the ending routing set.

[0074] In specific implementation, if there are unsuccessfully spliced ​​first-type paths in the starting routing set and unsuccessfully spliced ​​second-type paths in the terminating routing set, the end nodes of the unsuccessfully spliced ​​first-type paths in the starting routing set and the initial nodes of the unsuccessfully spliced ​​second-type paths in the terminating routing set can be extracted, and the end nodes and initial nodes can be used to perform intermediate route search and matching, so as to splice as many complete paths connecting the starting OTN device node and the terminating OTN device node as possible.

[0075] S425. Substitute each end node and each initial node into the corresponding core backbone network, and find the shortest intermediate path that can be connected between any pair of end nodes and initial nodes.

[0076] In specific implementation, each end node and each initial node can be substituted into the corresponding core backbone network, and the underlying algorithm of the graph database itself can be used to search for any pair of connectable intermediate paths between the end nodes and the initial nodes, and the shortest intermediate path can be selected.

[0077] S426. Concatenate the shortest intermediate path with the first-type path corresponding to the end node and the second-type path corresponding to the initial node to form a fourth-type path, and aggregate the fourth-type path into the result set.

[0078] In the specific implementation, after obtaining the shortest intermediate path between the corresponding end node and the initial node, the shortest intermediate path is concatenated with the first type of path where the corresponding end node is located and the second type of path where the corresponding initial node is located to form a fourth type of path, and then the fourth type of path is summarized into the result set.

[0079] S5. Perform path deduplication processing on the result set, select and retain the same path, and obtain the search route set from the starting OTN device node to the ending OTN device node.

[0080] In specific implementation, after obtaining a result set including all first-class paths, second-class paths, third-class paths and fourth-class paths connecting the starting OTN device node and the terminating OTN device node, the result set is subjected to path deduplication processing to remove redundant paths that repeat each other, select one of the same paths to retain, and obtain a search route set from the starting OTN device node to the terminating OTN device node.

[0081] S6. Sort each path in the search route set by path length and list them in pages to obtain an arranged search route set.

[0082] In specific implementation, the search route set can be arranged accordingly, and each path in the search route set can be sorted and listed in pages according to the path length to obtain an arranged search route set, so that the final search route set is easy to compare and select intuitively.

[0083] Embodiment 2:

[0084] This embodiment provides an OTN network routing search system based on a graph database. Figure 2 As shown, it includes an acquisition unit, a determination unit, a first search unit, a screening unit and a deduplication unit, wherein:

[0085] An acquisition unit, used for acquiring information of a starting OTN device and information of a terminating OTN device;

[0086] A determination unit, used to determine a node corresponding to the starting OTN device and a node corresponding to the terminating OTN device in a graph database according to the starting OTN device information and the terminating OTN device information;

[0087] The first search unit is used to use the nodes corresponding to the starting OTN device as nodes of the first user side, the first access side and the first core backbone network respectively, to search for paths that reach other core backbone network nodes within the range of a set number of nodes as first-type paths, and to aggregate the first-type paths to form a first routing set; use the nodes corresponding to the terminating OTN device as nodes of the second user side, the second access side and the second core backbone network respectively, to search for paths that reach other core backbone network nodes within the range of a set number of nodes as second-type paths, and to aggregate the second-type paths to form a second routing set;

[0088] A screening unit, configured to screen out the first type of paths including the node corresponding to the terminating OTN device in the first routing set and aggregate them into a result set, and screen out the second type of paths including the node corresponding to the starting OTN device in the second routing set and aggregate them into a result set;

[0089] The deduplication unit is used to perform path deduplication processing on the result set, select and retain the same path, and obtain the search route set from the starting OTN device node to the ending OTN device node.

[0090] Furthermore, the system further comprises a cutting unit, a first splicing unit, a summarizing unit, an extracting unit, a second searching unit, a second splicing unit and an arranging unit, wherein:

[0091] The cutting unit is used to group and cut the remaining first-class paths in the first routing set, aggregate the first-class paths retained after the group cutting to form a starting routing set, and group and cut the remaining second-class paths in the second routing set, aggregate the second-class paths retained after the group cutting to form a terminating routing set;

[0092] A first splicing unit, used for splicing the first-type paths in the starting route set with the second-type paths in the ending route set in opposite directions;

[0093] A summarizing unit, used for taking the path formed by the successful splicing as the third type of path, summarizing the third type of path into a result set, and summarizing the fourth type of path into the result set;

[0094] An extraction unit, used to extract the end nodes of each first-type path that has not been successfully spliced ​​in the starting routing set, and the initial nodes of each second-type path that has not been successfully spliced ​​in the ending routing set;

[0095] The second search unit is used to substitute each end node and each initial node into the corresponding core backbone network to find the shortest intermediate path that can be connected between any pair of end nodes and initial nodes;

[0096] A second concatenation unit is used to concatenate the shortest intermediate path with the first type of path where the corresponding end node is located and the second type of path where the corresponding initial node is located to form a fourth type of path;

[0097] The arrangement unit is used to sort and page the paths in the search route set according to the path length to obtain an arranged search route set.

[0098] Embodiment 3:

[0099] This embodiment provides another OTN network routing search system based on a graph database, such as Figure 3 As shown, at the hardware level, it includes:

[0100] Data interface, used to establish data connection between the processor and corresponding external devices;

[0101] A memory for storing instructions;

[0102] The processor is used to read the instructions stored in the memory and execute the OTN network routing search method based on the graph database in Example 1 according to the instructions.

[0103] Optionally, the device further includes an internal bus. The processor, the memory and the display may be interconnected via the internal bus, which may be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc.

[0104] The memory may include, but is not limited to, random access memory (RAM), read only memory (ROM), flash memory, first input first output (FIFO) and / or first in last out (FILO), etc. The processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0105] Embodiment 4:

[0106] This embodiment provides a computer-readable storage medium, on which instructions are stored. When the instructions are executed on a computer, the computer executes the OTN network route search method based on the graph database in Embodiment 1. The computer-readable storage medium refers to a carrier for storing data, which may include but is not limited to a floppy disk, an optical disk, a hard disk, a flash memory, a USB flash drive, and / or a memory stick, etc. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable systems. This embodiment also provides a computer program product containing instructions. When the instructions are executed on a computer, the computer executes the OTN network route search method based on the graph database in Embodiment 1. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable systems.

[0107] Finally, it should be noted that the above description is only a preferred embodiment of the present invention and is not intended to limit the protection scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. An OTN network routing search method based on a graph database, characterized in that: include: Obtain the starting OTN device information and the ending OTN device information; Determine the node corresponding to the starting OTN device and the node corresponding to the ending OTN device in the graph database according to the starting OTN device information and the ending OTN device information; The nodes corresponding to the starting OTN device are respectively used as nodes of the first user side, the first access side and the first core backbone network to search for paths that reach other core backbone network nodes within the range of the set number of nodes as first-type paths, and the first-type paths are aggregated to form a first routing set; the nodes corresponding to the terminating OTN device are respectively used as nodes of the second user side, the second access side and the second core backbone network to search for paths that reach other core backbone network nodes within the range of the set number of nodes as second-type paths, and the second-type paths are aggregated to form a second routing set; The first type of paths including the node corresponding to the terminating OTN device in the first routing set are filtered out and aggregated into the result set, and the second type of paths including the node corresponding to the starting OTN device in the second routing set are filtered out and aggregated into the result set; The first-class paths remaining after screening in the first routing set are grouped and cut, and the first-class paths retained after grouping and cutting are aggregated to form a starting routing set; the second-class paths remaining after screening in the second routing set are grouped and cut, and the second-class paths retained after grouping and cutting are aggregated to form a terminating routing set; the first-class paths in the starting routing set and the second-class paths in the terminating routing set are spliced ​​in opposite directions; The path formed by successful splicing is regarded as the third type of path, and the third type of path is summarized into the result set; The result set is subjected to path deduplication processing, and one identical path is selected to be retained, thereby obtaining a search route set from the starting OTN device node to the ending OTN device node.

2. The OTN network routing search method based on graph database according to claim 1 is characterized in that: The method of grouping and cutting the remaining first-category paths in the first routing set and grouping and cutting the remaining second-category paths in the second routing set includes: The first-category paths remaining in the first routing set are preliminarily grouped according to the starting VP link, and the paths with the same starting VP link are grouped into the same group, so as to obtain the first-level path grouping in the first routing set; the second-category paths remaining in the second routing set are preliminarily grouped according to the starting VP link, and the paths with the same starting VP link are grouped into the same group, so as to obtain the first-level path grouping in the second routing set, wherein the starting VP link is the link between the two starting nodes of the corresponding path; On the basis of the primary path grouping in the first routing set, secondary grouping is performed according to the terminating VP link, and the first-type paths with the same terminating VP link in each group of the primary path grouping are grouped into the same group, thereby obtaining the secondary path grouping in the first routing set; on the basis of the secondary path grouping in the second routing set, secondary grouping is performed according to the terminating VP link, and the second-type paths with the same terminating VP link in each group of the secondary path grouping are grouped into the same group, thereby obtaining the secondary path grouping in the second routing set, wherein the terminating VP link is a link between two nodes at the end of the corresponding path; On the basis of the secondary path grouping in the first routing set, three groupings are performed according to the path length, and the first-class paths with the same path length in each group of the secondary path grouping are grouped into the same group, thereby obtaining the third-level path grouping in the first routing set; on the basis of the secondary path grouping in the second routing set, three groupings are performed according to the path length, and the second-class paths with the same path length in each group of the secondary path grouping are grouped into the same group, thereby obtaining the third-level path grouping in the second routing set; A first-class path is selected from each group of the three-level path grouping in the first routing set to form a starting routing set, and a second-class path is selected from each group of the three-level path grouping in the second routing set to form a terminating routing set.

3. The OTN network routing search method based on graph database according to claim 1 is characterized in that: The step of splicing the first-type paths in the starting route set with the second-type paths in the ending route set in opposite directions comprises: It is determined whether there are common nodes between each first-type path in the starting routing set and each second-type path in the ending routing set. If there are common nodes, the corresponding first-type paths and second-type paths are spliced ​​through the common nodes.

4. The OTN network routing search method based on graph database according to claim 1, characterized in that: The method further comprises: Extracting the end nodes of each first-type path that has not been successfully spliced ​​in the starting routing set, and the initial nodes of each second-type path that has not been successfully spliced ​​in the ending routing set; Substitute each end node and each initial node into the corresponding core backbone network, and find the shortest intermediate path that can be connected between any pair of end nodes and initial nodes; The shortest intermediate path is concatenated with the first-type path corresponding to the end node and the second-type path corresponding to the initial node to form a fourth-type path, and the fourth-type path is summarized into the result set.

5. The OTN network routing search method based on graph database according to claim 4 is characterized in that: The method further includes: sorting and paging each path in the search route set according to the path length to obtain an arranged search route set.

6. An OTN network routing search system based on a graph database is characterized by: It includes an acquisition unit, a determination unit, a first search unit, a screening unit and a deduplication unit, wherein: An acquisition unit, used for acquiring information of a starting OTN device and information of a terminating OTN device; A determination unit, used to determine a node corresponding to the starting OTN device and a node corresponding to the terminating OTN device in a graph database according to the starting OTN device information and the terminating OTN device information; The first search unit is used to use the nodes corresponding to the starting OTN device as nodes of the first user side, the first access side and the first core backbone network respectively, to search for paths that reach other core backbone network nodes within the range of a set number of nodes as first-type paths, and to aggregate the first-type paths to form a first routing set; use the nodes corresponding to the terminating OTN device as nodes of the second user side, the second access side and the second core backbone network respectively, to search for paths that reach other core backbone network nodes within the range of a set number of nodes as second-type paths, and to aggregate the second-type paths to form a second routing set; The screening unit is used to screen out the first-class paths containing the nodes corresponding to the terminating OTN device in the first routing set and aggregate them into the result set, and screen out the second-class paths containing the nodes corresponding to the starting OTN device in the second routing set and aggregate them into the result set; group and clip the first-class paths remaining after screening in the first routing set, aggregate the first-class paths retained after grouping and clipping to form a starting routing set, group and clip the second-class paths remaining after screening in the second routing set, aggregate the second-class paths retained after grouping and clipping to form a terminating routing set; splice the first-class paths in the starting routing set with the second-class paths in the terminating routing set in opposite directions; use the paths formed by the successful splicing as the third-class paths, and aggregate the third-class paths into the result set; The deduplication unit is used to perform path deduplication processing on the result set, select and retain the same path, and obtain the search route set from the starting OTN device node to the ending OTN device node.

7. The OTN network routing search system based on graph database according to claim 6, characterized in that: The system further comprises a cutting unit, a first splicing unit, a summarizing unit, an extracting unit, a second searching unit, a second splicing unit and an arranging unit, wherein: The cutting unit is used to group and cut the remaining first-class paths in the first routing set, aggregate the first-class paths retained after the group cutting to form a starting routing set, and group and cut the remaining second-class paths in the second routing set, aggregate the second-class paths retained after the group cutting to form a terminating routing set; A first splicing unit, used for splicing the first-type paths in the starting route set with the second-type paths in the ending route set in opposite directions; A summarizing unit, used for taking the path formed by the successful splicing as the third type of path, summarizing the third type of path into a result set, and summarizing the fourth type of path into the result set; An extraction unit, used to extract the end nodes of each first-type path that has not been successfully spliced ​​in the starting routing set, and the initial nodes of each second-type path that has not been successfully spliced ​​in the ending routing set; The second search unit is used to substitute each end node and each initial node into the corresponding core backbone network to find the shortest intermediate path that can be connected between any pair of end nodes and initial nodes; A second concatenation unit is used to concatenate the shortest intermediate path with the first type of path where the corresponding end node is located and the second type of path where the corresponding initial node is located to form a fourth type of path; The arrangement unit is used to sort and page the paths in the search route set according to the path length to obtain an arranged search route set.

8. An OTN network routing search system based on a graph database is characterized by: include: A memory for storing instructions; A processor, configured to read the instructions stored in the memory and execute the method according to any one of claims 1 to 5 according to the instructions.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores instructions, and when the instructions are executed on a computer, the computer is enabled to execute the method according to any one of claims 1 to 5.

Images