Fault severity determination method, device, equipment and storage medium
By building a ring-free space topology map and determining the fault type, the root cause location difficulty caused by failure correlation in the microservice architecture is solved, and the accuracy and efficiency of fault location are improved.
Patent Information
- Application Number
- CN202211711048.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-12-29
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2042-12-29
AI Technical Summary
In microservice architecture systems, multiple correlations between faults lead to increased difficulty in positioning the fault root cause, reducing the accuracy of the fault root cause location results.
By obtaining the relationship data of the nodes to which the fault belongs, a ring-free space topology diagram is built, and based on the time correlation algorithm and spatial topology algorithm, the types of survival faults and new faults are determined, noise is reduced, and the accuracy of fault root cause positioning is improved.
It reduces the noise caused by concurrency of multiple faults, reduces the difficulty of positioning the root cause of faults, improves the accuracy of the positioning results of the root cause of faults, and only analyzes the main faults, which improves the efficiency of positioning the root cause of faults.
Smart Images

Figure CN116032736B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of Internet communication technology, and in particular to a method, device, equipment and storage medium for determining the severity of a fault. Background Art
[0002] With the increasing popularity of microservice architecture systems, many large enterprises and data centers have transformed their application systems into microservice architectures. While microservice architecture brings convenience to the operation stability and functional robustness of application systems, it also brings great challenges to system operation and maintenance in locating the root cause of faults.
[0003] At present, although the method of locating the root cause of faults under the microservice architecture based on artificial intelligence algorithm has the characteristics of automatic calculation, rapid discovery and instant notification, the various correlations between faults, including temporal correlation and topological structure correlation, bring a lot of noise to the root cause location, increase the difficulty of fault root cause location, and reduce the accuracy of the fault root cause location results. Summary of the invention
[0004] The present invention provides a method, device, equipment and storage medium for determining the main severity of a fault, so as to reduce the noise caused by the concurrence of multiple faults, reduce the difficulty of locating the root cause of the fault, and improve the accuracy of the result of locating the root cause of the fault.
[0005] According to one aspect of the present invention, a method for determining the severity of a fault is provided, comprising:
[0006] Get the relationship data of the node to which the fault belongs;
[0007] According to the relationship data, a spatial topology graph of the node to which the fault belongs is constructed; wherein the spatial topology graph is an acyclic graph;
[0008] Based on the time correlation algorithm, the faults in the spatial topology graph are judged and the survivable faults are determined;
[0009] New faults are acquired, and the types of surviving faults and new faults are determined based on a spatial topology algorithm.
[0010] According to another aspect of the present invention, there is provided a device for determining the main severity of a fault, comprising:
[0011] A relational data acquisition module is used to acquire relational data of the node to which the fault belongs;
[0012] A spatial topology map construction module is used to construct a spatial topology map of the node to which the fault belongs based on the relationship data; wherein the spatial topology map is an acyclic graph;
[0013] A survivable fault determination module is used to determine the faults in the spatial topology graph based on a time correlation algorithm and determine the survivable faults;
[0014] The fault type determination module is used to obtain new faults and determine the types of surviving faults and new faults based on a spatial topology algorithm.
[0015] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:
[0016] at least one processor; and
[0017] a memory communicatively connected to at least one processor; wherein,
[0018] The memory stores a computer program that can be executed by at least one processor. The computer program is executed by at least one processor so that the at least one processor can execute the method for determining the severity of a fault according to any embodiment of the present invention.
[0019] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the method for determining the primary and secondary severity of a fault according to any embodiment of the present invention when executed.
[0020] The technical solution of the embodiment of the present invention obtains the relationship data of the nodes to which the fault belongs; constructs a spatial topology map of the nodes to which the fault belongs based on the relationship data; wherein the spatial topology map is an acyclic graph; determines the faults in the spatial topology map based on the time association algorithm to determine the surviving faults; obtains new faults, and determines the types of surviving faults and new faults based on the spatial topology algorithm. The above technical solution constructs a spatial topology map using the relationship data of the nodes to which the fault belongs, and determines the surviving faults in the spatial topology map based on the time association algorithm, thereby reducing the number of faults in the subsequent root cause location process; at the same time, the types of new faults and surviving faults are determined based on the spatial topology algorithm, further reducing the number of faults in the root cause location process, only analyzing the main faults, reducing the noise caused by the concurrence of multiple faults, reducing the difficulty of locating the root cause of the fault, and improving the accuracy of the root cause location result.
[0021] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0023] Figure 1A This is a flow chart of a method for determining the main severity of a fault provided according to Embodiment 1 of the present invention;
[0024] Figure 1B A spatial topological diagram of a node to which a fault belongs provided according to the first embodiment of the present invention;
[0025] Figure 2A This is a flow chart of a method for determining the main severity of a fault provided according to Embodiment 2 of the present invention;
[0026] Figure 2B A spatial topology diagram of a node to which a fault belongs provided according to Embodiment 2 of the present invention;
[0027] Figure 3 is a structural schematic diagram of a device for determining the main severity of a fault provided according to Embodiment 3 of the present invention;
[0028] Figure 4 It is a structural schematic diagram of an electronic device for implementing the method for determining the main severity of a fault according to an embodiment of the present invention. DETAILED DESCRIPTION
[0029] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0030] It should be noted that the terms "target", "starting", "mainly" and "repeated" in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0031] In addition, it should be noted that in the technical solution of the present invention, the collection, storage, use, processing, transmission, provision and disclosure of the relationship data of the nodes to which the faults belong are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.
[0032] Embodiment 1
[0033] Figure 1A This is a flowchart of a method for determining the severity of a fault provided in the first embodiment of the present invention. This embodiment is applicable to the situation where the root cause of a fault is located after a fault occurs in a microservice architecture, and is particularly applicable to the situation where the root cause of a fault is located based on an artificial intelligence algorithm after a fault occurs in a microservice architecture. This method can be performed by a device for determining the severity of a fault, which can be implemented in the form of hardware and / or software and can be configured in an electronic device, which can be a server. Figure 1A As shown, the method includes:
[0034] S101: Obtain relationship data of the node to which the fault belongs.
[0035] The relationship data may refer to data of association relationships between nodes to which the fault belongs. The type of the node to which the fault belongs may be one of a host node, a process node, a container node, a service node, etc. The association relationships between nodes to which the fault belongs may include a call relationship, a composition relationship, an inclusion relationship, a dependency relationship, a connection relationship, and an operation relationship, etc.
[0036] Specifically, the relational data of the node to which the fault belongs is obtained from the source database. The source database is used to store the relational data of the node to which the fault belongs, and can be one of a configuration management database, a relational database, and a non-relational database. It should be noted that since the source of the relational data of the node to which the fault belongs is not uniform, the source database is not specifically limited.
[0037] Exemplarily, if the relationship data of the node to which the fault belongs is stored in a configuration management database (CMDB), the relationship data of the node to which the fault belongs is obtained from the CMDB.
[0038] For example, if the relational data of the node to which the fault belongs is stored in a relational database (such as MySQL), the relational data of the node to which the fault belongs is obtained from the relational database. Taking the relational data of the node to which the fault belongs as stored in MySQL as an example, the specific storage structure is shown in the following table:
[0039] Starting Node ID Starting Node Name Relationship Target node ID Target node name 123 Host 123 Include 456 Container 456 678 Host 678 connect 123 Host 123 245 Process 245 rely 456 Container 456 456 Container 456 run 890 Service 890 890 Service 890 Call 789 Service 789
[0040] The relationship data of the node to which the fault belongs includes the ID (Identity document) of the starting node, the ID of the target node, the name of the starting node, the name of the target node, and the association between the nodes. The ID of the node to which the fault belongs is used to uniquely represent a node to which the fault belongs. A row of data in the table represents the relationship data between nodes to which a fault belongs. For example, 123 contains 456, which means that host 123 contains container 456. The starting node and the target node can be pre-set as needed.
[0041] Exemplarily, if the relational data of the node to which the fault belongs is stored in a non-relational database (such as MongoDB, ElasticSearch, and Redis), the relational data of the node to which the fault belongs is obtained from the non-relational database.
[0042] Optionally, the relationship between the nodes to which the fault belongs is extracted from the pre-existing fault alarm data and stored in the source database; the relationship data of the nodes to which the fault belongs is obtained from the source database. Exemplarily, the pre-existing call chain data is manually combed or a preset extraction algorithm is used to extract the relationship data of the nodes to which the fault belongs and store it in the configuration management database; the relationship data of the nodes to which the fault belongs is obtained from the configuration management database.
[0043] S102: construct a spatial topology graph of the node to which the fault belongs based on the relationship data; wherein the spatial topology graph is an acyclic graph.
[0044] The spatial topology graph includes faults, nodes to which faults belong, and the association between the nodes to which faults belong. The spatial topology graph can be a directed graph, where the edge from one fault node to another fault node is directed; it can also be an undirected graph, where the edge from one fault node to another fault node is undirected, indicating that there is an association between the two fault nodes; it can also be a bidirectional graph, where the edge from one fault node to another fault node is bidirectional, indicating that the two fault nodes are mutually dependent.
[0045] The spatial topology graph is an acyclic graph, that is, starting from any node in the spatial topology graph and walking along any path will not return to the node to which the fault belongs. This avoids the occurrence of an infinite loop when the spatial topology graph is used to determine the severity of the fault.
[0046] Specifically, based on the name of the starting node, the name of the target node and the association relationship between them in the relationship data, a spatial topology map of the nodes to which the fault belongs is constructed. In this way, the association relationship between faults and the propagation between faults can be clearly expressed, which enhances the interpretability of the subsequent root cause location of the fault.
[0047] Take the relationship data of the node to which the fault belongs stored in MySQL as an example, see Figure 1B , according to the name of the starting node, the name of the target node and the association relationship between them in the relationship data, a directed spatial topology graph of the node to which the fault belongs is constructed. The starting node is host 678, the target node is host 123, and the association relationship between them is a connection relationship. A directed edge from host 678 to host 123 is constructed, and this directed edge indicates that host 678 is connected to host 123. Similarly, according to the relationship data of the node to which the fault belongs stored in MySQL, a directed edge is constructed between host 123, container 456, process 245, service 890 and service 789, and finally the result is Figure 1B A directed spatial topological graph in .
[0048] S103: Based on the time correlation algorithm, the faults in the spatial topology graph are judged to determine the survivable faults.
[0049] Among them, the time correlation algorithm may refer to an algorithm for performing correlation calculation on faults based on the time when the faults occur in the spatial topology map, and is used to screen the faults in the spatial topology map to obtain surviving faults. It should be noted that screening the faults in the spatial topology map refers to dividing the faults in the spatial topology map into surviving faults and extinct faults, and removing the extinct faults from the preset fault pool to obtain surviving faults. Surviving faults may refer to faults that occur within a certain time period. Correspondingly, extinct faults may refer to faults that have been processed or have not occurred within a certain time period. Among them, the certain time period can be preset as needed. It should be noted that the faults in the spatial topology map are stored in a preset fault pool by default. Among them, the fault pool may be one of a memory block, a queue, a stack, and a database, which is used to temporarily or permanently store faults in the spatial topology map.
[0050] Specifically, based on the time correlation algorithm, the faults in the spatial topology map are judged, and the faults in the spatial topology map are divided into surviving faults and extinct faults, and the extinct faults are removed from the pre-set fault pool. This facilitates the subsequent determination of the severity of the fault based on the surviving faults, reduces the number of faults in the process of fault severity determination, and improves the efficiency of fault severity determination.
[0051] Optionally, a weighted sum is determined according to the fault importance, fault occurrence time and fault end time in the spatial topology map; the weighted sum is compared with a weighted sum threshold, and if the weighted sum is greater than the weighted sum threshold, the fault in the spatial topology map is determined to be a survivable fault.
[0052] Among them, the fault importance is used to indicate the importance of the fault to the root cause location of the fault, denoted as Importance. The fault importance can be obtained from the fault importance corresponding to the pre-set fault level. Among them, the fault level can include: 1 (fatal problem), 2 (serious problem), 3 (general problem) and 4 (minor problem). Accordingly, when the fault level is preset to 1, the fault importance is 9; when the fault level is 2, the fault importance is 7; when the fault level is 3, the fault importance is 5; when the fault level is 4, the fault importance is 2. The fault occurrence time may refer to the time when the fault starts, denoted as T start Correspondingly, the fault end time can refer to the time when the fault disappears, recorded as T end The weighted sum can refer to the sum of the weight of the fault importance, the weight of the fault occurrence time, and the weight of the fault duration. Among them, the fault duration can refer to the difference between the fault end time and the fault occurrence time. The weighted sum threshold is used to detect whether the weighted sum is too small to determine the surviving fault. The weighted sum threshold can be set according to manual experience or calculated by a special algorithm, denoted as T h .
[0053] Specifically, for each fault in the spatial topology graph, according to the fault importance, fault occurrence time T start And the fault end time T end , the weighted sum is determined by the following formula:
[0054] S=W1*Importance+W2*(T now -T start )+W3*(T end -T start );
[0055] Where S represents the weighted sum, W1 represents the weight of the fault importance, W2 represents the weight of the fault occurrence time, W3 represents the weight of the fault duration, and T now Indicates the current time.
[0056] Then, the weighted sum S and the weighted sum threshold T h Compare, if the weighted sum is greater than the weighted sum threshold, that is, S>T h , then the fault is determined to be a survival fault; otherwise, the fault is determined to be a death fault and removed from the preset fault pool. Similarly, all the survival faults in the spatial topology graph can be obtained.
[0057] It can be understood that the weighted sum is determined according to the fault importance, fault occurrence time and fault end time in the spatial topology map; the surviving fault is determined according to the weighted sum, which fully considers the influence of the fault occurrence time, fault end time and fault importance on the root cause location of the fault, making the determination of the surviving fault more accurate, thereby improving the accuracy of the fault severity judgment based on the surviving fault; at the same time, the number of faults in the subsequent fault root cause location process is reduced, thereby improving the efficiency of root cause location.
[0058] Optionally, a time difference between the first occurrence time of the fault in the spatial topology map and the current time is calculated, and if the time difference is less than or equal to a survival time threshold, the fault in the spatial topology map is determined to be a survival fault.
[0059] The first occurrence time of a fault may refer to the time when the fault first occurs. The survival time threshold is used to detect whether the fault exists for too long to determine the survival fault. The survival time threshold can be set based on manual experience or calculated by a special algorithm, denoted as T. For each fault in the spatial topology map, the time difference may refer to the difference between the current time and the first occurrence time of the fault, denoted as dT, and dT>0.
[0060] Specifically, faults in the spatial topology graph are determined one by one at regular intervals, and the time difference (dT) between the first occurrence time of each fault and the current time is calculated; this time is compared with the survival time threshold; if the time difference is less than or equal to the survival time threshold, i.e., dT ≤ T, then the fault is determined to be a surviving fault; otherwise, the fault is determined to be a perished fault and removed from the preset fault pool. Herein, the regular interval can be preset as needed, such as 1 minute (min).
[0061] It can be understood that determining the surviving faults in the spatial topology graph based on the first occurrence time of the faults and the current time in the spatial topology graph ensures that the faults in the spatial topology graph are those that have occurred in the most recent period of time, making the determination of surviving faults more accurate, and thus improving the accuracy of determining the main severity of faults based on surviving faults; at the same time, it reduces the number of faults in the subsequent fault root cause location process, and thus improves the efficiency of root cause location.
[0062] Optionally, obtain the number of times a fault occurs in the spatial topology graph within a period of time before the current time. If this number is greater than or equal to the number threshold, then determine the fault in the spatial topology graph to be a surviving fault.
[0063] Herein, the period of time can be preset as needed, such as 1 hour (h). If the current time is t and the period of time is 1 h, then the period of time before the current time is t - 1 h. The number threshold is used to detect whether the number of times a fault occurs in the spatial topology graph within a period of time before the current time is too small to determine a surviving fault. The number threshold can be set according to manual experience or calculated through a dedicated algorithm, denoted as f, such as f = 2.
[0064] Specifically, for each fault in the spatial topology graph, obtain the number of times the fault occurs within a period of time before the current time; compare this number with the number threshold. If this number is greater than or equal to the number threshold, then determine the fault to be a surviving fault; otherwise, determine the fault to be a perished fault and remove the fault from the preset fault pool. Similarly, all surviving faults in the spatial topology graph can be obtained.
[0065] Exemplarily, if f = 2, and there are fault 1, fault 2, and fault 3 in the spatial topology graph; obtain the number of times fault 1 occurs f1 = 2, the number of times fault 2 occurs f2 = 3, and the number of times fault 3 occurs f3 = 1 within 1 h before the current time; compare f1, f2, and f3 with the number threshold respectively, and get f1 = f, f2 > f, f3 < f. Then determine that fault 1 and fault 2 in the spatial topology graph are surviving faults, and fault 3 is a perished fault, and remove fault 3 from the preset fault pool.
[0066] It can be understood that the more times a fault occurs in the spatial topology diagram within a period of time before the current time, the more important the fault is to the subsequent root cause location of the fault. In this way, the surviving fault is determined, making the determination of the surviving fault more accurate, thereby improving the accuracy of the fault severity judgment based on the surviving fault; at the same time, the number of faults in the subsequent fault root cause location process is reduced, thereby improving the efficiency of root cause location.
[0067] S104: Obtain a new fault, and determine the types of surviving faults and new faults based on a spatial topology algorithm.
[0068] Among them, a new fault may refer to a newly occurring fault. A spatial topology algorithm may refer to an algorithm that performs calculations with the aid of associations between nodes to which the fault belongs in a spatial topology graph. The types of faults may include major faults and repeated faults. It should be noted that the default type of a new fault is a major fault. A major fault may refer to a fault that has a great impact on the location of the root cause of the fault. Correspondingly, a repeated fault may refer to a fault that has a small impact on the location of the root cause of the fault compared to a major fault.
[0069] Specifically, a new fault is acquired through a pre-set fault acquisition method; and based on the spatial topology algorithm, a loop traversal method is used to determine the new fault and the surviving faults in the spatial topology map one by one, and the types of the surviving faults and the new fault in the spatial topology map are determined. The number of faults in the process of fault root cause location is reduced, and only the main faults are analyzed, which reduces the interference of repeated faults on fault root cause location, improves the calculation speed of subsequent fault root cause location, and thus improves the efficiency of subsequent fault root cause location. Among them, the pre-set fault acquisition method can be a Kafka (distributed publish-subscribe message queue system) method or an interface transmission method.
[0070] The technical solution of the embodiment of the present invention obtains the relationship data of the nodes to which the fault belongs; constructs a spatial topology map of the nodes to which the fault belongs based on the relationship data; wherein the spatial topology map is an acyclic graph; determines the faults in the spatial topology map based on the time association algorithm to determine the surviving faults; obtains new faults, and determines the types of surviving faults and new faults based on the spatial topology algorithm. The above technical solution constructs a spatial topology map using the relationship data of the nodes to which the fault belongs, and determines the surviving faults in the spatial topology map based on the time association algorithm, thereby reducing the number of faults in the subsequent root cause location process; at the same time, the types of new faults and surviving faults are determined based on the spatial topology algorithm, further reducing the number of faults in the root cause location process, only analyzing the main faults, reducing the noise caused by the concurrence of multiple faults, reducing the difficulty of locating the root cause of the fault, and improving the accuracy of the root cause location result.
[0071] Embodiment 2
[0072] Figure 2A This is a flowchart of a method for determining the severity of a fault provided in Example 2 of the present invention. Based on the above example, this example further optimizes "obtaining new faults and determining the types of surviving faults and new faults based on a spatial topology algorithm" and provides an optional implementation plan. It should be noted that for the parts not described in detail in the example of the present invention, reference can be made to the relevant descriptions of other examples. Figure 2A As shown, the method includes:
[0073] S201: Obtain relationship data of the node to which the fault belongs.
[0074] S202: construct a spatial topology graph of the node to which the fault belongs based on the relationship data; wherein the spatial topology graph is an acyclic graph.
[0075] S203: Based on the time correlation algorithm, the faults in the spatial topology graph are judged to determine the survivable faults.
[0076] S204. Based on the spatial topological distance algorithm, determine the shortest path between the node to which the new fault belongs and the nodes to which each surviving fault belongs. If the shortest path between the node to which the new fault belongs and any surviving fault node is less than or equal to the shortest path threshold, determine the dependency relationship between the node to which the new fault belongs and the node to which the surviving fault belongs, and determine the fault of the dependent node as a repeated fault based on the dependency relationship.
[0077] Among them, a new fault may refer to a newly occurring fault, and the default type of a new fault is a major fault. A major fault and a repeated fault are two different types of faults. A major fault may refer to a fault that has a great impact on the location of the root cause of the fault. Correspondingly, a repeated fault may refer to a fault that has a small impact on the location of the root cause of the fault compared to a major fault.
[0078] The spatial topological distance algorithm may be one of the single-source shortest path algorithms or a combination of multiple single-source shortest path algorithms. The single-source shortest path algorithm is used to calculate the shortest path length from a single node to other nodes, and may include Dijkstra's algorithm, Floyd's algorithm, Shortest Path Faster Algorithm (SPFA), and Bellman-Ford algorithm.
[0079] Among them, for each surviving fault in the spatial topology graph, the shortest path may refer to the minimum number of edges from the node to which the new fault belongs to the node to which the surviving fault belongs. It should be noted that when determining the shortest path between the node to which the new fault belongs and the nodes to which each surviving fault belongs, the direction of the edge between the node to which the new fault belongs and the nodes to which each surviving fault belongs is not considered, and only whether there is a reachable edge between the node to which the new fault belongs and the nodes to which each surviving fault belongs is considered.
[0080] Among them, the shortest path threshold is used to detect whether the shortest path between the node to which the new fault belongs and the node to which any surviving fault belongs is too long, so as to determine the type of the new fault and the surviving fault. The shortest path threshold can be pre-set based on the complexity of the spatial topology map of the node to which the fault belongs and according to manual experience. For example, if the complexity of the spatial topology map of the node to which the fault belongs is high, the shortest path threshold is set to 3 or 4; if the complexity of the spatial topology map of the node to which the fault belongs is high or low, the shortest path threshold is set to 2.
[0081] The dependency relationship may include the starting node, the target node, and the association relationship between the node to which the new fault belongs and any node to which the surviving fault belongs. The failure of the dependent node is the failure of the target node.
[0082] Specifically, based on the spatial topological distance algorithm, the shortest path between the node to which the new fault belongs and the nodes to which each surviving fault belongs is determined; the shortest path between the node to which the new fault belongs and any node to which a surviving fault belongs is compared with the shortest path threshold. If the shortest path is less than or equal to the shortest path threshold, the dependency relationship between the node to which the new fault belongs and the node to which the surviving fault belongs is determined, and the fault of the dependent node is determined as a repeated fault and the fault of the dependent node is determined as a major fault based on the dependency relationship; if there is no dependency relationship between the node to which the new fault belongs and the node to which the surviving fault belongs, the new fault and the surviving fault still maintain the original fault type. For example, if the original fault type of the surviving fault is a major fault, the type of the new fault is a major fault, and the type of the surviving fault is a major fault. In addition, if the shortest path is greater than the shortest path threshold, it is determined that the new fault and the surviving fault are two completely independent faults and have no spatial correlation.
[0083] It should be noted that once the new fault type is determined to be a repeated fault, the new fault will not be judged as a major fault with other remaining surviving faults in the spatial topology. In other words, once the new fault is determined to be a repeated fault, it will not have the opportunity to rise to a major fault.
[0084] For example, Figure 2BAs shown, assume that the new fault is Fault A, and the default type of Fault A is the main fault. The surviving faults are Fault B, Fault C, Fault D, and Fault E. The node to which Fault A belongs is Node 3, the node to which Fault B belongs is Node 2, the node to which Fault C belongs is Node 9, the node to which Fault D belongs is Node 7, and the node to which Fault E belongs is Node 5. The shortest path threshold is d = 1. Based on Dijkstra's algorithm, the shortest path between the node to which Fault A belongs (i.e., Node 3) and the node to which Fault B belongs (i.e., Node 2) is d AB = 1, the shortest path between the node to which Fault A belongs (i.e., Node 3) and the node to which Fault C belongs (i.e., Node 9) is d AC = 4, the shortest path between the node to which Fault A belongs (i.e., Node 3) and the node to which Fault D belongs (i.e., Node 7) is d AD = 3, the shortest path between the node to which Fault A belongs (i.e., Node 3) and the node to which Fault E belongs (i.e., Node 5) is d AE = 2; it can be seen that d AB < d. According to the dependency relationship between the node to which Fault A belongs (i.e., Node 3) and the node to which Fault B belongs (i.e., Node 2), it can be determined that the node to which Fault A belongs (i.e., Node 3) is the starting node, and the node to which Fault B belongs (i.e., Node 2) is the target node, which indicates that Node 3 depends on Node 2; according to this dependency relationship, the fault of the dependent node (i.e., Node 2) (i.e., Fault B) is determined as a repeated fault, and the fault of the dependent node (i.e., Node 3) (i.e., Fault A) is determined as the main fault. According to d AC > d, it is determined that Fault A and Fault C are two completely independent faults and have no spatial correlation. Similarly, it can be determined that Fault A and Fault D are two completely independent faults and have no spatial correlation. According to d AE = d, according to the dependency relationship between the node to which Fault A belongs (i.e., Node 3) and the node to which Fault E belongs (i.e., Node 5), from Figure 2B it can be found that there is no dependency relationship between Fault A and Fault E, so Fault A and Fault E still maintain their original fault types.
[0085] The technical solution of the embodiment of the present invention determines the types of the new fault and each surviving fault by according to the shortest path between the node to which the new fault belongs and the nodes to which each surviving fault belongs, and the dependency relationship between the node to which the new fault belongs and the nodes to which each surviving fault belongs. A specific method for determining the types of the new fault and the surviving faults is provided, and then the main faults for subsequent fault root cause location are screened out, making the determination of the main faults more accurate, improving the accuracy of the fault root cause location result; at the same time, reducing the number of faults in the fault root cause location process, only analyzing the main faults, avoiding the influence of repeated faults on the fault root cause location, reducing the difficulty of the fault root cause location, and improving the efficiency of the fault root cause location.
[0086] On the basis of the above embodiment, as an optional method of the embodiment of the present invention, the obtaining of new faults and determining the types of surviving faults and new faults based on a spatial topology algorithm may also be: obtaining the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs; when the distance between the node to which the surviving fault belongs and the node to which the new fault belongs is less than or equal to a distance threshold, if the relationship exists in a preset candidate relationship library, then determining that the new fault is a repeated fault and the surviving fault is a major fault.
[0087] Among them, the new fault may refer to a newly occurring fault, and the default type of the new fault is a major fault. It should be noted that the types of faults may include major faults and repeated faults. A major fault may refer to a fault that has a great impact on the location of the root cause of the fault. Correspondingly, a repeated fault may refer to a fault that has a small impact on the location of the root cause of the fault relative to the major fault. The distance may be obtained by at least one single-source shortest path algorithm. It should be noted that when determining the distance between the node to which the surviving fault belongs and the node to which the new fault belongs, the direction of the edge between the node to which the surviving fault belongs and the node to which the new fault belongs is not considered, and only whether there is a reachable edge between the node to which the surviving fault belongs and the node to which the new fault belongs is considered. The distance threshold is used to detect whether the distance between the node to which the surviving fault belongs and the node to which the new fault belongs is too far, so as to determine the type of the new fault and the surviving fault. The distance threshold may be pre-set based on the complexity of the spatial topological graph of the node to which the fault belongs, according to artificial experience. The candidate relationship library is used to store the association relationship between the nodes to which the fault belongs, and may be pre-constructed based on artificial experience.
[0088] It should be noted that the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs exists in the preset candidate relationship library, which means that the order of the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs is completely consistent with the order of the relationship between the nodes to which the fault belongs in the preset candidate relationship library. Figure 2B As shown, the new fault is fault C, the surviving fault is fault E, the relationship between fault E and fault C is a dependency-call relationship, and the relationship between fault E and fault C in the preset candidate relationship library is a call-dependency relationship, then it is determined that the relationship between fault E and fault C does not exist in the preset candidate relationship library.
[0089] Specifically, a new fault is obtained, and the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs in the spatial topology graph is obtained; the distance between any node to which the surviving fault belongs and the node to which the new fault belongs is calculated; the distance is compared with the distance threshold; when the distance is less than or equal to the distance threshold, the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs is searched from the preset candidate relationship library; if the relationship exists in the preset candidate relationship library, the new fault is determined to be a repeated fault and the surviving fault is a major fault; if the relationship does not exist in the preset candidate relationship library, the new fault and the surviving fault still maintain the original fault type, and the new fault and other surviving faults that meet the conditions in the spatial topology graph continue to be determined as the main and heavy. Among them, other surviving faults that meet the conditions in the spatial topology graph refer to surviving faults whose distance between the node to which the surviving fault belongs and the node to which the new fault belongs in the spatial topology graph is less than or equal to the distance threshold. In addition, when the distance is greater than the distance threshold, it is determined that the new fault and the surviving fault are two completely independent faults and have no spatial correlation.
[0090] It should be noted that once the new fault type is determined to be a repeated fault, the new fault will not be judged as a major fault with other remaining surviving faults in the spatial topology. In other words, once the new fault is determined to be a repeated fault, it will not have the opportunity to rise to a major fault.
[0091] For example, Figure 2B As shown in the figure, assume that the new fault is fault C, and the default type of fault C is major fault, the surviving faults are fault A, fault B, fault D and fault E, the distance threshold is 2, the node to which fault C belongs is node 9, the node to which fault A belongs is node 3, the node to which fault B belongs is node 2, the node to which fault D belongs is node 7, and the node to which fault E belongs is node 5. Based on the Dijkstra algorithm, the distance between the node to which fault C belongs (i.e., node 9) and the node to which fault A belongs (i.e., node 3) is calculated as d CA =4, the distance between the node to which fault C belongs (i.e., node 9) and the node to which fault B belongs (i.e., node 2) is d CB =3, the distance between the node to which fault C belongs (i.e., node 9) and the node to which fault D belongs (i.e., node 7) is d CD =1; the distance between the node to which fault C belongs (i.e., node 9) and the node to which fault E belongs (i.e., node 5) is d CE =2; it can be seen that d CA and d CB If the distance is greater than the distance threshold, it is determined that fault C and fault A are two completely independent faults, and fault C and fault B are two completely independent faults, and there is no spatial correlation; d CDIf the distance is less than the threshold, the relationship between the node to which fault D belongs (i.e., node 7) and the node to which fault C belongs (i.e., node 9) is searched from the preset candidate relationship library. Figure 2B In the call relationship in the example, if the relationship (i.e., the call relationship) does not exist in the preset candidate relationship library, then fault C and fault D still maintain the original fault type, and continue to judge the main gravity of fault C and fault E; d CE Equal to the distance threshold, from the preset candidate relationship library, find the relationship between the node to which fault E belongs (i.e. node 5) and the node to which fault C belongs (i.e. node 9) (i.e. Figure 2B In the dependency-call relationship), assuming that the relationship (i.e., the dependency-call relationship) exists in the preset candidate relationship library, it is determined that the type of fault C is a repeated fault and fault E is a major fault.
[0092] It can be understood that the types of surviving faults and new faults are determined based on the relationships in the preset candidate relationship library and the distance between the node to which the surviving fault belongs and the node to which the new fault belongs, so that the determination of the types of surviving faults and new faults is more accurate, thereby improving the accuracy of subsequent root cause location results based on the types of surviving faults and new faults.
[0093] On the basis of the above embodiment, as an optional method of the embodiment of the present invention, the acquisition of new faults and determining the types of surviving faults and new faults based on the spatial topology algorithm can also be: determining the weight value of the node to which the surviving fault belongs according to the type of the node to which the surviving fault belongs; determining the weight value of the edge between the nodes to which the surviving fault belongs according to the relationship between the nodes to which the surviving fault belongs; taking the sum of the weight values of all nodes and edges on the path from the node to which the surviving fault belongs to the node to which the new fault belongs as the importance score of the surviving fault and the new fault; obtaining the maximum value of the importance score, if the maximum value of the importance score is greater than the score threshold, determining that the new fault is a repeated fault.
[0094] Among them, the type of the node to which the survival fault belongs can be one of a host node, a process node, a container node, and a service node. The relationship between the nodes to which the survival fault belongs can be one of a call relationship, a composition relationship, an inclusion relationship, a dependency relationship, a connection relationship, and an operation relationship. The weight value is used to characterize the importance of the node to which the survival fault belongs or the edge between the nodes to which the survival fault belongs to the fault root cause location. The weight value corresponding to the type of the node to which the survival fault belongs can be pre-set, and the weight values of different types of survival fault nodes are different. For example, the weight value of the service node is pre-set to 1, the weight value of the host node is pre-set to 2, and the weight value of the process node is pre-set to 3. It should be noted that the weight value of a certain type of survival fault node is not necessarily greater than the weight value of other types of survival fault nodes, that is, the weight values of different types of survival fault nodes are not specifically limited. The weight value corresponding to the relationship between the nodes to which the survival fault belongs can be pre-set, and the weight values of the relationship between the nodes to which the survival fault belongs are different. For example, the weight value of the call relationship is 0.1, the weight value of the dependency relationship is 0.2, the weight value of the inclusion relationship is 0.3, and the weight value of the connection relationship is 0.4. It should be noted that the weight value of the relationship between nodes belonging to a certain type of survival fault is not necessarily greater than the weight value of the relationship between nodes belonging to other types of survival faults, that is, the weight value of the relationship between nodes belonging to different types of survival faults is not specifically limited. The weight value of the node belonging to the survival fault is different from the weight value of the edge between the nodes belonging to the survival fault. For example, the type of the weight value of the node belonging to the survival fault is a positive integer from 1 to 9, and the type of the weight value of the edge between the nodes belonging to the survival fault can be a positive decimal from 0.1 to 0.9.
[0095] The importance score is used to characterize the importance of all nodes and edges on the path between the surviving fault and the new fault to the root cause location of the fault. The score threshold is used to detect whether the importance scores of the surviving fault and the new fault are too small to determine the types of the surviving fault and the new fault. The score threshold can be pre-set based on experience, such as based on the experience of experienced professionals, or based on project experience.
[0096] Specifically, pre-set the weight value corresponding to the node type to which the surviving fault belongs, and pre-set the weight value corresponding to the relationship between the nodes to which the surviving fault belongs; determine the weight value of the node to which the surviving fault belongs according to the type of the node to which the surviving fault belongs; determine the weight value of the edge between the nodes to which the surviving fault belongs according to the relationship between the nodes to which the surviving fault belongs; for each surviving fault, calculate the sum of the weight values of all nodes and edges on the path from the node to which the surviving fault belongs to the node to which the new fault belongs, and use the sum of the weight values as the importance score of the surviving fault and the new fault. For example, see Figure 2B , assuming Figure 2BThe new fault in is fault C, and the default type of fault C is major fault. The path from the node to which fault E belongs (i.e. node 5) to the node to which fault C belongs (i.e. node 9) includes node 5, node 7, the edge between node 5 and node 7 (i.e. the edge where the dependency relationship is located), and the edge between node 7 and node 9 (i.e. the edge where the call relationship is located). The importance scores of fault E and fault C are determined by the following formula:
[0097] score = W5*b1+W7*b2;
[0098] Among them, score represents the importance scores of fault E and fault C, W5 represents the weight value of node 5, W7 represents the weight value of node 7, b1 represents the weight of the edge between node 5 and node 7 (that is, the edge where the dependency relationship is located), and b2 represents the weight of the edge between node 7 and node 9 (that is, the edge where the call relationship is located).
[0099] Similarly, the importance scores of all surviving faults and new faults can be obtained; the maximum value of the importance scores of all surviving faults and new faults is obtained, and the maximum value is compared with the score threshold; if the maximum value is greater than the score threshold, it indicates that the importance score corresponding to the maximum value is a valid score, then the new fault is determined to be a repeated fault, and the surviving fault corresponding to the maximum value is a major fault; if the maximum value is less than or equal to the score threshold, it indicates that the importance score corresponding to the maximum value is not a valid score, then the new fault is still determined to be a major fault, and the surviving fault corresponding to the maximum value still maintains the original type. For example, Figure 2B As shown, assuming that the new fault is fault C, and the default type of fault C is a major fault, and assuming that the score threshold is 0.5; if the maximum value of the importance scores of all surviving faults and new faults is the importance score of fault D and fault C (i.e., 0.6); the maximum value is greater than the score threshold, indicating that the importance score corresponding to the maximum value is a valid score, then fault C is determined to be a repeated fault and fault D is a major fault.
[0100] It should be noted that once the new fault type is determined to be a repeated fault, the new fault will not be judged as a major fault with other remaining surviving faults in the spatial topology. In other words, once the new fault is determined to be a repeated fault, it will not have the opportunity to rise to a major fault.
[0101] It can be understood that the types of surviving faults and new faults are determined based on the weight values corresponding to the nodes to which the surviving faults belong in the spatial topology diagram of the nodes to which the faults belong and the weight values corresponding to the relationships between the nodes to which the surviving faults belong, making the determination of the types of surviving faults and new faults more accurate, thereby improving the accuracy of subsequent root cause location results based on the types of surviving faults and new faults.
[0102] Embodiment 3
[0103] Figure 3 This is a schematic diagram of the structure of a device for determining the severity of a fault provided in the third embodiment of the present invention. This embodiment is applicable to the situation where the root cause of a fault is located after a fault occurs in a microservice architecture, and is particularly applicable to the situation where the root cause of a fault is located based on an artificial intelligence algorithm after a fault occurs in a microservice architecture. The device can be implemented in the form of hardware and / or software and can be configured in an electronic device, which can be a server. Figure 3 As shown, the device comprises:
[0104] The relationship data acquisition module 301 is used to acquire the relationship data of the node to which the fault belongs;
[0105] The spatial topology map construction module 302 is used to construct a spatial topology map of the node to which the fault belongs based on the relationship data; wherein the spatial topology map is an acyclic graph;
[0106] A survivable fault determination module 303 is used to determine the faults in the spatial topology map based on a time correlation algorithm to determine the survivable faults;
[0107] The fault type determination module 304 is used to obtain new faults and determine the types of surviving faults and new faults based on a spatial topology algorithm.
[0108] The technical solution of the embodiment of the present invention obtains the relationship data of the nodes to which the fault belongs through the relationship data acquisition module; constructs the spatial topology map of the nodes to which the fault belongs through the spatial topology map construction module; determines the faults in the spatial topology map based on the time association algorithm through the survival fault determination module to determine the survival fault; obtains the new fault through the fault type determination module, and determines the types of the survival fault and the new fault based on the spatial topology algorithm. The above technical solution constructs a spatial topology map using the relationship data of the nodes to which the fault belongs, and determines the survival faults in the spatial topology map based on the time association algorithm, which reduces the number of faults in the subsequent fault root cause location process; at the same time, the types of new faults and survival faults are determined based on the spatial topology algorithm, which further reduces the number of faults in the fault root cause location process, and only analyzes the main faults, which reduces the noise caused by the concurrence of multiple faults, reduces the difficulty of fault root cause location, and improves the accuracy of the fault root cause location result.
[0109] Optionally, the survival fault determination module 303 is specifically configured to:
[0110] According to the fault importance, fault occurrence time and fault end time in the spatial topology map, a weighted sum is determined; the weighted sum is compared with a weighted sum threshold, and if the weighted sum is greater than the weighted sum threshold, the fault in the spatial topology map is determined to be a survivable fault.
[0111] Optionally, the survival fault determination module 303 is specifically configured to:
[0112] The time difference between the first occurrence time of the fault in the spatial topology map and the current time is calculated. If the time difference is less than or equal to the survival time threshold, the fault in the spatial topology map is determined to be a survival fault.
[0113] Optionally, the survival fault determination module 303 is specifically configured to:
[0114] The number of times a fault in the spatial topology graph occurs within a period of time before the current time is obtained. If the number is greater than or equal to the number threshold, it is determined that the fault in the spatial topology graph is a survivable fault.
[0115] Optionally, the fault type determination module 304 is specifically configured to:
[0116] Based on the spatial topological distance algorithm, the shortest path between the node to which the new fault belongs and the nodes to which each surviving fault belongs is determined. If the shortest path between the node to which the new fault belongs and any surviving fault node is less than or equal to the shortest path threshold, the dependency relationship between the node to which the new fault belongs and the node to which the surviving fault belongs is determined, and the fault of the dependent node is determined as a repeated fault based on the dependency relationship.
[0117] Optionally, the fault type determination module 304 is specifically configured to:
[0118] Obtain the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs; when the distance between the node to which the surviving fault belongs and the node to which the new fault belongs is less than or equal to the distance threshold, if the relationship exists in the preset candidate relationship library, determine that the new fault is a repeated fault and the surviving fault is a major fault.
[0119] Optionally, the fault type determination module 304 is specifically configured to:
[0120] According to the type of the node to which the surviving fault belongs, the weight value of the node to which the surviving fault belongs is determined; according to the relationship between the nodes to which the surviving fault belongs, the weight value of the edge between the nodes to which the surviving fault belongs is determined; the sum of the weight values of all nodes and edges on the path from the node to which the surviving fault belongs to the node to which the new fault belongs is taken as the importance score of the surviving fault and the new fault; the maximum value of the importance score is obtained, and if the maximum value of the importance score is greater than the score threshold, the newly occurring fault is determined to be a repeated fault.
[0121] The device for determining the main severity of a fault provided by the embodiment of the present invention can execute the method for determining the main severity of a fault provided by any embodiment of the present invention, and has functional modules and beneficial effects corresponding to executing each method for determining the main severity of a fault.
[0122] Embodiment 4
[0123] Figure 4 A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.
[0124] like Figure 4 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, ROM 12 and RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.
[0125] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0126] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as a method for determining the main severity of a fault.
[0127] In some embodiments, the method for determining the main severity of a fault may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the method for determining the main severity of a fault described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to execute the method for determining the main severity of a fault by any other appropriate means (e.g., by means of firmware).
[0128] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0129] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0130] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0131] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).
[0132] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.
[0133] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.
[0134] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.
[0135] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims
1. A method for determining the severity of a fault, characterized in that: include: Get the relationship data of the node to which the fault belongs; According to the relationship data, a spatial topology graph of the node to which the fault belongs is constructed; wherein the spatial topology graph is an acyclic graph; Based on a time correlation algorithm, the faults in the spatial topology graph are judged to determine the survivable faults; Acquire a new fault, and determine the types of the surviving fault and the new fault based on a spatial topology algorithm; The method of judging the faults in the spatial topology graph based on the time correlation algorithm to determine the survivable faults includes: Determine a weighted sum according to the fault importance, fault occurrence time, and fault end time in the spatial topology graph; Comparing the weighted sum with a weighted sum threshold, and if the weighted sum is greater than the weighted sum threshold, determining that the fault in the spatial topology graph is a survivable fault; or, Calculate the time difference between the first occurrence time of the fault in the spatial topology map and the current time, and if the time difference is less than or equal to the survival time threshold, determine that the fault in the spatial topology map is a survival fault; or, Obtain the number of times the fault in the spatial topology map occurs within a period of time before the current time, and if the number is greater than or equal to a number threshold, determine that the fault in the spatial topology map is a survivable fault; The acquiring of the new fault and determining the types of the surviving fault and the new fault based on a spatial topology algorithm includes: Based on the spatial topological distance algorithm, determine the shortest path between the node to which the new fault belongs and each of the nodes to which the surviving faults belong. If the shortest path between the node to which the new fault belongs and any node to which the surviving fault belongs is less than or equal to the shortest path threshold, determine the dependency relationship between the node to which the new fault belongs and the node to which the surviving fault belongs, and determine the fault of the dependent node as a repeated fault according to the dependency relationship; or, Obtaining the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs; In the case where the distance between the node to which the surviving fault belongs and the node to which the new fault belongs is less than or equal to a distance threshold, if the relationship exists in a preset candidate relationship library, it is determined that the new fault is a repeated fault and the surviving fault is a major fault; or, Determining a weight value of the node to which the surviving fault belongs according to the type of the node to which the surviving fault belongs; Determine the weight value of the edge between the nodes to which the surviving fault belongs according to the relationship between the nodes to which the surviving fault belongs; The sum of the weight values of all nodes and edges on the path from the node to which the surviving fault belongs to the node to which the new fault belongs is taken as the importance score of the surviving fault and the new fault; The maximum value of the importance score is obtained, and if the maximum value of the importance score is greater than the score threshold, the new fault is determined to be a repeated fault.
2. A device for determining the main severity of a fault, characterized in that: include: A relational data acquisition module is used to acquire relational data of the node to which the fault belongs; A spatial topology map construction module is used to construct a spatial topology map of the node to which the fault belongs based on the relationship data; wherein the spatial topology map is an acyclic graph; A survivable fault determination module, used to determine the faults in the spatial topology graph based on a time correlation algorithm to determine the survivable faults; A fault type determination module, used to obtain a new fault and determine the types of the surviving fault and the new fault based on a spatial topology algorithm; Wherein, the survival fault determination module is specifically used for: Determine a weighted sum according to the fault importance, fault occurrence time, and fault end time in the spatial topology graph; Comparing the weighted sum with a weighted sum threshold, and if the weighted sum is greater than the weighted sum threshold, determining that the fault in the spatial topology graph is a survivable fault; or, Calculate the time difference between the first occurrence time of the fault in the spatial topology map and the current time, and if the time difference is less than or equal to the survival time threshold, determine that the fault in the spatial topology map is a survival fault; or, Obtain the number of times the fault in the spatial topology map occurs within a period of time before the current time, and if the number is greater than or equal to a number threshold, determine that the fault in the spatial topology map is a survivable fault; The fault type determination module is specifically used to: Based on the spatial topological distance algorithm, determine the shortest path between the node to which the new fault belongs and each of the nodes to which the surviving faults belong. If the shortest path between the node to which the new fault belongs and any node to which the surviving fault belongs is less than or equal to the shortest path threshold, determine the dependency relationship between the node to which the new fault belongs and the node to which the surviving fault belongs, and determine the fault of the dependent node as a repeated fault according to the dependency relationship; or, Obtaining the relationship between the node to which the surviving fault belongs and the node to which the new fault belongs; In the case where the distance between the node to which the surviving fault belongs and the node to which the new fault belongs is less than or equal to a distance threshold, if the relationship exists in a preset candidate relationship library, it is determined that the new fault is a repeated fault and the surviving fault is a major fault; or, Determining a weight value of the node to which the surviving fault belongs according to the type of the node to which the surviving fault belongs; Determine the weight value of the edge between the nodes to which the surviving fault belongs according to the relationship between the nodes to which the surviving fault belongs; The sum of the weight values of all nodes and edges on the path from the node to which the surviving fault belongs to the node to which the new fault belongs is taken as the importance score of the surviving fault and the new fault; The maximum value of the importance score is obtained, and if the maximum value of the importance score is greater than the score threshold, the new fault is determined to be a repeated fault.
3. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the method for determining the major and minor severity of a fault according to claim 1.
4. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the method for determining the major and serious nature of a fault as claimed in claim 1 when the processor executes the instructions.
