Hierarchical routing data auditing method and device

Abstract

The embodiment of the application provides a layered route data auditing method and device, the method constructs a directed graph according to the port directed connection relationship in route data, uses a graph theory connected component to judge the connectivity of the route and the integrity on a topological structure, when the through route passes the connectivity test, the auditing result is normal, then different integrity auditing rules are selected according to the service scene characteristics, route loss judgment is carried out, whether the through route is complete on the service networking structure is judged, the auditing rules of the connected component and data dimension are checked by using a graph algorithm, the connectivity and the integrity of the through route are quickly and accurately detected. In the checking process, the segment group sequence attribute in the route data is not relied on, and the checking cannot be carried out due to the shallow data quality.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of data processing, in particular to a layered routing data auditing method and device. BACKGROUND

[0002] The current OMC manufacturer reported channel layered routing data is not completely reliable, generally there will be one or several of the following problems:

[0003] 1. The standby path is often not a complete path.

[0004] 2. The group number is not related to the topology arrangement.

[0005] 3. The direction may be incorrect.

[0006] 4. The route may not be complete.

[0007] The above problems will affect the accuracy and completeness of the channel concatenation and the application based on the routing analysis, such as the judgment result of the cutting interface conflict, the alarm positioning, etc.

[0008] In order to ensure the accuracy and completeness of the channel concatenation and the accuracy of the application result based on the routing analysis, the channel routing data must be audited before the channel concatenation and application analysis, in order to prevent the missing data or redundant data from causing adverse effects on the channel concatenation restoration effect. After completing the audit, a comprehensive audit report needs to be generated and timely feedback to the OMC manufacturer, so as to promote the data rectification and optimization work of both parties, and thus improve the data quality.

[0009] The channel routing data verification is the core of verifying two key dimensions: one is the actual connectivity of the route, that is, whether the source end to the sink end can be concatenated according to the routing data; the other is the completeness of the routing structure, including whether the port, cross, topology, primary and backup protection and other structures are complete.

[0010] Two ways of checking the channel routing in the prior art:

[0011] 1. Based on the segment group sequence field order of the original reported routing segment data, the channel routing is audited, but the network management data has the problems of missing and inaccurate order, resulting in inaccurate auditing results analyzed.

[0012] 2. The AZ port of the routing segment is taken as a key-value pair, which can quickly detect whether the source end and the sink end are connected, but it is highly dependent on the accuracy of the routing segment direction, and cannot handle loops.

[0013] The above methods can only detect the routing connectivity, and cannot find redundant branch nodes, nor can they further classify the problems. SUMMARY

[0014] In view of the problems in the prior art, the application provides a layered routing data auditing method and device, which can quickly and accurately detect the connectivity and integrity of a routing path, and does not rely on segment group sequence attributes in routing data in the verification process, thereby avoiding that data quality at a shallow level causes the verification to fail.

[0015] To solve at least one of the above problems, the application provides the following technical solutions:

[0016] In a first aspect, the application provides a layered routing data auditing method, characterized in that the method comprises:

[0017] Synchronizing port data and channel data in a network to a graph database according to node types, and establishing a connection relationship between ports and a bearing relationship between channels;

[0018] Obtaining layered routing data of each channel from the graph database, and constructing an adjacency list according to the layered routing data; starting from any node in the adjacency list, traversing all reachable nodes and marking them as the same connected component by using a graph search algorithm; if the number of connected components of the layered routing data is 1 and there is a routing path between any two nodes, it is determined that the connectivity of the layered routing is normal;

[0019] When the connectivity of the layered routing is normal, the integrity of the layered routing is audited based on business characteristics to check whether the routing meets the requirements of a business scenario; the auditing method of the routing integrity is as follows: selecting an auditing rule according to the characteristics of a network management scenario and a channel level, and performing routing loss detection based on a pure data dimension; if the detection result is that there is no routing loss, it is determined that the layered routing has integrity;

[0020] Recording abnormal result data of the auditing of the layered routing of each channel in the graph database, and outputting the auditing result of the layered routing of each channel.

[0021] Further, the step of establishing a connection relationship between ports and a bearing relationship between channels comprises:

[0022] According to the layered routing data of the network, a directed connection relationship between ports is established, and attributes of the layered routing data are assigned to the connection relationship, so as to be incrementally synchronized to the graph database in the form of a relationship type;

[0023] According to the layered routing data of the network, a directed bearing relationship between channels is established, so as to be incrementally synchronized to the graph database in the form of a relationship type.

[0024] Further, before the step of constructing an adjacency list according to the layered routing data, the method further comprises:

[0025] Judging the layered routing data to be empty;

[0026] If null, return the audit result of the hierarchical routing data being null, and the audit operation of the hierarchical routing data is completed;

[0027] If not null, continue to perform the audit operation of the hierarchical routing connectivity.

[0028] Further, the step of constructing the adjacency list according to the hierarchical routing data further comprises initializing the hierarchical routing data of each channel; the method of initializing the hierarchical routing data of each channel comprises:

[0029] merging multiple ports in the source end port group into one port, and merging multiple ports in the sink end port group into one port;

[0030] removing the cascaded cross;

[0031] in the case that removing the PTG does not cause the shortest distance between each point in the graph and the source and sink points to change, removing the PTG protection structure according to the scene.

[0032] Further, the step of traversing all reachable nodes from any node in the adjacency list and marking them as the same connected component by the graph search algorithm comprises:

[0033] setting a mark for each node to indicate whether it has been visited;

[0034] starting DFS traversal from any unvisited node in the graph; each time a node is visited, recursively visit the adjacent nodes of the node and mark them as visited;

[0035] when a new DFS is started from an unvisited node, mark all nodes that can be reached from the starting node by the traversal of DFS, and regard them as the same connected component;

[0036] for any two nodes, if they belong to the same connected component, it indicates that there is a path between the two nodes, that is, they are connected; otherwise, it indicates that they are not in the same connected component and are not connected.

[0037] Further, the step of traversing all reachable nodes from any node in the adjacency list and marking them as the same connected component by the graph search algorithm comprises:

[0038] setting each node to an unvisited state;

[0039] starting from any unvisited node, using a queue to manage the nodes to be visited, and putting the source node into the queue;

[0040] Accessing the nodes adjacent to the current node in the order of the nodes in the queue one by one, and adding the nodes into the queue;

[0041] If the queue is empty at the beginning of each BFS traversal, it means that a new connected component is found;

[0042] For any two nodes, if they are in the same connected component, it means that there is a path between the two nodes, and they are connected; otherwise, they are not connected.

[0043] Further, the step of auditing the integrity of the hierarchical routing based on the service characteristics and checking whether the routing meets the requirements of the service scenario comprises:

[0044] For a two-source and two-destination channel, detecting whether the forward and reverse paths are separated;

[0045] For an ODU, VC level, and specific network management channel, detecting whether all routing segments have forward and reverse paths;

[0046] For an ODU, VC level, and specific network management channel, detecting whether all routing segments have primary and backup paths;

[0047] For a channel with cascading cross routing, detecting whether all cascading cross routing segments have forward and reverse paths.

[0048] In a second aspect, the application provides a hierarchical routing data auditing device, comprising:

[0049] A data transfer module is configured to synchronize port data and channel data in a network to a graph database according to node types, and establish connection relationships between ports and ports, and bearing relationships between channels and channels;

[0050] A first detection module is configured to obtain hierarchical routing data of each channel from the graph database, and construct an adjacency list according to the hierarchical routing data; through a graph search algorithm, starting from any node in the adjacency list, all reachable nodes are traversed and marked as the same connected component; if the number of connected components of the hierarchical routing data is 1, and there is a routing path between any two nodes, it is determined that the connectivity of the hierarchical routing is normal;

[0051] A second detection module is configured to, when the connectivity of the hierarchical routing is normal, audit the integrity of the hierarchical routing based on the service characteristics, and check whether the routing meets the requirements of the service scenario; the auditing method of the routing integrity is: selecting an auditing rule according to the characteristics of the network management scenario and the channel level, and performing routing loss detection based on pure data dimensions; if the detection result is that there is no routing loss, it is determined that the hierarchical routing has integrity;

[0052] A result output module is configured to input the audit exception result data of the hierarchical routing of each channel into a graph database and output the audit result of the hierarchical routing of each channel.

[0053] In a third aspect, the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the hierarchical routing data auditing method when executing the program.

[0054] In a fourth aspect, the present application provides a computer readable storage medium, which stores a computer program, wherein the computer program is executable on a processor to implement the steps of the hierarchical routing data auditing method.

[0055] In a fifth aspect, the present application provides a computer program product, comprising a computer program / instruction, wherein the computer program / instruction is executable on a processor to implement the steps of the hierarchical routing data auditing method.

[0056] According to the above technical solution, the present application provides a hierarchical routing data auditing method and device, which constructs a directed graph according to the directed connection relationship of the port in the routing data, uses a graph theory connected component to judge the connectivity of the routing and the integrity on the topological structure, and when the routing is passed in the connectivity test, the audit result is normal, and then different integrity auditing rules are selected in combination with the service scenario characteristics to perform routing loss judgment, to judge whether the routing is complete on the service networking structure, and the graph algorithm is used to divide the connected component and the data dimension auditing rule is checked, so that the connectivity and integrity of the routing are quickly and accurately detected. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the data quality in the shallow layer is avoided to cause the checking to be unable to be performed. BRIEF DESCRIPTION OF DRAWINGS

[0057] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or prior art description. Obviously, the drawings in the following description are some embodiments of the present application, and those skilled in the art can also obtain other drawings according to these drawings without any creative labor.

[0058] Figure 1 FIG. 1 is a flowchart of the hierarchical routing data auditing method in the embodiments of the present application;

[0059] Figure 2 FIG. 2 is another flowchart of the hierarchical routing data auditing method in the embodiments of the present application;

[0060] Figure 3 FIG. 3 is a data synchronization diagram of the hierarchical routing data auditing method in the embodiments of the present application;

[0061] Figure 4 A single-channel hierarchical routing data auditing sub-process processing flowchart of the hierarchical routing data auditing method in the embodiments of the present application;

[0062] Figure 5 A port merging operation diagram in the data initialization processing of the hierarchical routing data auditing method in the embodiments of the present application (legend: 1, a circle represents a port, and the number in the circle is used to distinguish different ports. Blue ports represent source and sink ports. Port 0 and port 1 are source ports. Port 10 is a sink port. 2, a rounded rectangle represents a network element. 3, the color of a line segment: blue represents the main use, and green represents the backup);

[0063] Figure 6 A remove cascaded cross operation diagram in the data initialization processing of the hierarchical routing data auditing method in the embodiments of the present application;

[0064] Figure 7 A remove PTG protection structure operation diagram in the data initialization processing of the hierarchical routing data auditing method in the embodiments of the present application (the ptg between port 8 and port 9 in the figure is not removed because removing it will affect the connectivity of the figure (the shortest example between port 9 and sink port 10 changes));

[0065] Figure 8 A routing diagram example with normal connectivity in the routing connectivity checking of the hierarchical routing data auditing method in the embodiments of the present application;

[0066] Figure 9 A routing diagram example with a breakpoint in the routing connectivity checking of the hierarchical routing data auditing method in the embodiments of the present application (endpoint 11 is a breakpoint);

[0067] Figure 10 A routing diagram example with a breakpoint in the routing connectivity checking of the hierarchical routing data auditing method in the embodiments of the present application (the breakpoint is between endpoint 5 and endpoint 7);

[0068] Figure 11 A routing diagram example with a cut in the routing connectivity checking of the hierarchical routing data auditing method in the embodiments of the present application (legend: 1, the part enclosed by the red box is connected component 1. 2, the part enclosed by the blue box is connected component 2. 3, the number of connected components of the routing diagram is 2.);

[0069] Figure 12For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph in the presence of a free point in the routing connectivity check (legend: 1, the part enclosed by the red frame is connected component 1. 2, the part enclosed by the blue frame is connected component 2 and connected component 3. 3, the number of connected components of the routing graph is 3. The number of points in connected components 2 and 3 is 1 each.).

[0070] Figure 13 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph in the two-source two-destination routing integrity check (legend: 1, source 1 is port 1 and destination 1 is port 10. 2, source 2 is port 0 and destination 2 is port 11.).

[0071] Figure 14 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph that meets auditing rule 2 in the routing integrity check (legend: 1, the blue line segment is the primary. 2, the green line segment is the backup.).

[0072] Figure 15 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph that meets auditing rule 3 in the routing integrity check (legend: 1, the blue line segment is the primary. 2, the green line segment is the backup.).

[0073] Figure 16 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph that meets auditing rule 4 in the routing integrity check (legend: 1, the blue line segment is the primary. 2, the green line segment is the backup. 3, the orange line segment is the cascaded cross.).

[0074] Figure 17 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph that meets auditing rule 4 in the routing integrity check (legend: 1, the blue line segment is the primary. 2, the green line segment is the backup. 3, the orange line segment is the cascaded cross.).

[0075] Figure 18 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph that meets auditing rule 4 in the routing integrity check (legend: 1, the blue line segment is the primary. 2, the green line segment is the backup. 3, the orange line segment is the cascaded cross.).

[0076] Figure 19 For the layered routing data auditing method in the embodiment of the present application, the following is an example of a routing graph that meets auditing rule 4 in the routing integrity check (legend: 1, the blue line segment is the primary. 2, the green line segment is the backup. 3, the orange line segment is the cascaded cross.).

[0077] Reference Signs:

[0078] Electronic device 9600, central processor 9100, memory 9140, communication module 9110, input unit 9120, audio processor 9130, display 9160, power supply 9170, buffer memory 9141, application / function storage section 9142, data storage section 9143, driver program storage section 9144, antenna 9111, speaker 9131, microphone 9132. DETAILED DESCRIPTION

[0079] To make the purposes, technical solutions, and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some but not all of the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present application.

[0080] The acquisition, storage, use, processing, and the like of data in the technical solutions of the present application all comply with relevant provisions of national laws and regulations.

[0081] Terminology explanation:

[0082] Channel: refers to a service line. It is a path for transmitting information.

[0083] Channel route: usually refers to a single-layer route of a certain layer channel, is composed of multiple route segments, and is a specific route for information transmission. The key attributes of route segment data are: A-end network element ID, A-end port ID, Z-end network element ID, Z-end port ID, segment number, group number, sequence number, master / standby identifier (master, standby), direction (forward, reverse), whether bidirectional (unidirectional, bidirectional), route segment type (cross, topology, cascaded cross, PTG), and sub-channel ID.

[0084] Channel level:

[0085] Customer information layer: carries actual user services, such as Ethernet, IP, and the like.

[0086] Virtual container (VC) layer: including VC-12, VC-3, VC-4, and the like, used for adapting and multiplexing customer signals.

[0087] Optical channel data unit (ODUk): such as ODUk (k = 0, 1, 2, 3, 4), used for encapsulating and processing service signals of different rates and formats, and providing functions such as multiplexing, cross-connection, and protection.

[0088] Regeneration section (RS): responsible for regenerating and amplifying optical signals between two regenerative repeaters.

[0089] Multiplexing section (MS): used for processing related functions of multiple channels multiplexed together, such as monitoring and maintenance.

[0090] Optical channel layer (OCH): directly carries customer service signals and is a transparent transmission channel in an optical network.

[0091] Optical multiplexing section layer (OMS): responsible for multiplexing and transmitting multiple optical channels.

[0092] Optical Transport Section (OTS): Mainly deals with the transmission of optical signals over physical media such as optical fibers.

[0093] Adjacency List: Adjacency list is an efficient way to represent graph structure, especially suitable for representing sparse graphs. It describes the connection relationship of the graph by maintaining a list of adjacent nodes for each node.

[0094] Connected Component: Connected component is a basic concept in graph theory, used to describe the connection characteristics of the graph. Connected component refers to the maximum subgraph in which there is a path between any two nodes in the graph.

[0095] PTG Protection: PTG protection is a path tracking protection mechanism in optical transport networks, mainly used to ensure end-to-end monitorability and fast protection switching of service paths.

[0096] Cascade Cross: Cascade cross is a cross connection of ordinary cross or VC12 routing segment in this specific layout.

[0097] In view of the problems in the prior art, the present application provides a layered routing data auditing method and device. The method constructs a directed graph according to the port directed connection relationship in the routing data, uses graph theory connected components to judge the connectivity of the routing and the integrity on the topology structure, when the through routing passes the connectivity test, the auditing result is normal, then combined with the service scene characteristics, different integrity auditing rules are selected to judge the routing loss, judge whether the through routing is complete on the service networking structure, use graph algorithm to divide the connected components and the data dimension auditing rules to check, quickly and accurately detect the connectivity and integrity of the through routing. In the checking process, it does not depend on the segment group sequence attribute in the routing data, avoiding the shallow data quality leading to the failure of the checking.

[0098] In order to quickly and accurately detect the connectivity and integrity of the through routing, and in the checking process, it does not depend on the segment group sequence attribute in the routing data, avoiding the shallow data quality leading to the failure of the checking, the present application provides an embodiment of a layered routing data auditing method. Specifically, referring to Figure 1 and Figure 2 , the layered routing data auditing method comprises the following contents:

[0099] Step S101: Synchronize the port data and channel data in the network to the graph database with node type, and establish the connection relationship between the ports and the connection relationship between the channels.

[0100] Referring to Figure 3 , in this embodiment, the specific steps of synchronizing data to the database include:

[0101] 1. Record the port data in the network into the graph database in node type, incremental synchronization.

[0102] 2. Record the channel data in the network into the graph database in node type, incremental synchronization.

[0103] 3. Record the hierarchical routing data in the network to establish the directional connection relationship between the ports and the ports, and assign the hierarchical routing data to the connection relationship, and synchronize to the graph database in relation type, incremental synchronization.

[0104] 4. Record the channel carrying relationship in the network according to the channel routing data, and synchronize to the graph database in relation type, incremental synchronization.

[0105] The hierarchical routing data auditing method provided by the embodiment uses a graph database to access hierarchical routing and channel carrying relationship data, treats channels as node objects, and maintains the connection relationship between ports and ports and the carrying relationship between channels and channels when saving the routing data to the graph database. With these relationship data, the query efficiency is very fast when finding the carrying relationship from the top channel to the bottom channel of any level and aggregating hierarchical routing.

[0106] Step S102: Obtain the hierarchical routing data of each channel from the graph database, and construct an adjacency list according to the hierarchical routing data; start from any node in the adjacency list, traverse all reachable nodes and mark them as the same connected component by using a graph search algorithm; if the number of connected components of the hierarchical routing data is 1, and there is a routing path between any two nodes, it is determined that the connectivity of the hierarchical routing is normal.

[0107] Reference Figure 4 In the embodiment, the main steps of hierarchical routing data auditing are as follows:

[0108] 1. Batch obtain channel and channel hierarchical routing data from the graph database.

[0109] 2. Multi-thread concurrent execution of the "single channel hierarchical routing data auditing" sub-process processing.

[0110] 3. Record the hierarchical routing auditing result into the graph database.

[0111] Optionally, the specific steps of the "single channel hierarchical routing data auditing" sub-process are as follows:

[0112] I. Input channel and channel hierarchical routing data.

[0113] II. Check if the layered routing data is empty. If empty, the sub-process returns the audit result (routing data is empty) and the sub-process is finished. If not empty, continue to execute.

[0114] This embodiment ensures the existence of the path itself by checking if empty as a preliminary verification of the routing data.

[0115] III. Audit the routing connectivity and the integrity on the routing topology based on the connected components of graph theory:

[0116] 1. Data initialization processing:

[0117] a. Merge multiple ports in the source port group into one. Merge multiple ports in the destination port group into one port (refer to Figure 5 ).

[0118] b. Remove cascading cross (refer to Figure 6 ).

[0119] c. Remove PTG protection structure according to the scene, provided that removing PTG will not change the shortest distance between each point in the graph and the source and destination points (refer to Figure 7 ).

[0120] This embodiment reduces the routing complexity by performing data initialization processing on the routing data before using the connected components to judge the routing connectivity.

[0121] 2. Construct an adjacency list according to the routing data, and use a graph search algorithm to divide the connected components.

[0122] 3. Judge the connectivity of the routing according to the connected components and the adjacency list. Note that the data used to construct the adjacency list is the original routing data before the initialization processing (without port merging, without removing cascading cross and PTG). The connectivity judgment result of the routing exists in the following four cases: normal, breakpoint, segment, and isolated point. The following examples are illustrated in combination with routing graph examples, and the legends do not contain graph elements.

[0123] a. Normal: the number of connected components is equal to 1, and there is no breakpoint. Output the normal routing (refer to Figure 8 ).

[0124] b. Breakpoint: the number of connected components is equal to 1, but there is a breakpoint. Output the abnormal type of routing; breakpoint (refer to Figure 9 and Figure 10 ).

[0125] c. The number of connected components is greater than 1, and there are multiple segment nodes with a number of connected components not equal to 1. Output the abnormal type of routing; segment (refer to Figure 11 ).

[0126] d. The number of connected components is greater than 1, and there is a connected component with 1 node. Output the type of routing exception; free point (reference Figure 12 ).

[0127] Four, whether the connectivity of the routing is normal, if normal, continue to execute, if abnormal, output the type of routing exception (free, breakpoint, segment), the sub-process returns the audit result, and the sub-process is executed.

[0128] In this embodiment, a linked list is created for each node to store other nodes directly connected to the node. In the construction, each edge in the routing network, that is, the connection between nodes, is traversed, and the adjacency list of the corresponding node is updated to form a complete graph structure. In a graph, if there is a group of nodes, each two nodes in the group have a path to reach each other, and these nodes have no connection relationship with other nodes in the graph, then the group of nodes is a connected component. If all nodes in the graph can reach each other through some paths, the graph is connected. If there are multiple such components, the graph is not connected. The process of judging the connectivity of the routing based on the adjacency list is essentially to find all the connected components and check whether two nodes are in the same connected component.

[0129] Optionally, in this embodiment, the method for constructing the adjacency list according to the routing data and dividing the connected components using the graph search algorithm includes:

[0130] Method 1:

[0131] For each node, a flag is set to indicate whether it has been visited.

[0132] DFS traversal is performed from any unvisited node in the graph. When a node is visited each time, the adjacent nodes of the node are recursively visited and marked as visited.

[0133] Each time a new DFS is started from an unvisited node, it means that a new connected component is found. Through the traversal of DFS, all nodes that can be reached from the starting node are marked as the same connected component.

[0134] For any two nodes, if they belong to the same connected component, it means that there is a path between the two nodes, that is, they are connected; otherwise, they are not in the same connected component and are not connected.

[0135] Method 2:

[0136] Each node is set to an unvisited state.

[0137] Start from any unvisited node, use a queue to manage the nodes to be visited, and put the source node into the queue.

[0138] In order of the nodes in the queue, visit the nodes adjacent to the current node one by one, and add these nodes to the queue.

[0139] When the BFS traversal starts each time, if the queue is empty, it means that a new connected component is found.

[0140] For any two nodes, if they are in the same connected component, it means that there is a path between the two nodes, and they are connected; otherwise, they are not connected.

[0141] Step S103: When the connectivity of the hierarchical routing is normal, the integrity of the hierarchical routing is audited based on the service characteristics, and it is checked whether the routing meets the requirements of the service scenario; the auditing method of the routing integrity is: the auditing rules are selected according to the characteristics of the network management scenario and the channel level, and the routing loss is detected based on the pure data dimension; if the detection result is that there is no routing loss, it is determined that the hierarchical routing has integrity.

[0142] Optionally, in the sub-process of “single-channel hierarchical routing data auditing”, when the channel routing passes the connectivity test and the auditing result is normal, different integrity auditing rules can be selected according to the characteristics of different network management scenarios and different channel levels to judge the routing loss (routing service structure integrity), so as to judge whether the channel routing is complete.

[0143] a. Auditing rule 1: For a two-source two-destination channel, it is detected whether the forward and reverse paths are separated (the path from source 1 to destination 1 is the forward path, and the path from source 2 to destination 2 is the reverse path) (for reference to Figure 13 ).

[0144] b. Auditing rule 2: For the channels of ODU, VC level and specific network management, it is detected whether all routing segments have forward and reverse paths (for reference to Figure 14 ). The specific network management refers to the network management system responsible for managing and monitoring the channels of specific network levels such as ODU level and VC level.

[0145] c. Auditing rule 3: For the channels of ODU, VC level and specific network management, it is detected whether all routing segments have primary and backup paths (for reference to Figure 15 ).

[0146] d. Auditing rule 4: For the channels whose routing exists cascading cross, it is detected whether all cascading cross routing segments have forward and reverse paths (for reference to Figure 16 ).

[0147] The judgment of the above auditing rules only needs to be based on pure data dimension auditing, and does not need to be based on graph algorithm search judgment, because the connectivity test has been passed through the pass-through routing. In addition, the above auditing rules can be added according to the business scene demand, and can be combined for use.

[0148] The data of the channel layered routing data auditing result being abnormal is entered into the graph database.

[0149] The layered routing data auditing method provided by the embodiment splits the channel layered routing auditing process into two steps. In step one, the connectivity and structural integrity of the routing are detected by using graph theory connected components. In the manner of graph search, the routing structure can be connected and restored according to the port connection relationship, and the problem of inaccurate routing verification caused by low routing data quality is solved. In step two, under the premise that the routing connectivity verification is passed, the integrity of the routing is audited according to the routing business characteristics, the efficiency is extremely high, the implementation difficulty of the auditing rules is low, and the auditing details are rich. In addition, the two-step processing has the benefits that, in the process of using the graph algorithm to search the routing, it is not necessary to go according to different auditing data attributes, which reduces the processing difficulty and improves the efficiency.

[0150] Moreover, when detecting the connectivity and structural integrity of the routing, the embodiment adopts the graph algorithm to divide the connected components, judges the connectivity of the routing based on the connected components, is simple and easy to understand, and has high processing efficiency; the routing complexity is reduced by performing the data initialization processing operation on the routing data, and the calculation efficiency of the graph connected components is improved.

[0151] Step S104: The auditing abnormal result data of each channel layered routing is entered into the graph database, and the auditing result of each channel layered routing is output.

[0152] Optionally, the embodiment further includes obtaining the channel data of the business layer from the graph database, and auditing the channel bearing structure of each business channel according to the channel bearing relationship between the business bearing model and the channel in the graph database, checking whether the channel level in the bearing relationship is complete; and entering the auditing abnormal result data of the business channel into the graph database.

[0153] Reference Figure 17 As shown in the figure, in the embodiment, the specific steps of the business layer routing data auditing are as follows:

[0154] The specific steps of the business layer routing data auditing are as follows:

[0155] The business layer channel data is obtained from the graph database. According to the channel bearing relationship in the business bearing model and the graph database, the channel bearing structure of each business channel is judged, and whether the channel level in the bearing relationship is complete is verified. If not, the audit result of the business channel is marked as missing channel bearing structure, and the missing channel level is marked. The step of judging the completeness of the channel bearing structure of the business layer channel based on the channel bearing relationship in the graph database includes: taking the business channel as the starting point and the channel bearing relationship as the edge, searching the bearing path of the business channel. Analyzing all the nodes (i.e. channels) passed by the bearing path, and extracting the channel level. Combined with the business bearing model, it is judged whether the channel level contained in the bearing path is covered. If so, the channel bearing result is complete. Commonly, the channel level bearing under the ETH / EOO business bearing model should include FDFR, ETH, ODU, OTU, OCH, OMS, OTS; commonly, the channel level bearing under the OTN / DWDM business bearing model should include Client, ODU, OTU, OCH, OMS, OTS; and so on. The channel level contained in these business models can be configured and adjusted according to actual conditions.

[0156] Optionally, the embodiment further includes: based on the channel bearing relationship in the graph database, the audit abnormal result data of the hierarchical routing is converged to the business layer channel; if the audit result of the channel bearing structure is normal and the convergence result is empty, it is determined that the routing of the business channel is normal; if the audit result of the channel bearing structure is normal and the convergence result is not empty, the hierarchical routing data of the business channel is audited again from the two dimensions of electrical layer routing and optical layer routing, and if the result of the secondary audit is normal, it is determined that the routing of the business channel is normal.

[0157] Optionally, in the embodiment, based on the channel bearing relationship in the graph database, the hierarchical routing data audit result of the second step is converged to the business layer routing data audit result as the result of the business layer routing data audit. If the convergence result is empty and the audit result of the channel bearing structure of the second step is normal, it indicates that the routing of the business channel is normal. If there is data converged to the hierarchical routing data audit result, the routing data of the business channel needs to be audited again. The routing data of the business channel is multiplexed according to the business electrical layer routing and optical layer routing two dimensions, and the hierarchical routing audit method and rule is used to audit the two types of routing data again. If the audit result of the secondary audit is normal, the routing of the business channel is normal. If the audit result is abnormal, the final audit result of the business channel will also include the abnormal item of the hierarchical channel.

[0158] The step of quickly converging the hierarchical routing audit result to the business layer channel based on the channel bearing relationship in the graph database includes:

[0159] Using the business channel ID, query the channel carrying relationship in the graph library to obtain the relevant layered channel ID. Based on the layered channel ID, query the layered routing audit result table and save the layered routing audit exception results as a reference for the audit results of the business layer channels.

[0160] The step of performing a secondary verification of the routing data for a service channel with abnormal aggregation results includes:

[0161] Starting with the service channel and using channel carrying relationships as edges, a graph search algorithm is used to search for the carrying path of that service channel. The search terminates when a channel at the OCH level is encountered, and the current path (excluding OCH channels) is returned. All channel IDs in the searched path are deduplicated and grouped into a set. Based on this deduplicated set of channel IDs, hierarchical routing data is queried and aggregated to obtain the service electrical layer routing. Based on this service electrical layer routing data, the "Hierarchical Routing Audit Methods and Rules" are reused to perform a secondary verification of the routing data.

[0162] The OCH channel IDs recorded in the service electrical layer routing data are extracted. Then, hierarchical routing aggregation is performed on each OCH channel, converging to the TPL level. For these converged optical layer routes, the "Hierarchical Routing Audit Method and Rules" are reused for secondary verification. Simultaneously, the verification results are aggregated into the service channel as the result of the service channel routing data audit.

[0163] Depend on Figure 17 It can be seen that the audit results of the business channels should include audit anomalies in channel A1, channel B1, channel B2, and channel B3.

[0164] Optionally, based on the channel carrying relationship in the graph database, the steps of aggregating audit anomaly results data from top to bottom to the business layer channel include: using the business channel ID, querying the graph database channel carrying relationship to obtain the relevant layered channel ID, querying the layered routing audit result table according to the layered channel ID, and saving the layered routing audit anomaly results as a reference for the audit results of the business layer channel.

[0165] The network access route checking method provided by the embodiment innovatively uses a graph database to manage channel carrying relationships and store hierarchical abnormality checking results, and can check whether the channel carrying structure of a service channel is complete according to the service channel dimension. Thanks to the efficient correlation characteristics of the graph database, hierarchical route checking results can be quickly aggregated, real-time aggregation is achieved, and data freshness is high. For a service channel with abnormal aggregated checking results, secondary checking is performed to ensure the accuracy and reliability of the checking results. For a service channel with empty aggregated results and a normal carrying structure, secondary checking is not performed, thereby reducing the workload and improving the checking efficiency.

[0166] Optionally, in the embodiment, the hierarchical route checking results and the service layer route checking results are aggregated and output. The output modes include, but are not limited to, front-end page table display, audit report file export, and audit result statistics.

[0167] The abnormal route checking result is generally divided into:

[0168] Route does not exist: that is, the route data does not exist.

[0169] Breakpoint: there is only one connected component, but there is a breakpoint.

[0170] Segment: the number of connected components is greater than 1, and there are multiple connected component nodes, and the number of nodes of each connected component is greater than 1.

[0171] Free point: except for one connected component containing a source and a sink, the number of nodes contained in the remaining connected components is 1.

[0172] Route loss: the detailed information of the missing route between two nodes is output according to the rules.

[0173] The layered routing data auditing method provided in the embodiment uses a graph database to store channels and routing data. The channels are recorded as nodes in the graph database, and the directed connection between ports and the bearing relationship between channels are constructed according to the routing information, and the data is stored in the graph database. When the layered routing data auditing is performed, the channels and routing data are batched from the graph database, and the multi-thread concurrent processing of the layered routing data auditing sub-process is performed, and the layered routing data auditing sub-process auditing result is stored in the graph database. When the service layer routing data auditing is performed, the layered routing data auditing abnormal result is quickly aggregated from top to bottom based on the channel bearing relationship in the graph database, and is used as the service layer routing data auditing result. Finally, the layered routing data auditing result and the service layer routing data auditing result are output together into a report. The layered routing data auditing is to use a graph theory connected component to judge the connectivity and the completeness of the topology of the routing. When the routing is passed in the connectivity test, the auditing result is normal, and then different completeness auditing rules are selected according to the business scene characteristics to perform the routing loss judgment, and it is judged whether the routing is complete in the business networking structure.

[0174] The layered routing data auditing method provided in the embodiment constructs a directed graph according to the directed connection relationship between the ports in the routing data, uses a graph algorithm to divide a connected component and a data dimension auditing rule to check, and quickly and accurately detects the connectivity and completeness of the routing. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality. And all the layered routing abnormal auditing results can be quickly aggregated according to the business channel dimension, and the data can be rectified according to the business channel dimension to quickly achieve the effect.

[0175] In order to quickly and accurately detect the connectivity and completeness of the routing, and in the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality, an embodiment of a layered routing data auditing device for implementing all or part of the contents of the layered routing data auditing method is provided, as shown in Figure 18 , the layered routing data auditing device specifically includes the following contents:

[0176] The data transfer module 10 is used for synchronizing the port data and the channel data in the network to the graph database as node types, and establishing the connection relationship between the ports and the bearing relationship between the channels.

[0177] The first detection module 20 is configured to acquire the hierarchical routing data of each channel from the graph database, and construct an adjacency list according to the hierarchical routing data; through a graph search algorithm, all reachable nodes are traversed and marked as the same connected component from any node in the adjacency list; if the number of connected components of the hierarchical routing data is 1, and there is a routing path between any two nodes, it is determined that the connectivity of the hierarchical routing is normal.

[0178] The second detection module 30 is configured to, when the connectivity of the hierarchical routing is normal, audit the integrity of the hierarchical routing based on the service characteristics, and check whether the routing meets the requirements of the service scenario; the auditing method of the routing integrity is: selecting an auditing rule according to the characteristics of the network management scenario and the channel level, and performing routing loss detection based on a pure data dimension; if the detection result is that there is no routing loss, it is determined that the hierarchical routing has integrity.

[0179] The result output module 40 is configured to record the auditing abnormal result data of the hierarchical routing of each channel in the graph database, and output the auditing result of the hierarchical routing of each channel.

[0180] From the above description, it can be known that the hierarchical routing data auditing device provided by the embodiment of the application constructs a directed graph according to the port directed connection relationship in the routing data, uses a graph theory connected component to judge the connectivity and the integrity on the topological structure of the routing, when the routing is tested by the connectivity, and the auditing result is normal, different integrity auditing rules are selected according to the service scenario characteristics, the routing loss is judged, it is judged whether the routing of the channel is complete on the service networking structure, the connected component is divided by using the graph algorithm, and the auditing rule of the data dimension is checked, the connectivity and the integrity of the routing of the channel are quickly and accurately detected. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality.

[0181] From the hardware level, in order to quickly and accurately detect the connectivity and the integrity of the routing of the channel, and in the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality, the embodiment of the electronic device for implementing all or part of the contents of the hierarchical routing data auditing method is provided, and the electronic device specifically includes the following contents:

[0182] A processor, a memory, a communications interface, and a bus; wherein the processor, the memory, the communications interface complete the communication among each other through the bus; the communications interface is used for realizing the information transmission between the layered routing data auditing device and the core service system, the user terminal, and the related database and other related devices; the logic controller can be a desktop computer, a tablet computer, a mobile terminal, and the like, and the embodiment is not limited thereto. In the embodiment, the logic controller can be implemented with reference to the embodiment of the layered routing data auditing method and the embodiment of the layered routing data auditing device, the contents of which are incorporated herein, and the repeated parts will not be described herein.

[0183] It can be understood that the user terminal can include a smart phone, a tablet electronic device, a network set-top box, a portable computer, a desktop computer, a personal digital assistant (PDA), a vehicle-mounted device, a smart wearable device, and the like. The smart wearable device can include smart glasses, a smart watch, a smart bracelet, and the like.

[0184] In actual application, part of the layered routing data auditing method can be executed on the electronic device as described above, or all operations can be completed in the client device. Specifically, the selection can be made according to the processing capability of the client device and the limitation of the user usage scenario, and the like. The present application is not limited thereto. If all operations are completed in the client device, the client device can further include a processor.

[0185] The client device described above can have a communications module (i.e., a communications unit) and can be communicatively connected with a remote server to realize the data transmission with the server. The server can include a server of the task scheduling center side, and can further include a server of an intermediate platform in other implementation scenarios, such as a server of a third-party server platform communicatively connected with the server of the task scheduling center. The server can include a single computer device, or can include a server cluster composed of multiple servers, or a server structure of a distributed device.

[0186] Figure 19 A schematic block diagram of a system configuration of the electronic device 9600 of the embodiment of the present application is shown in FIG. 9. As shown in FIG. 9, the electronic device 9600 can include a central processor 9100 and a memory 9140; the memory 9140 is coupled to the central processor 9100. It is worth noting that the structure shown in FIG. 9 is exemplary; other types of structures can also be used to supplement or replace the structure to realize the telecommunication function or other functions. Figure 19 Figure 19 The structure shown in FIG. 9 is exemplary; other types of structures can also be used to supplement or replace the structure to realize the telecommunication function or other functions.

[0187] ​In an embodiment, the layered routing data auditing method function can be integrated into the central processor 9100. The central processor 9100 can be configured to control as follows:

[0188] Step S101: Synchronize the port data and channel data in the network to the graph database according to the node type, and establish the connection relationship between the ports and the carrying relationship between the channels;

[0189] Step S102: Obtain the layered routing data of each channel from the graph database, and construct an adjacency list according to the layered routing data; by using a graph search algorithm, start from any node in the adjacency list, traverse all reachable nodes and mark them as the same connected component; if the number of connected components of the layered routing data is 1, and there is a routing path between any two nodes, it is determined that the connectivity of the layered routing is normal.

[0190] Step S103: When the connectivity of the layered routing is normal, the integrity of the layered routing is audited based on the service characteristics, and it is checked whether the routing meets the requirements of the service scenario; the auditing method of the routing integrity is: selecting an auditing rule according to the network management scenario and the characteristics of the channel level, and performing routing loss detection based on pure data dimensions; if the detection result is that there is no routing loss, it is determined that the layered routing has integrity.

[0191] Step S104: Record the abnormal result data of the layered routing of each channel in the graph database, and output the auditing result of the layered routing of each channel.

[0192] As can be seen from the above description, the electronic device provided by the embodiments of the present application constructs a directed graph according to the directed connection relationship of the ports in the routing data, uses a connected component of graph theory to judge the connectivity and the integrity on the topology structure of the routing, when the routing of the channel passes the connectivity test, and the auditing result is normal, different integrity auditing rules are selected according to the service scenario characteristics, the routing loss is judged, it is judged whether the routing of the channel is complete on the service networking structure, the connected component is divided by using the graph algorithm, and the auditing rule of the data dimension is checked, the connectivity and the integrity of the routing of the channel are quickly and accurately detected. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking cannot be performed due to the shallow data quality.

[0193] In another embodiment, the layered routing data auditing device can be configured separately from the central processor 9100, for example, the layered routing data auditing device can be configured as a chip connected with the central processor 9100, and the layered routing data auditing method function is realized by the control of the central processor.

[0194] As Figure 19As shown, the electronic device 9600 may further include: a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It is worth noting that the electronic device 9600 does not necessarily need to include these components. Figure 19 All components shown; in addition, the electronic device 9600 may also include Figure 19 For components not shown, please refer to existing technologies.

[0195] like Figure 19 As shown, the central processing unit 9100, sometimes also referred to as a controller or operating control, may include a microprocessor or other processor device and / or logic device, which receives inputs and controls the operation of various components of the electronic device 9600.

[0196] The memory 9140 may be, for example, one or more of a cache, flash memory, hard drive, removable media, volatile memory, non-volatile memory, or other suitable devices. It may store the aforementioned failure-related information, and also store a program for executing that information. The central processing unit 9100 may execute the program stored in the memory 9140 to perform information storage or processing, etc.

[0197] Input unit 9120 provides input to central processing unit 9100. Input unit 9120 may be, for example, a keypad or touch input device. Power supply 9170 provides power to electronic device 9600. Display 9160 displays images and text. Display may be, for example, an LCD display, but is not limited thereto.

[0198] The memory 9140 can be a solid-state memory, such as a read-only memory (ROM), random access memory (RAM), a SIM card, etc. It can also be a memory that retains information even when power is off, can be selectively erased, and contains more data; examples of this type of memory are sometimes referred to as EPROMs. The memory 9140 can also be some other type of device. The memory 9140 includes a buffer memory 9141 (sometimes referred to as a buffer). The memory 9140 may include an application / function storage unit 9142 for storing application programs and function programs or processes for executing the operation of the electronic device 9600 via the central processing unit 9100.

[0199] The memory 9140 can further include a data storage 9143 for storing data such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. A driver storage 9144 of the memory 9140 can include various drivers of the electronic device for communication functions and / or for performing other functions of the electronic device (e.g., a messaging application, a phonebook application, etc.).

[0200] The communication module 9110 is a transmitter / receiver that transmits and receives signals via the antenna 9111. The communication module 9110 (transmitter / receiver) is coupled to the central processor 9100 to provide input signals and receive output signals, as in the case of a conventional mobile communication terminal.

[0201] Based on different communication technologies, a plurality of communication modules 9110 can be provided in the same electronic device, such as a cellular network module, a Bluetooth module, and / or a wireless local area network module, etc. The communication module 9110 (transmitter / receiver) is further coupled to the speaker 9131 and the microphone 9132 via the audio processor 9130 to provide audio output via the speaker 9131 and receive audio input from the microphone 9132, thereby implementing a conventional telecommunication function. The audio processor 9130 can include any suitable buffer, decoder, amplifier, etc. In addition, the audio processor 9130 is coupled to the central processor 9100, thereby enabling recording on the local device via the microphone 9132 and playing stored sound on the local device via the speaker 9131.

[0202] The embodiment of the present application further provides a computer readable storage medium capable of implementing all steps of the hierarchical routing data auditing method with the execution subject being the server or the client in the above-mentioned embodiment, and the computer program is stored on the computer readable storage medium. When the processor executes the computer program, all steps of the hierarchical routing data auditing method with the execution subject being the server or the client in the above-mentioned embodiment are implemented. For example, when the processor executes the computer program, the following steps are implemented:

[0203] Step S101: synchronizing the port data and the channel data in the network to the graph database according to the node type, and establishing the connection relationship between the ports and the connection relationship between the channels;

[0204] Step S102: obtaining the hierarchical routing data of each channel from the graph database, and constructing an adjacency list according to the hierarchical routing data; starting from any node in the adjacency list, traversing all reachable nodes and marking them as the same connected component by using a graph search algorithm; if the number of the connected components of the hierarchical routing data is 1, and there is a routing path between any two nodes, it is determined that the connectivity of the hierarchical routing is normal;

[0205] Step S103: When the connectivity of the hierarchical routing is normal, the integrity of the hierarchical routing is audited based on the service characteristics, and it is checked whether the routing meets the requirements of the service scenario; the auditing method of the routing integrity is that the auditing rules are selected according to the network management scenario and the characteristics of the channel hierarchy, and the routing loss is detected based on the pure data dimension; if the detection result is that there is no routing loss, it is determined that the hierarchical routing has integrity;

[0206] Step S104: The auditing abnormal result data of each channel hierarchical routing is entered into the graph database, and the auditing result of each channel hierarchical routing is output.

[0207] From the above description, it can be known that the computer readable storage medium provided by the embodiment of the application constructs a directed graph according to the port directed connection relationship in the routing data, uses a graph theory connected component to judge the connectivity and the integrity on the topology structure of the routing, when the channel routing passes the connectivity test, the auditing result is normal, then different integrity auditing rules are selected according to the service scenario characteristics, the routing loss is judged, it is judged whether the channel routing is complete on the service networking structure, the connected component is divided by using the graph algorithm, and the auditing rules of the data dimension are checked, the connectivity and the integrity of the channel routing are quickly and accurately detected. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking is avoided from being unable to be performed due to the shallow data quality.

[0208] The embodiment of the application also provides a computer program product capable of implementing all steps of the hierarchical routing data auditing method in the above-mentioned embodiment, wherein the computer program / instruction is executed by a processor to implement the steps of the hierarchical routing data auditing method, for example, the computer program / instruction implements the following steps:

[0209] Step S101: The port data and the channel data in the network are synchronized to the graph database as node types, and the connection relationship between the ports and the bearing relationship between the channels is established;

[0210] Step S102: The hierarchical routing data of each channel is obtained from the graph database, and an adjacency list is constructed according to the hierarchical routing data; through a graph search algorithm, all reachable nodes are traversed and marked as the same connected component from any node in the adjacency list; if the number of the connected components of the hierarchical routing data is 1, and there is a routing path between any two nodes, it is determined that the connectivity of the hierarchical routing is normal;

[0211] Step S103: When the connectivity of the hierarchical routing is normal, the integrity of the hierarchical routing is audited based on the service characteristics, and it is checked whether the routing meets the requirements of the service scenario; the auditing method of the routing integrity is: the auditing rules are selected according to the characteristics of the network management scenario and the channel hierarchy, and the routing loss is detected based on the pure data dimension; if the detection result is that there is no routing loss, it is determined that the hierarchical routing has integrity;

[0212] Step S104: The auditing abnormal result data of each channel hierarchical routing is recorded in the graph database, and the auditing result of each channel hierarchical routing is output.

[0213] From the above description, the computer program product provided by the embodiment of the application constructs a directed graph according to the port directed connection relationship in the routing data, uses a graph theory connected component to judge the connectivity and the integrity on the topological structure of the routing, when the channel routing passes the connectivity test, the auditing result is normal, then different integrity auditing rules are selected according to the service scenario characteristics, the routing loss is judged, it is judged whether the channel routing is complete on the service networking structure, the connected components are divided by using the graph algorithm, and the auditing rules of the data dimension are checked, the connectivity and the integrity of the channel routing are quickly and accurately detected. In the checking process, the segment group sequence attribute in the routing data is not relied on, and the checking is avoided from being unable to be performed due to the shallow data quality.

[0214] Those skilled in the art should understand that the embodiments of the application can be provided as a method, device, or computer program product. Therefore, the application can adopt a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the application can adopt the form of a computer program product implemented on one or more computer usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) containing computer usable program codes.

[0215] The application is described with reference to flowcharts and / or block diagrams of the method, device (apparatus), and computer program product according to the embodiments of the application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device that implements the functions specified in the flowcharts and / or block diagrams. Figure 1 The device that implements the functions specified in one or more flows and / or blocks. Figure 1 The device that implements the functions specified in one or more flows and / or blocks.

[0216] These computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture including instructions which implement the flow Figure 1 The functions of a flow or multiple flows and / or a block or multiple blocks in conjunction with the disclosed methods can be implemented on practitioners' computers in computer software, firmware, hardware, or combinations of them. Figure 1

[0217] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flow Figure 1 The functions of a flow or multiple flows and / or a block or multiple blocks in conjunction with the disclosed methods can be implemented on practitioners' computers in computer software, firmware, hardware, or combinations of them. Figure 1

[0218] The principles and implementations of the present application are described in the specific embodiments, the above examples are only used to help understand the method of the present application and its core idea; at the same time, for those skilled in the art, according to the idea of the present application, the specific implementation and application range will be changed, and the above description should not be understood as the limitation of the present application.​​

Claims

1. A hierarchical routing data auditing method, characterized in that, The method includes: Synchronize port and channel data in the network to the graph database by node type, and establish connection relationships between ports and bearer relationships between channels; Retrieve hierarchical routing data for each channel from the graph database and construct an adjacency list based on the hierarchical routing data; use a graph search algorithm to traverse all reachable nodes starting from any node in the adjacency list and mark them as the same connected component; if the number of connected components in the hierarchical routing data is 1 and there is a routing path between any two nodes, then the connectivity of the hierarchical routing is determined to be normal. When the connectivity of the hierarchical routing is normal, the integrity of the hierarchical routing is audited based on business characteristics to check whether the routing meets the requirements of the business scenario. The audit method for routing integrity is as follows: select audit rules according to the characteristics of the network management scenario and the channel level, and perform route missing detection based on pure data dimension. If the detection result is that there are no missing routes, the hierarchical routing is determined to be complete. The audit results of hierarchical routing for each channel are entered into the graph database, and the audit results of hierarchical routing for each channel are output.

2. The hierarchical routing data auditing method according to claim 1, characterized in that, The steps for establishing the connection relationship between ports and the bearer relationship between channels include: Based on the network's hierarchical routing data, directed connections are established between ports, and the attributes of the hierarchical routing data are assigned to the connection relationships, which are then incrementally synchronized to the graph database using the relationship type. Based on the network's hierarchical routing data, directed bearer relationships are established between channels, and these relationships are incrementally synchronized to the graph database.

3. The hierarchical routing data auditing method according to claim 1, characterized in that, Prior to the step of constructing the adjacency list based on the hierarchical routing data, the method further includes: Check if the hierarchical routing data is empty; If empty, the audit result for the hierarchical routing data is returned, indicating that the audit operation for the hierarchical routing data has been completed. If not empty, continue with the hierarchical routing connectivity audit operation.

4. The hierarchical routing data auditing method according to claim 1, characterized in that, The step of constructing an adjacency list based on hierarchical routing data also includes initializing the hierarchical routing data for each channel. The method for initializing the hierarchical routing data for each channel includes: Merge multiple ports in the source port group into one port; merge multiple ports in the destination port group into one port; Remove cascading crossovers; Remove the PTG protection structure according to the scenario, provided that removing the PTG does not change the shortest distance between each point in the graph and the source and destination endpoints.

5. The hierarchical routing data auditing method according to claim 1, characterized in that, The step of using a graph search algorithm to traverse all reachable nodes from any node in the adjacency list and mark them as the same connected component includes: For each node, set a flag to indicate whether it has been visited; Starting from any unvisited node in the graph, perform a Depth-First Search (DFS) traversal; each time a node is visited, recursively visit the adjacent nodes of that node and mark them as visited. When starting a new DFS from an unvisited node, all nodes reachable from this starting node are marked during the DFS traversal and treated as the same connected component. For any two nodes, if they belong to the same connected component, it means that there is a path between the two nodes, that is, they are connected; otherwise, it means that they are not in the same connected component and are not connected.

6. The hierarchical routing data auditing method according to claim 1, characterized in that, The step of using a graph search algorithm to traverse all reachable nodes from any node in the adjacency list and mark them as the same connected component includes: Set each node to an unaccessed state; Starting from any unvisited node, use a queue to manage the nodes to be visited, and put the source node into the queue; Following the order of nodes in the queue, visit each node adjacent to the current node one by one and add these nodes to the queue; If the queue is empty at the start of each BFS traversal, it means that a new connected component has been found. For any two nodes, if they are in the same connected component, then there is a path between them, and they are connected; otherwise, they are not connected.

7. The hierarchical routing data auditing method according to claim 1, characterized in that, The steps for auditing the integrity of hierarchical routing based on business characteristics and checking whether the routing meets the requirements of the business scenario include: For channels with two sources and two destinations, detect whether their forward and reverse paths are separated; For ODU, VC level, and specific network management channels, check whether all their routing segments have forward and reverse paths; For ODU, VC level and specific network management channels, check whether all their routing segments have primary and backup paths; For routes with cascading cross-channels, check whether all cascading cross-channels have forward and reverse paths.

8. A hierarchical routing data auditing device, characterized in that, The device includes: The data transfer module is used to synchronize port data and channel data in the network to the graph database by node type, and to establish the connection relationship between ports and the carrying relationship between channels. The first detection module is used to obtain the hierarchical routing data of each channel from the graph database and construct an adjacency list based on the hierarchical routing data. Using a graph search algorithm, it starts from any node in the adjacency list, traverses all reachable nodes and marks them as the same connected component. If the number of connected components in the hierarchical routing data is 1 and there is a routing path between any two nodes, then the connectivity of the hierarchical routing is determined to be normal. The second detection module is used to audit the integrity of the hierarchical routes based on business characteristics when the connectivity of the hierarchical routes is normal, and to check whether the routes meet the requirements of the business scenario. The audit method for route integrity is as follows: select audit rules according to the characteristics of the network management scenario and the channel level, and perform route missing detection based on pure data dimension; if the detection result is that there are no missing routes, the hierarchical routes are determined to be complete. The results output module is used to input the audit anomaly results data of each channel's hierarchical routing into the graph database and output the audit results of each channel's hierarchical routing.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the steps of the hierarchical routing data auditing method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the steps of the hierarchical routing data auditing method according to any one of claims 1 to 7.

Images