Hierarchical Judgment and Impact Mitigation Method and Device for Cutover Events Based on Graph Database

Abstract

Embodiments of the present disclosure provide a method and apparatus for hierarchical conflict judgment of cutover events based on a graph database. The method includes: entering network elements, ports, and channels as nodes into the graph database, and constructing a directed association relationship between the nodes according to hierarchical routing data; searching in the graph database for a target-level channel associated with the cutover object according to the cutover object of the cutover event; constructing a routing topology graph of the target-level channel, performing a shortest path search based on the routing topology graph, judging whether the line is interrupted and the minimum cutover event combination causing the interruption, and obtaining a conflict judgment result of the target-level channel; for the target-level channel with cutover event conflicts, searching upward in the graph database for the corresponding top-level service channel; and, based on the conflict judgment result of the target-level channel, judging whether the line of the top-level service channel is interrupted and the minimum cutover event combination causing the interruption, and obtaining a conflict judgment result of the top-level service channel.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of OTN network communication. Specifically, it relates to a method and apparatus for hierarchical conflict judgment of cutover events based on a graph database, and a computer-readable storage medium storing a computer program. Background Art

[0002] In the field of OTN (Optical Transport Network) communication, in order to adapt to the growing business requirements, improve network performance, or replace aging equipment, cutover operations are a common and necessary means. Cutover operations include replacing old network devices with new ones, or re-routing and reconnecting network lines, etc. However, cutover events often come with some potential risks. Especially when multiple cutover operations are carried out simultaneously, they may interfere with each other, resulting in data flow interruption or transmission performance degradation, affecting the quality and continuity of communication services, and even causing serious economic losses. To solve this problem, cutover event conflict judgment technology (also known as cutover conflict detection and prevention technology) in OTN networks has emerged. Its main purpose is to identify and prevent possible conflicts during the cutover process in advance, ensuring that the continuity and stability of network services are not affected when performing cutover operations.

[0003] However, existing conflict judgment technologies can only handle small-scale and single-layer cutover events. For complex network topologies, they cannot effectively handle cutover conflicts between different levels and routes, and cannot provide specific impact analysis and prediction of conflicts. For example, it cannot clearly show what impact a certain cutover operation may have on other channels or services in the network, nor can it effectively evaluate the time and cost of service recovery after the cutover operation. And existing technologies usually adopt a method of judging conflicts level by level from the top layer to the bottom layer channels, resulting in large and repetitive calculations. Especially in a multi-level network structure, each level requires an independent calculation, increasing the calculation complexity and reducing the conflict judgment efficiency. Summary of the Invention

[0004] In order to improve the conflict judgment efficiency of cutover events in the network and ensure the safety of service cutover, the embodiments described herein provide a method and apparatus for hierarchical conflict judgment of cutover events based on a graph database, and a computer-readable storage medium storing a computer program, which can quickly identify and solve cutover conflicts through the graph database and a fine-grained cutover event conflict judgment strategy.

[0005] According to a first aspect of the present disclosure, a hierarchical conflict judgment method for cutover events based on a graph database is provided, including: entering network elements, ports, and channels as nodes into the graph database, and constructing a directed association relationship between the nodes according to hierarchical routing data; according to the cutover object of the cutover event, searching in the graph database for a target-level channel associated with the cutover object; constructing a routing topology graph of the target-level channel, performing a shortest path search based on the routing topology graph, judging whether the line is interrupted and the minimum cutover event combination causing the interruption, to obtain the conflict judgment result of the target-level channel; for the target-level channel with cutover event conflicts, searching upward in the graph database for the corresponding top-level service channel; and based on the conflict judgment result of the target-level channel, judging whether the line of the top-level service channel is interrupted and the minimum cutover event combination causing the interruption, to obtain the conflict judgment result of the top-level service channel.

[0006] In some embodiments of the present disclosure, entering network elements, ports, and channels as nodes into the graph database and constructing a directed association relationship between the nodes includes: taking the network element, port, and channel data stored in the relational database as node types respectively, and incrementally synchronizing them into the graph database; based on the hierarchical routing data in the relational database, establishing a directed connection relationship between ports, between a port and a channel, between a network element and a channel, and a directed bearing relationship between channels.

[0007] In some embodiments of the present disclosure, according to the cutover object of the cutover event, searching in the graph database for a target-level channel associated with the cutover object includes: when the cutover object is a network element, searching for the hierarchical channels connected to the network element according to the directed connection relationship between the network element and the channel; when the cutover object is a port, finding the corresponding hierarchical channel according to the directed connection relationship between the port and the channel; when the cutover object is a topology, searching for the hierarchical routing relationship according to the topology ID, and extracting the relevant hierarchical channels from the hierarchical routing relationship; if the level of the hierarchical channel is less than the level of the target-level channel, then according to the directed bearing relationship between channels, finding the corresponding target-level channel ID upward, if the level of the hierarchical channel is greater than or equal to the level of the target-level channel, then directly recording the hierarchical channel ID, and the level of the target-level channel is any one of the OCH level, OMS level, and OTS level.

[0008] In some embodiments of the present disclosure, to construct a routing topology graph of a target hierarchical channel, perform a shortest path search based on the routing topology graph, and determine whether a line is interrupted and the minimum cut event combination causing the interruption, the buffer judgment result of the target hierarchical channel includes: according to the obtained channel ID set, obtain the hierarchical routing of each channel ID, starting from the channel at the level of the target hierarchical channel or a channel at a level greater than that of the target hierarchical channel, layer by layer converge the hierarchical routing of each channel, and perform the primary / backup inheritance operation to obtain the full - length routing; based on the full - length routing, taking the ports as nodes and each routing segment as a directed connection between ports, obtain the routing topology graph of the target hierarchical channel; adjust the routing topology graph according to the cut event, and remove the network elements, ports, and the points and connection lines in the topology related to the cut event.

[0009] In the adjusted routing topology graph, perform a shortest path search from the source port to the destination port of the channel. If a shortest path is found, the forward line is normal; otherwise, the forward line is interrupted. If the forward line is interrupted, combine the cut events based on the minimum set principle to find the minimum cut object combination causing the interruption. In the adjusted routing topology graph, the Dijkstra algorithm can be used to perform a shortest path search from the destination port to the source port of the channel. If a shortest path is found, the reverse line is normal; otherwise, the reverse line is interrupted. If the reverse line is interrupted, combine the cut events based on the minimum set principle to find the minimum cut object combination causing the interruption; and record the target hierarchical channel ID, the source port and destination port of the channel, the forward and reverse line interruption judgment results, the associated cut event ID, and the minimum cut object combination causing the interruption where there are cut event conflicts.

[0010] In some embodiments of the present disclosure, when combining cutover events based on the minimum set principle and finding the minimum cutover object combination that causes an interruption, it includes: combining all the cutover events associated with the current channel, starting from a combination element count of 1 and going up to a combination element count equal to the total number of cutover events associated with the current channel. This includes: in the first round, performing conflict checking analysis on each individual cutover event and recording the events with conflicts; in the second round, analyzing combinations of two events. According to the minimum set principle, determining whether the events with conflicts are in the combinations of two events. If so, eliminating the combinations of two events where the conflicting events exist and continuing to analyze other combinations of two events, and recording the combinations of two events with conflicts; in the third round and subsequent rounds, according to the minimum set principle, determining whether the events or combinations of events with conflicts are in the combinations of three events. If so, eliminating the combinations of three events where the conflicting events or combinations of events exist and continuing to analyze other combinations of three events, and determining whether the events or combinations of events with conflicts cover all the event combinations to be analyzed in this round. If so, skipping the analysis of this round and higher-order event combinations; for the event combinations that require cutover analysis, determining the set of cutover objects related to them; simulating the impact of the cutover events on the routing topology graph based on the set of cutover objects, deleting the network elements, ports, topologies, and their connected edges related to the cutover events from the routing topology graph to obtain an adjusted subgraph; determining whether there is an interruption in the paths in the subgraph. If the path is interrupted, selecting the source port or the destination port as the starting point to construct an interruption tree, and obtaining the first set of conflicting object combinations through the leaf nodes of the interruption tree; checking whether all cutover event combinations have been traversed and analyzed. If it is completed, it ends. If not, continue to analyze new cutover event combinations until all cutover event combinations have been analyzed.

[0011] In some embodiments of the present disclosure, before obtaining the buffering result of the top-level service channel by determining whether the line of the top-level service channel is interrupted and the minimum cutover event combination that causes the interruption based on the buffering result of the target-level channel, the method includes: extracting all relevant channel ID sets according to the bearing relationship from the service channel to the target-level channel, and obtaining the hierarchical routing of each channel; starting from the target-level channel, aggregating the hierarchical routings of each level of channels layer by layer and performing primary and standby inheritance operations to obtain the complete end-to-end routing, and finding the routing segment that bears the target-level channel in the end-to-end routing; using the ports as nodes, establishing a directed connection between ports according to each routing segment to form a main graph.

[0012] In some embodiments of the present disclosure, based on the buffering judgment result of the target hierarchical channel, determining whether the line of the top-level service channel is interrupted and the minimum cutover event combination causing the interruption, the buffering judgment result of the top-level service channel includes: matching the ports, routing segments in the main graph with the cutover objects to find the cutover events associated with the main graph; finding the cutover events associated with the target hierarchical channel according to the routing segment carrying the target hierarchical channel and the buffering judgment result of the target hierarchical channel; adjusting the main graph according to all the cutover events associated with the current channel, and removing the network elements, ports and the points and connection lines in the topology related to the cutover events; obtaining the target hierarchical channel ID carried by the SNL routing segment in the main graph, and mapping the line interruption status to the SNL routing segment of the main graph according to the buffering judgment result of the target hierarchical channel;

[0013] In the adjusted main graph, perform a shortest path search from the source port to the sink port of the channel. If the shortest path is found, the forward line is normal; otherwise, the forward line is interrupted. If the forward line is interrupted, combine the cutover events associated with the current channel based on the minimum set principle to find the minimum cutover event combination causing the interruption and the corresponding first set of interrupted object combinations. In the adjusted main graph, perform a shortest path search from the sink port to the source port of the channel. If the shortest path is found, the reverse line is normal; otherwise, the reverse line is interrupted. If the reverse line is interrupted, combine the cutover events associated with the current channel based on the minimum set principle to find the minimum cutover event combination causing the interruption and the corresponding first set of interrupted object combinations.

[0014] In some embodiments of the present disclosure, based on the principle of the minimum set, the cutover events associated with the current channel are combined to find the minimum cutover event combination that causes an interruption and the corresponding first set of interrupted object combinations, including: combining the cutover events, starting from the combination element number of 1 until the combination element number is equal to the total number of cutover events, including: in the first round, perform buffer judgment analysis on each single cutover event respectively, and record the events with conflicts; in the second round, analyze the combination of two events, and according to the principle of the minimum set, judge whether the events with conflicts are in the combination of two events. If so, eliminate the combination of two events where the conflict event exists, and continue to analyze other combinations of two events, and record the combination of two events with conflicts; in the third round and subsequent rounds, according to the principle of the minimum set, judge whether the events or event combinations with conflicts are in the combination of three events. If so, eliminate the combination of three events where the conflict event or event combination exists, and continue to analyze other combinations of three events, and judge whether the events or event combinations with conflicts cover all the event combinations that need to be analyzed in this round. If so, skip the analysis of this round and subsequent higher-order event combinations; for the event combinations that need cutover analysis, determine the set of cutover objects associated with them; simulate the impact of the cutover events on the routing topology graph according to the set of cutover objects, and delete the network elements, ports, topologies and their connected edges related to the cutover events from the routing topology graph; according to the cutover event combination, check the impact of the cutover operation on the target-level channel routing segment, and map the forward and reverse line interruption situations of the target-level channel routing segment to the corresponding SNL routing segment in the main graph. Judge whether there is an interruption in the path in the main graph. If the path is interrupted, select the source port or the destination port as the starting point, construct an interruption tree, and obtain the first set of conflict object combinations through the leaf nodes of the interruption tree; check whether all cutover event combinations have been traversed and analyzed. If it is completed, end. If not, continue to analyze new cutover event combinations until all cutover event combinations have been analyzed, and output the service channels with cutover conflicts and their interruption situations, the corresponding minimum cutover event combinations, and the first set of conflict object combinations corresponding to the cutover event combinations.

[0015] According to a second aspect of the present disclosure, there is provided a hierarchical conflict judgment device for cutover events based on a graph database. The device includes at least one processor; and at least one memory storing a computer program. When the computer program is executed by the at least one processor, the device is caused to: enter network elements, ports, and channels as nodes into the graph database, and construct a directed association relationship between the nodes according to hierarchical routing data; find a target-level channel associated with the cutover object in the graph database according to the cutover object of the cutover event; construct a routing topology graph of the target-level channel, perform a shortest path search based on the routing topology graph, judge whether the line is interrupted and the minimum combination of cutover events causing the interruption, and obtain a conflict judgment result of the target-level channel; for the target-level channel with cutover event conflicts, look up the corresponding top-level service channel in the graph database; and based on the conflict judgment result of the target-level channel, judge whether the line of the top-level service channel is interrupted and the minimum combination of cutover events causing the interruption, and obtain a conflict judgment result of the top-level service channel.

[0016] According to a third aspect of the present disclosure, there is provided a computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the steps of the method for hierarchical conflict judgment of cutover events based on a graph database according to the first aspect of the present disclosure.

[0017] According to the method and device for hierarchical conflict judgment of cutover events based on a graph database provided by the embodiments of the present disclosure, by storing channels, network elements, and ports as node objects in the graph database, and at the same time maintaining the connection relationship between ports, network elements, and channels and the bearing relationship between channels, the bearing relationship from the top-level channel to any level of bottom-level channels or from the bottom-level channel to any upper-level channel can be found more quickly. Especially when dealing with complex network topologies, the speed of data retrieval and analysis is greatly improved. By constructing a routing topology graph of the target-level channel and performing a shortest path search, it is possible to effectively judge whether the line is interrupted and accurately find the minimum combination of cutover events causing the interruption, optimize the cutover event analysis process, quickly locate the minimum impact set, reduce the calculation overhead, and improve the conflict judgment efficiency. Further, starting from the relatively lower target level for cutover conflict judgment, and looking up the top-level channel for the hierarchical channel with cutover event conflicts, the conflict judgment result of the target-level channel can be directly reused. Compared with the top-down method, unnecessary combination analysis is avoided, redundant calculation is reduced, and rapid response and result derivation are ensured in a large-scale network environment. Description of the Drawings

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings of the embodiments will be briefly described below. It should be understood that the following described drawings only relate to some embodiments of the present disclosure and do not limit the present disclosure, where:

[0019] Figure 1 is an exemplary flowchart of a cutover event hierarchical judgment and conflict resolution method based on a graph database according to an embodiment of the present disclosure;

[0020] Figure 2 shows a schematic diagram of constructing a graph database according to an embodiment of the present disclosure;

[0021] Figure 3 is a schematic diagram of hierarchical channel aggregation according to an embodiment of the present disclosure;

[0022] Figure 4 is a schematic diagram of an interruption tree structure according to an embodiment of the present disclosure;

[0023] Figure 5 is a schematic block diagram of a cutover event hierarchical judgment and conflict resolution device based on a graph database according to an embodiment of the present disclosure.

[0024] Note that the elements in the drawings are schematic and not drawn to scale. Detailed Embodiments

[0025] In order to make the objectives, technical solutions, and advantages of the embodiments of the present disclosure clearer, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings. Apparently, the described embodiments are some but not all of the embodiments of the present disclosure. All other embodiments obtained by those skilled in the art based on the described embodiments of the present disclosure without creative efforts shall also fall within the scope of protection of the present disclosure.

[0026] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by those skilled in the art to which the subject matter of the present disclosure belongs. Further, it will be understood that terms such as those defined in commonly used dictionaries shall be interpreted as having a meaning consistent with their meaning in the context of the specification and the relevant art, and will not be interpreted in an idealized or overly formal form unless otherwise clearly defined herein. Additionally, terms such as "first" and "second" are only used to distinguish one component (or a part of a component) from another component (or another part of a component).

[0027] According to the regulations of the ITU-T International Telecommunication Union, OTN is divided into seven-layer structure: Customer signal layer: Carries service signals, including IP, Ethernet, SDH, etc. Optical channel payload unit (OPU): Used to adapt service signals to make them suitable for transmission on the optical channel. Optical channel data unit (ODU): Takes OPU as the payload, adds corresponding overhead, and provides end-to-end optical channel performance monitoring. Optical channel transport unit (OTU): Takes ODU as the payload, adds corresponding overhead, provides FEC function and performance monitoring for the OTU section. Optical channel layer (OCH): Provides end-to-end networking function for service signals, and each optical channel OCH occupies one optical wavelength. Optical multiplexing section layer (OMS): Provides networking function for multi-wavelength signals after wavelength division multiplexing. Optical transmission section layer (OTS): Provides the function of transmitting optical signals on optical fibers. Its hierarchical architecture can adapt to changing service requirements. For example, precise fault troubleshooting can be carried out for different layers.

[0028] When dealing with cutover events, it is usually necessary to determine which cutover events will cause interruptions and find the minimum impact set among them (i.e., the fewest cutover events that cause line interruptions). This process requires traversing a large number of network paths, and the computational complexity is relatively high. Especially in large-scale networks, it is very difficult to find the combination of minimum cutover events. Aiming at the problems of incomplete conflict determination of cutover events and high computational complexity, the present disclosure proposes a hierarchical conflict determination method and device for cutover events based on a graph database. By using the hierarchical conflict determination method based on the graph database and combining the directed association relationship of the network topology, shortest path search, and hierarchical analysis, the problems of accuracy, complexity, and real-time performance of cutover event conflict determination in the traditional technology are solved.

[0029] Figure 1 Shows an exemplary flowchart of a hierarchical conflict determination method for cutover events based on a graph database according to an embodiment of the present disclosure.

[0030] Referring to Figure 1 As shown, at block S102 in method 100, network elements, ports, and channels are entered into the graph database as nodes, and a directed association relationship between the nodes is constructed according to the hierarchical routing data.

[0031] The cutover objects are channels, network elements, ports, hierarchical routes, etc. that participate in cutover event operations in the OTN network. To better manage and query network topology, relationships, and channel information, etc., the relationships of these cutover objects can be represented by a graph database. The core of a graph database is a graph structure, which consists of nodes, edges, and attributes, and is used to represent the relationships between entities. Graph traversal operations can be directly executed in the graph structure to quickly obtain all information related to nodes. Common graph databases are Neo4j, which has a powerful graph query language (Cypher); ArangoDB, OrientDB, which are multi-model databases that support graphs, documents, and key-value storage.

[0032] First, define the nodes and edges of the graph database. The nodes include channels, network elements, and ports, and the edges include the connection relationship or bearing relationship between nodes constructed based on hierarchical routes. A channel is a data stream transmitted through optical fibers in an optical transmission network. A network element is a network device (such as a router, switch, etc.), and a port is the physical interface through which these devices are connected to other devices. Hierarchical routing represents the path of data transmission in the network and is modeled according to a hierarchical structure.

[0033] In some embodiments of the present disclosure, data in a relational database can be synchronized to the graph database. The network element, port, and channel data stored in the relational database are incrementally synchronized to the graph database in node types, and directed connection relationships between ports, between ports and channels, between network elements and channels, and directed bearing relationships between channels are established according to the hierarchical routing data in the relational database.

[0034] For example, assuming that the network element data table contains fields such as network element ID and network element name, the following code is used to insert into the graph database (taking Neo4j as an example):

[0035] / / Query network element data (for example, the network element table in the relational database)

[0036] select s_ne_id,s_ne_name from t_trans_ne

[0037] / / Insert into the graph database

[0038] create (:t_trans_ne{s_ne_id:'s_ne_id',s_ne_name:'s_ne_name'})

[0039] In the same way, port data is synchronized from the relational database to the graph database, and each port is created as a node and includes relevant attributes (such as port ID, port name, affiliated network element ID, affiliated network element name, etc.). For example:

[0040] / / Query port data (e.g., port table in a relational database)

[0041] select s_port_id, s_port_name,s_ne_id,s_ne_name from t_trans_port

[0042] / / Insert into the graph database

[0043] create (:t_trans_port{s_port_id:'s_port_id', s_port_name:'s_port_name', s_ne_id:'s_ne_id',s_ne_name:'s_ne_name'})

[0044] Synchronize channel data from the relational database to the graph database, and create each channel as a node with related attributes (such as channel ID, channel name, channel type, etc.). For example:

[0045] / / Query channel data (e.g., channel table in a relational database)

[0046] select s_channel_id,s_channel_name,s_channel_type from t_channel

[0047] / / Insert into the graph database

[0048] create (:t_channel{s_channel_id:'s_channel_id',

[0049] s_channel_name:'s_channel_name' ,s_channel_type:'s_channel_type'})

[0050] The synchronization of hierarchical routing data involves converting the routing data in the relational database into directed edges (representing connection relationships) in the graph database. There are mainly four parts:

[0051] 1. The directed connection relationship between ports, which can be based on the port connection relationship in the routing table or device configuration. Assume that there is a hierarchical routing table t_snc_route in the relational database, which contains information such as the A-end port, A-end network element, Z-end port, Z-end port, the affiliated channel, sub-channel, etc. It can be synchronized in the following way:

[0052] / / Query the port connection information in the hierarchical routing data

[0053] select s_route_id, s_port_id_a, s_ne_id_a, s_port_id_z,

[0054] s_ne_id_z, s_channel_id, s_sub_channel_id from t_snc_route

[0055] / / Insert into the graph database to establish the connection relationship between ports

[0056] match (a:t_trans_port {s_port_id:'s_port_id_a'})

[0057] match (z:t_trans_port {s_port_id:'s_port_id_z'})

[0058] create (a)-[:t_snc_route]->(z)

[0059] 2. Directed connection relationship between ports and channels

[0060] Each port may carry different channels, representing the logical or physical relationship between channels and ports.

[0061] / / Query the relationship between ports and channels in the hierarchical routing data

[0062] select distinct s_port_id_a as s_port_id, s_channel_id from t_snc_route

[0063] select distinct s_port_id_z as s_port_id, s_channel_id from t_snc_route

[0064] / / Insert into the graph database to establish the connection relationship between ports and channels

[0065] match (port :t_trans_port {s_port_id:'s_port_id'})

[0066] match (channel: t_channel {s_channel_id:'s_channel_id'})

[0067] create (port )-[:t_port_to_channel]->(channel)

[0068] 3. Directed connection relationship between network elements and channels. Network elements usually connect to different channels through different ports.

[0069] / / Query the relationship between network elements and channels in the hierarchical routing data

[0070] select distinct s_ne_id_a as s_ne_id,s_channel_id from t_snc_route

[0071] select distinct s_ne_id_z as s_ne_id,s_channel_id from t_snc_route

[0072] / / Insert into the graph database to establish the connection relationship between network elements and channels

[0073] match (ne :t_trans_ne {s_ne_id:'s_ne_id'})

[0074] match (channel:t_channel{s_channel_id:'s_channel_id'})

[0075] create (ne )-[:t_ne_to_channel]->(channel)

[0076] 4. Directed bearer relationship between channels, indicating how one channel is borne by other channels.

[0077] / / Query the channel bearer relationship in the hierarchical routing data

[0078] select distinct s_channel_id,s_sub_channel_id from t_snc_route

[0079] / / Insert into the graph database to establish the bearer relationship between channels

[0080] match (parent:t_channel {s_channel_id:'s_channel_id'})

[0081] MATCH (child:t_channel {s_channel_id:'s_sub_channel_id'})

[0082] CREATE (parent)-[:t_carrier]->(child)

[0083] To ensure continuous data updates, incremental synchronization can be performed periodically or in real time. One can rely on the change data capture (CDC) mechanism of a relational database or use scheduled tasks (such as ETL tools) to capture updates and synchronize the changed data to the graph database.

[0084] Figure 2 A schematic diagram showing the construction of a graph database according to an embodiment of the present disclosure is presented. In Figure 2 the example, network element, port, and channel data are extracted from the relational database MYSQL and incrementally synchronized as nodes of the graph database to the graph database NEO4j. The hierarchical routing data in the relational database MYSQL is synchronized to the graph database NEO4j, and corresponding directed connection relationships are established based on the hierarchical routing data, specifically including: directed connection relationships between network elements and channels, between ports and channels, between ports and ports, and directed bearing relationships between channels and channels.

[0085] Return to Figure 1 , at block S104, based on the cutover object of the cutover event, find the target hierarchical channel associated with the cutover object in the graph database.

[0086] The cutover event will affect the routing structure of the network, and the specific affected paths and channels can be found through different types of cutover objects. When the cutover object is a network element, find the relationship between the network element and the channels, and identify each channel connected to the network element. Find the hierarchical channels related to the network element according to the directed connection relationship between the network element and the channels. When the cutover object is a port, find the relationship between the port and the channels, and find the corresponding hierarchical channels according to the directed connection relationship between the port and the channels. When the cutover object is a topology, find all the connection paths and channels under the topology ID according to the topology ID, and extract the relevant hierarchical channels from the hierarchical routing relationship.

[0087] Find the target hierarchical channel upward according to the relevant hierarchical channels. Among them, the target hierarchical channel can be a low-level channel such as the OCH level, OMS level, OTS level, etc., and perform buffer judgment analysis according to different service requirements. Specifically, if the level of the hierarchical channel is lower than the level of the target hierarchical channel, find the corresponding channel ID of the target hierarchical level upward according to the directed bearing relationship between channels. If the level of the hierarchical channel is greater than or equal to the level of the target hierarchical channel, directly record the hierarchical channel ID without further searching. These channel IDs are the target hierarchical channels affected by the cutover object.

[0088] Among them, the level of the target hierarchical channel can be any one of the OCH level, OMS level, OTS level, etc., and the target level is determined according to the actual network architecture. Through flexible selection between levels, the system can efficiently perform cutover buffer judgment at any network level.

[0089] Figure 3 is a schematic diagram of hierarchical channel aggregation according to an embodiment of the present disclosure. Refer to Figure 3 As shown, when the cutover object is a network element, find the relationship between the network element and the channel to find the corresponding hierarchical channel. When the cutover object is a port, find the relationship between the port and the channel to find the corresponding hierarchical channel. When the cutover object is a topology, find the hierarchical routing relationship according to the topology ID to find the corresponding hierarchical channel. If the level of the hierarchical channel is lower than the level of the target hierarchical channel, quickly find the corresponding target hierarchical channel ID upward according to the directed bearing relationship between channels. If the level of the hierarchical channel is greater than or equal to the level of the target hierarchical channel, record these channel IDs. Once the affected target hierarchical channels and the network paths they carry are determined, the routing topology diagram of the target hierarchical channels can be constructed.

[0090] Return Figure 1 As shown, in block S106, construct the routing topology diagram of the target hierarchical channel, perform the shortest path search based on the routing topology diagram, judge whether the line is interrupted and the minimum cutover event combination causing the interruption, and obtain the buffer judgment result of the target hierarchical channel.

[0091] In some embodiments of the present disclosure, according to the obtained set of channel IDs, obtain the hierarchical routing of each channel ID, start from the channel at the target hierarchical level or a level higher than the target hierarchical level, layer by layer converge the hierarchical routing of each channel, and perform primary-backup inheritance operations to obtain the full-path routing. Routing defines how channels are connected and data is transmitted in the network. When converging the routing, if there is a backup route (the main path is the main transmission path, and the backup path is used for fault tolerance. When the main path fails, the system will automatically switch to the backup path), backup path inheritance needs to be performed to ensure that all possible paths are considered. Finally, obtain the full-path routing of the channel, that is, the complete path information from the source end to the sink end.

[0092] Based on the full - path routing, taking ports as nodes and each routing segment as a directed connection between ports, a routing topology graph of the target - level channel is obtained. The graph data can be represented using an adjacency list or an adjacency matrix, and this routing topology graph is used for subsequent fault detection and cut - over conflict analysis.

[0093] Next, perform cut - over conflict judgment for the target - level channel. Adjust the routing topology graph according to the cut - over event, and remove the network elements, ports, and the points and connection lines in the topology related to the cut - over event. For example, for a network element associated with the cut - over event, delete the network element and the lines it is connected to (i.e., the relevant nodes and edges). If the cut - over event involves a certain port, remove the port and the lines it is connected to. If the cut - over event involves a certain topology, remove all relevant lines under that topology. At this time, the connection information in the graph will be adjusted to exclude the lines and nodes of the cut - over objects.

[0094] In the adjusted routing topology graph, determine whether there is a fault in the line, that is, determine whether there is a path between the source endpoint and the destination endpoint.

[0095] Specifically, through the Dijkstra algorithm, perform the shortest - path search from the source end to the destination end of the channel. If the shortest path is found, the forward line is normal; otherwise, the forward line is interrupted. If the forward line is interrupted, combine the cut - over events based on the minimum - set principle to find the minimum combination of cut - over objects that cause the interruption. Similarly, in the adjusted routing topology graph, through the Dijkstra algorithm, perform the shortest - path search from the destination port to the source port of the channel. If the shortest path is found, the reverse line is normal; otherwise, the reverse line is interrupted. If the reverse line is interrupted, combine the cut - over events based on the minimum - set principle to find the minimum combination of cut - over objects that cause the interruption.

[0096] Through the idea of "minimum set", only the most critical event combinations are considered, avoiding unnecessary calculations. By judging the conflict situation of each cutover event, it is determined which events are crucial for subsequent calculations, thereby reducing the amount of calculation. In some embodiments of the present disclosure, in order to find the minimum cutover object combination that causes an interruption, it can start from a combination element number of 1 and gradually increase the number of combination elements until the number of combination elements is equal to the total number of all cutover events associated with the current channel, including: in the first round, perform conflict judgment analysis on individual cutover events respectively, and record the events with conflicts; in the second round, analyze combinations of two events. According to the minimum set principle, judge whether the events with conflicts exist in the combination of two events. If so, eliminate the combination of two events where the conflict events exist, and continue to analyze other combinations of two events, and record the combinations of two events with conflicts; in the third round and subsequent rounds, according to the minimum set principle, judge whether the events or event combinations with conflicts exist in the combination of three events. If so, eliminate the combination of three events where the conflict events or event combinations exist, and continue to analyze other combinations of three events. Judge whether the events or event combinations with conflicts cover all the event combinations that need to be analyzed in this round. If so, skip the analysis of this round and subsequent higher-order event combinations.

[0097] Suppose there are three cutover events in the current channel. First, perform combinations of single events, then combinations of two events, and finally combinations of three events.

[0098] The first round: Conflict judgment analysis of individual cutover events

[0099] In the first round, perform conflict judgment analysis on individual cutover events (such as A, B, C, D, E) respectively. If a certain event (such as A) can already independently cause a line interruption or its own conflict, then the conflict of this event has been determined, and its combination check can be skipped to save computing resources. Suppose it is obtained that event A has a line interruption and its own conflict, while B, C, D, and E are okay. At this time, event A can already independently cause a conflict, and subsequent combinations can eliminate the checks related to A.

[0100] The second round: Combination analysis

[0101] In the second round, start checking combinations consisting of two events, such as AB, AC, AD, AE, BC, BD, BE, CD, CE, DE, etc. Judge whether there is a single event (such as A) in this combination that can already cause a conflict. If so, then the conflict of this combination has been determined, and the analysis of this combination can be directly skipped. For example, in the combinations of AB, AC, AD, and AE, if A alone causes a conflict, then these combinations do not need to be checked further. Their conflict results have been determined and no further calculation is required.

[0102] Continue to check other combinations, such as BC, BD, BE, CD, CE, DE. Assume that there are cutover conflicts in the BC and DE combinations, while there are no conflicts in BD, BE, and CE. Then, only the conflicts in the BC and DE combinations need to be recorded.

[0103] The third round and subsequent rounds: Higher-order combination analysis

[0104] In the third round and subsequent rounds, check combinations of three or more events (such as ABC, ABD, ABE, BCD, BCE, CDE, etc.). However, based on the principle of the minimum set, if the current minimum set (such as A, BC, DE) already covers all the event combinations that need to be detected, then the analysis of these higher-order combinations can be skipped. For example, the elements covered by the current minimum set: A, BC, DE already cover all sets, so it is not necessary to execute the third, fourth, and fifth rounds. Therefore, the number of cutover conflict analysis times is 5 + 6 + 0 = 11.

[0105] The calculation of the number of combinations is reduced through the optimization of the minimum set. For example, if the number of cutover events is 5, the number of combinations that originally needed to be calculated is:

[0106]

[0107] But due to the screening of the minimum set, only 11 calculations are needed, thus reducing the computational effort by approximately 181%. As the number of cutover events increases, the computational time required by the traditional exhaustive method (which needs to calculate a large number of combinations) will increase exponentially, while the minimum set method greatly reduces the number of combinations that need to be checked. Especially when the number of events is large, the saved computational resources and time are particularly significant.

[0108] For the event combinations that require cutover analysis, determine the set of cutover objects associated with them. These objects may include cutover ports, network elements, topologies, etc. Simulate the impact of the cutover event on the routing topology graph according to the set of cutover objects, and delete the network elements, ports, topologies related to the cutover event and their connected edges from the routing topology graph to obtain the adjusted subgraph.

[0109] Judge whether there is a path interruption in the subgraph. If the path is interrupted, it usually means that some ports, network elements, or topologies have failed, resulting in the inability to continue the data flow transmission. Then, select the source port or the sink port as the starting point to construct an interruption tree. The interruption tree starts from the starting port or network element and gradually expands to all possible interrupted paths until reaching the leaf nodes. Through the leaf nodes of the interruption tree, obtain the first set of conflict object combinations.

[0110] Among them, during the interruption determination process, the breadth-first search (BFS) algorithm can be used and combined with custom interruption conditions to determine whether the path is interrupted. To ensure the efficiency of the algorithm, it is stipulated that the nodes in the path cannot be accessed repeatedly, the depth of the tree is controlled during the traversal process to avoid unnecessary searches, and the following interruption conditions are added:

[0111] Cutover port or cutover network element: When the next-hop port or network element of the path belongs to the cutover object, the sink-end port or network element is added to the interruption object combination, and the search for this path is terminated.

[0112] Cutover topology: When the next segment in the path belongs to the cutover topology, if the sink-end port reaching this segment is part of the cutover topology, this topology is added to the interruption object combination, and the search for this path is terminated.

[0113] Figure 4 is a schematic diagram of the interruption tree structure according to an embodiment of the present disclosure. Refer to Figure 4 As shown, the interruption tree is a hierarchical structure, and each node of the tree represents an interruption source. The root node is selected according to the line judgment direction. Each time, the node with the smallest current distance is taken out of the queue, and the shortest distances of its adjacent nodes are updated. When the path is extended, it is necessary to check the next hop (port or network element) to determine whether the interruption condition is met. If the interruption condition is met, the extension is stopped, and the corresponding cutover port or network element is added to the interruption object combination. If the interruption condition is not triggered and this neighbor node has not been visited, this neighbor is added to the queue and marked as visited.

[0114] The interruption conditions include: when the next hop of the path belongs to the cutover port or network element, the sink-end port or network element is added to the interruption object combination, and the search for this path is terminated. When the next segment in the path belongs to the cutover topology, and all segments of the sink-end port reaching this segment are cutover topologies, this cutover topology is added to the interruption object combination, and the extension is stopped. Finally, the algorithm will traverse to the leaf nodes of the tree, and these leaf nodes form the first group of interruption object combinations, representing the key objects that cause the line interruption. Using the breadth-first search (BFS) for path extension can ensure that the search is terminated according to the custom interruption conditions each time, avoiding continued extension to inappropriate nodes. The Dijkstra algorithm is used to detect whether there is a shortest path between the source end and the sink end. If the Dijkstra algorithm cannot find an effective path, or the path involves the cutover part, the system will determine that the line is interrupted.

[0115] Finally, check whether all cutover event combinations have been traversed and analyzed. If so, end the process; otherwise, continue to analyze new cutover event combinations until all cutover event combinations have been analyzed. Record the target-level channel IDs, source ports and destination ports of the channels where cutover event conflicts exist, the forward and reverse line interruption judgment results, the associated cutover event IDs, and the minimum cutover object combination that causes the interruption.

[0116] Subsequently, in block S108, for the target-level channels with cutover event conflicts, look up the corresponding top-level service channels upward in the graph database.

[0117] In the graph database, service channels are divided into different levels. The target-level channels usually belong to a lower level, and it is necessary to look up the upper-level service channels to which the channels belong. When looking up upward, the top-level service channels associated with the target-level channels with cutover event conflicts can be found based on the bearing relationship of the channels.

[0118] When making a conflict determination for the top-level service channels, first prepare some basic data to ensure that whether there are conflicts between service channels can be analyzed through routing information. In some embodiments of the present disclosure, according to the bearing relationship between the service channels and the target-level channels, extract all relevant channel ID sets, and obtain the hierarchical routing of each channel. The hierarchical routing usually includes routing information at different levels and may have multiple intermediate nodes or routing segments.

[0119] Starting from the target-level channels, layer by layer converge the hierarchical routing of each level of channels and perform the primary and backup inheritance operation, that is, when an interruption or unavailability occurs in the primary route, automatically switch to the backup route, obtain the complete end-to-end route, and find the routing segment that bears the target-level channels in the end-to-end route. Take the ports as nodes, establish a directed connection between ports according to each routing segment to form a main graph, which can intuitively reflect the transmission paths between ports in the network.

[0120] Finally, in block S110, based on the conflict judgment result of the target-level channels, judge whether the lines of the top-level service channels are interrupted and the minimum cutover event combination that causes the interruption, and obtain the conflict judgment result of the top-level service channels.

[0121] In some embodiments of the present disclosure, use the ports and routing segments of the routes in the main graph to find the cutover events that match the cutover objects. That is, match the ports and routing segments in the main graph with the cutover objects (such as network elements, ports, topologies, etc.). The matching result will obtain the associated cutover events and determine which cutover events will affect the current route.

[0122] According to the routing segment of the main graph carrying the target layer channel and the conflict judgment result of the target layer channel obtained in step S106, the cutover event associated with the target layer channel is found. All the cutover events found by the above method are summarized as the final cutover event set.

[0123] Adjust the main diagram according to all the cutover events associated with the current channel, and remove the network elements, ports, and points and connecting lines in the topology related to the cutover events. For example, delete the network elements and related lines associated with the cutover events, delete the ports and related lines involved in the cutover events, and delete the lines related to the cutover topology. Get the target-level channel ID carried by the SNL routing segment in the main diagram, and map the line interruption status to the SNL routing segment of the main diagram according to the conflict judgment result of the target-level channel. The SNL routing segment is the channel as a routing segment. Therefore, the top-level channel cutover conflict judgment directly reuses the conflict judgment result of the target-level channel.

[0124] Determine the interruption of the line in the main graph: in the adjusted main graph, search for the shortest path from the source port to the sink port of the channel. If the shortest path is found, the forward line is normal, otherwise the forward line is interrupted; if the forward line is interrupted, the cutover events associated with the current channel are combined based on the minimum set principle to find the minimum cutover event combination that causes the interruption and the corresponding first group of interruption object combinations; in the adjusted main graph, search for the shortest path from the sink port to the source port of the channel. If the shortest path is found, the reverse line is normal, otherwise the reverse line is interrupted; if the reverse line is interrupted, the cutover events associated with the current channel are combined based on the minimum set principle to find the minimum cutover event combination that causes the interruption and the corresponding first group of interruption object combinations.

[0125] Specifically, the cutover events are combined. Initially, the number of combined elements is 1 and it gradually increases until the number of combined elements is equal to the total number of all cutover events. This includes: in the first round, buffer analysis is performed on individual cutover events respectively, and the events with conflicts are recorded; in the second round, two-event combinations are analyzed. According to the minimum set principle, it is judged whether the events with conflicts are in the two-event combinations. If so, the two-event combinations where the conflicting events exist are excluded, and other two-event combinations are continued to be analyzed, and the two-event combinations with conflicts are recorded; in the third round and subsequent rounds, according to the minimum set principle, it is judged whether the events or event combinations with conflicts are in the three-event combinations. If so, the three-event combinations where the conflicting events or event combinations exist are excluded, and other three-event combinations are continued to be analyzed. It is judged whether the events or event combinations with conflicts cover all the event combinations to be analyzed in this round. If so, the analysis of this round and higher-order event combinations in the future is skipped. According to the combination of cutover events, the relevant cutover object set (such as network elements, ports, topologies, etc.) is obtained. According to the cutover object set, the impact of cutover events on the routing topology graph is simulated, and the network elements, ports, topologies and their connected edges related to the cutover events are deleted from the routing topology graph. According to the cutover event combination, the impact of cutover operations on the target-level channel route segments is checked, and the forward and reverse line interruption situations of the target-level channel route segments are mapped to the corresponding SNL route segments in the main graph to ensure that the impact of cutover on the network is reflected in the main graph.

[0126] In the adjusted main graph, it is analyzed whether there is a path interruption. If the path is interrupted, the source port or the sink port is selected as the starting point to construct an interruption tree, and through the leaf nodes of the interruption tree, the first set of conflicting object combinations is obtained. If the conflicting objects include OCH segments, these conflicting objects are aggregated into the main graph.

[0127] It is judged whether all cutover event combinations have been analyzed. If so, the process ends. If not, the above steps are repeated, and new cutover event combinations are continued to be analyzed until all cutover event combinations have been analyzed, and the service channels with cutover conflicts and their interruption situations, the corresponding minimum cutover event combinations, and the first set of conflicting object combinations corresponding to the cutover event combinations are output.

[0128] Figure 5 It is a schematic block diagram of a cutover event hierarchical buffer judgment device based on a graph database according to an embodiment of the present disclosure. As Figure 5 shown, the device 500 may include a processor 510 and a memory 520 storing a computer program. When the computer program is executed by the processor 510, the device 500 can execute as Figure 1Steps of the method shown. In one example, the apparatus 500 may be a computer device or a cloud computing node. The apparatus 500 may enter network elements, ports, and channels as nodes into the graph database and construct a directed association relationship between the nodes according to the hierarchical routing data; find the target hierarchical channel associated with the cutover object in the graph database according to the cutover object of the cutover event; construct a routing topology graph of the target hierarchical channel, perform a shortest path search based on the routing topology graph, determine whether the line is interrupted and the minimum cutover event combination causing the interruption, and obtain the conflict judgment result of the target hierarchical channel; for the target hierarchical channel with cutover event conflicts, look up the corresponding top-level service channel upward in the graph database; and based on the conflict judgment result of the target hierarchical channel, determine whether the line of the top-level service channel is interrupted and the minimum cutover event combination causing the interruption, and obtain the conflict judgment result of the top-level service channel.

[0129] In an embodiment of the present disclosure, the processor 510 may be, for example, a central processing unit (CPU), a microprocessor, a digital signal processor (DSP), a processor based on a multi-core processor architecture, etc. The memory 520 may be any type of memory implemented using data storage technology, including but not limited to random access memory, read-only memory, semiconductor-based memory, flash memory, disk memory, etc.

[0130] In addition, in an embodiment of the present disclosure, the apparatus 500 may also include an input device 530, such as a keyboard, a mouse, etc., for inputting cutover events and cutover objects. Additionally, the apparatus 500 may further include an output device 540, such as a display, etc., for outputting the service channel IDs with conflicts, the minimum cutover event conflict set corresponding to the corresponding service channels, and the minimum cutover object combination of the first group of interruptions.

[0131] In other embodiments of the present disclosure, there is also provided a computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, can implement the steps of the cutover event hierarchical conflict judgment method based on a graph database as Figure 1 shown.

[0132] In summary, according to the cutover event hierarchical conflict judgment method and device based on a graph database according to an embodiment of the present disclosure, by storing channels, network elements, and ports as node objects in the graph database and maintaining the bearer relationship between channels at the same time, the bearer relationship from the top-level channel to any-level bottom-level channel or from the bottom-level channel to any upper-level channel can be found more quickly. Especially when dealing with complex network topologies, the speed of data retrieval and analysis is greatly improved. By constructing a routing topology graph of the target-level channel and performing a shortest path search, it is possible to effectively determine whether the line is interrupted and accurately find the minimum cutover event combination that causes the interruption, optimize the cutover event analysis process, quickly locate the minimum impact set, reduce the computational overhead, and improve the conflict judgment efficiency. Further, starting from the relatively lower target level for cutover conflict judgment, and searching for the top-level channel upward for the hierarchical channels with cutover event conflicts, the conflict judgment results of the target-level channel can be directly reused. Compared with the top-down method, unnecessary combinatorial analysis is avoided, redundant calculations are reduced, and rapid response and results can be ensured in a large-scale network environment.

[0133] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of devices and methods according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a segment of a program, or a part of an instruction, and the module, the segment of the program, or the part of the instruction contains one or more executable instructions for implementing the specified logical function. In some alternative implementations, the functions noted in the blocks may occur in a different order than that noted in the accompanying drawings. For example, two consecutive blocks may actually be executed substantially in parallel, or they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and combinations of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or actions, or can be implemented by a combination of dedicated hardware and computer instructions.

[0134] Unless the context clearly dictates otherwise, the singular forms of words used in this specification and the appended claims include the plural, and vice versa. Thus, when referring to the singular, the corresponding plural is generally included. Similarly, the terms "comprising" and "including" will be interpreted as inclusive rather than exclusive. Likewise, the term "including" and "or" should be interpreted as inclusive, unless expressly prohibited by the context of this document. Where the term "example" is used in this document, particularly when it follows a list of terms, the "example" is merely illustrative and explanatory and should not be considered exclusive or extensive.

[0135] Further aspects and scope of adaptability will become apparent from the description provided herein. It should be understood that the various aspects of the present application can be implemented individually or in combination with one or more other aspects. It should also be understood that the description and specific examples herein are for illustrative purposes only and are not intended to limit the scope of the present application.

[0136] The above has described in detail several embodiments of the present disclosure. Obviously, those skilled in the art can make various modifications and variations to the embodiments of the present disclosure without departing from the spirit and scope of the present disclosure. The protection scope of the present disclosure is defined by the appended claims.

Claims

1. A hierarchical conflict judgment method for cutover events based on a graph database, characterized in that, include: Enter network elements, ports, and channels as nodes into the graph database, and build directed associations between nodes based on hierarchical routing data; According to the cutover object of the cutover event, searching the graph database for a target hierarchical channel associated with the cutover object; Constructing a routing topology map of the target layer channel, performing a shortest path search based on the routing topology map, determining whether the line is interrupted and the minimum cutover event combination that causes the interruption, and obtaining a conflict judgment result of the target layer channel; For the target layer channel with the cutover event conflict, the corresponding top-level service channel is searched upward in the graph database; as well as Based on the collision judgment result of the target layer channel, it is determined whether the line of the top-level service channel is interrupted and the minimum cutover event combination causing the interruption, and the collision judgment result of the top-level service channel is obtained.

2. The cutover event hierarchical judgment and conflict resolution method based on a graph database according to claim 1, characterized in that The step of entering the network elements, ports, and channels as nodes into the graph database and constructing directed association relationships between the nodes according to the hierarchical routing data includes: The network element, port, and channel data stored in the relational database are incrementally synchronized to the graph database as node types. Based on the hierarchical routing data in the relational database, directed connection relationships between ports, between ports and channels, between network elements and channels, and directed bearing relationships between channels are established.

3. The cutover event hierarchical judgment and conflict resolution method based on a graph database according to claim 2, wherein The searching, in the graph database, for a target level channel associated with the cutover object according to the cutover event comprises: When the cutover object is a network element, the hierarchical channel connected to the network element is searched according to the directed connection relationship between the network element and the channel; When the cutover object is a port, the corresponding hierarchical channel is found according to the directed connection relationship between the port and the channel; When the cutover object is a topology, the related hierarchical routes are searched according to the topology ID, and all hierarchical channels passing through the topology are found from the hierarchical routes; If the level of the hierarchical channel is lower than the level of the target level channel, then the corresponding target level channel ID is found upwards according to the directed bearing relationship between channels. If the level of the hierarchical channel is greater than or equal to the level of the target level channel, then the hierarchical channel ID is directly recorded. The level of the target level channel is any one of the OCH level, OMS level, and OTS level.

4. The cutover event hierarchical judgment and conflict resolution method based on a graph database according to claim 3, wherein, The step of constructing a routing topology map of the target layer channel, searching for the shortest path based on the routing topology map, determining whether the line is interrupted and the minimum cutover event combination that causes the interruption, and obtaining the target layer channel interruption judgment result includes: According to the obtained channel ID set, the hierarchical route of each channel ID is obtained, and the hierarchical route of each channel is aggregated layer by layer, starting from the channel level of the target level or the channel level greater than the channel level of the target level, and the master-slave inheritance operation is performed to obtain the full route; Based on the full route, ports are taken as nodes, and each routing segment is taken as a directed connection between ports to obtain a routing topology diagram of a target hierarchical channel; Adjust the routing topology map according to the cutover event, and remove network elements, ports, and points and connection lines in the topology related to the cutover event; In the adjusted routing topology diagram, perform a shortest path search from the source port to the destination port of the channel. If the shortest path is found, the forward line is normal; otherwise, the forward line is interrupted. If the forward line is interrupted, combine the cutover events based on the minimum set principle to find the minimum cutover object combination that causes the interruption. In the adjusted routing topology diagram, perform a shortest path search from the destination port to the source port of the channel. If the shortest path is found, the reverse line is normal; otherwise, the reverse line is interrupted. If the reverse line is interrupted, combine the cutover events based on the minimum set principle to find the minimum cutover object combination that causes the interruption; and Record the target level channel ID, channel source port and destination port where cutover event conflicts exist, the forward and reverse line interruption judgment results, the associated cutover event ID, and the minimum cutover object combination that causes the interruption.

5. The cutover event hierarchical judgment and conflict resolution method based on a graph database according to claim 4, wherein The combining of cutover events based on the minimum set principle to find the minimum cutover object combination that causes the interruption includes: Combine all cutover events associated with the current channel, starting from a combination element count of 1 and up to the total number of cutover events associated with the current channel. This includes: in the first round, perform conflict judgment analysis on each individual cutover event and record the conflicting events; in the second round, analyze combinations of two events. According to the minimum set principle, determine whether the conflicting events are in the two-event combination. If so, eliminate the two-event combination in which the conflicting events exist and continue to analyze other two-event combinations, recording the two-event combinations with conflicts; in the third round and subsequent rounds, according to the minimum set principle, determine whether the conflicting events or event combinations are in the three-event combination. If so, eliminate the three-event combination in which the conflicting events or event combinations exist and continue to analyze other three-event combinations. Determine whether the conflicting events or event combinations cover all the event combinations to be analyzed in this round. If so, skip the analysis of this round and higher-order event combinations in the future. For the event combination that requires cutover analysis, determine the set of cutover objects related to it. Simulate the impact of the cutover event on the routing topology diagram according to the set of cutover objects, delete the network elements, ports, topologies and their connected edges related to the cutover event from the routing topology diagram to obtain the adjusted subgraph. Judge whether there is an interruption in the path in the subgraph. If the path is interrupted, select the source port or the destination port as the starting point to construct an interruption tree, and obtain the first set of conflicting object combinations through the leaf nodes of the interruption tree; and Check whether all cutover event combinations have been traversed and analyzed. If so, end; if not, continue to analyze new cutover event combinations until all cutover event combinations have been analyzed.

6. The cutover event hierarchical conflict judgment method based on a graph database according to claim 1, wherein Before obtaining the judgment result of the top-level service channel on whether the line is interrupted and the minimum cutover event combination that causes the interruption based on the conflict judgment result of the target level channel, the method includes: Extract all relevant channel ID sets according to the bearing relationship from the service channel to the target level channel, and obtain the hierarchical routing of each channel. Starting from the target hierarchical channel, layer by layer converge the hierarchical routing of each hierarchical channel, and perform the primary and standby inheritance operation to obtain the complete end-to-end routing, and find the routing segment carrying the target hierarchical channel in the end-to-end routing; Taking the ports as nodes, establish a directed connection between ports according to each routing segment to form a main graph.

7. The cutover event hierarchical judgment and conflict resolution method based on a graph database according to claim 6, wherein The judging the line interruption of the top-level service channel and the minimum cutover event combination causing the interruption based on the buffer judgment result of the target hierarchical channel, the obtained buffer judgment result of the top-level service channel includes: Match the ports, routing segments in the main graph with the cutover objects to find the cutover events associated with the main graph; According to the routing segment carrying the target hierarchical channel and the buffer judgment result of the target hierarchical channel, find the cutover events associated with the target hierarchical channel; Adjust the main graph according to all the cutover events associated with the current channel, and remove the network elements, ports and the points and connection lines in the topology related to the cutover events; Obtain the ID of the target hierarchical channel carried by the SNL routing segment in the main graph, and map the line interruption status to the SNL routing segment of the main graph according to the buffer judgment result of the target hierarchical channel; In the adjusted main graph, perform the shortest path search from the source port to the sink port of the channel. If the shortest path is found, the forward line is normal, otherwise the forward line is interrupted; If the forward line is interrupted, then combine the cutover events associated with the current channel based on the minimum set principle, find the minimum cutover event combination causing the interruption and the corresponding first set of interrupted object combinations; In the adjusted main graph, perform the shortest path search from the sink port to the source port of the channel. If the shortest path is found, the reverse line is normal, otherwise the reverse line is interrupted; If the reverse line is interrupted, then combine the cutover events associated with the current channel based on the minimum set principle, find the minimum cutover event combination causing the interruption and the corresponding first set of interrupted object combinations.

8. The cutover event hierarchical judgment and conflict resolution method based on a graph database according to claim 7, wherein The combining the cutover events associated with the current channel based on the minimum set principle, finding the minimum cutover event combination causing the interruption and the corresponding first set of interrupted object combinations includes: Combine the cutover events, starting from the combination element number of 1 until the combination element number is equal to the total number of cutover events. Among them, in the first round, perform buffer judgment analysis on each single cutover event respectively, and record the conflicting events; in the second round, analyze the combination of two events. According to the minimum set principle, judge whether the conflicting events are in the combination of two events. If so, remove the combination of two events where the conflicting events exist, and continue to analyze other combinations of two events, and record the combination of two events where the conflicting events exist; in the third round and subsequent rounds, according to the minimum set principle, judge whether the conflicting events or event combinations are in the combination of three events. If so, remove the combination of three events where the conflicting events or event combinations exist, and continue to analyze other combinations of three events. Judge whether the conflicting events or event combinations cover all the event combinations to be analyzed in this round. If so, skip the analysis of this round and subsequent higher-order event combinations; For the event combinations that need cutover analysis, determine the set of cutover objects related to them; Simulate the impact of the cutover event on the routing topology diagram according to the set of cutover objects, and delete the network elements, ports, topologies and their connected edges related to the cutover event from the routing topology diagram; According to the cutover event combination, check the impact of the cutover operation on the target-level channel route segment, and map the forward and reverse line interruption situations of the target-level channel route segment to the corresponding SNL route segment in the main diagram; Determine whether there is an interruption in the path in the main diagram. If the path is interrupted, select the source port or the sink port as the starting point, construct an interruption tree, and obtain the first set of conflicting object combinations through the leaf nodes of the interruption tree; Check whether all cutover event combinations have been traversed and analyzed. If it is completed, end. If not, continue to analyze new cutover event combinations until all cutover event combinations have been analyzed, and output the service channels with cutover conflicts and their interruption situations, the corresponding minimum cutover event combination, and the first set of conflicting object combinations corresponding to the cutover event combination.

9. A cutover event hierarchical conflict judgment device based on a graph database, characterized in that, The device includes: At least one processor; and At least one memory storing a computer program; Wherein, when the computer program is executed by the at least one processor, the device is caused to execute the steps of the cutover event hierarchical conflict judgment method based on a graph database according to any one of claims 1 to 8.

10. A computer-readable storage medium storing a computer program, characterized in that, The computer program, when executed by a processor, implements the steps of the cutover event hierarchical conflict judgment method based on a graph database according to any one of claims 1 to 8.

Images