Business node processing methods, devices, electronic equipment and storage media
By acquiring and analyzing the initial node information table of the target business, calculating the path weighting value from the abnormal node to the root node, and determining the priority of the abnormal node, the problem of inaccurate and inefficient abnormal node processing in the existing technology is solved, and efficient abnormal node processing is achieved.
Patent Information
- Application Number
- CN202311300449.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-10-09
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2043-10-09
AI Technical Summary
Existing technologies cannot accurately determine the most urgent abnormal node when calculating the longest running time from an abnormal node to the downstream root node in a directed network, resulting in low computational efficiency and poor real-time performance, especially in multi-vertex and multi-root node path calculations, which require multiple calculations.
By obtaining the initial node information table of the target business, the abnormal status of candidate business nodes is determined, and the priority of abnormal handling is calculated based on the basic node information. The path from the abnormal node to the root node is calculated using the path weighting value, thereby accurately determining the abnormal node to be handled first.
It improves computational efficiency, avoids redundant path calculations for business nodes, and ensures the accuracy and real-time performance of abnormal node handling.
Smart Images

Figure CN117439857B_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of computer technology, and in particular to a business node processing method, apparatus, electronic device and storage medium. Background Technology
[0002] Currently, there are several root nodes in a directed network. Whether a root node can complete normally depends on whether its upstream connected nodes can complete normally. For all root nodes in the network, there is a maximum completion time limit. If the maximum completion time is exceeded, the root node is judged to have timed out. To avoid root node timeouts, abnormal nodes in the network need to be dealt with in a timely manner. In order to determine the urgency of abnormal nodes and the processing order, it is necessary to calculate the longest running time from the abnormal node to the downstream root node affected by it.
[0003] In related technologies, the topological sorting of directed network nodes is usually used to calculate the total node topology hierarchy from the abnormal node to the root node as the longest running time from the abnormal node to the downstream root node affected by it.
[0004] This approach can only identify the path with the most processing nodes, not the path with the longest processing time. This makes it impossible to accurately identify the most urgent abnormal nodes. Path calculations for multiple vertices and multiple root nodes cannot be completed in one go, and repeated paths require multiple calculations, resulting in significant time costs and poor real-time performance. Summary of the Invention
[0005] This disclosure aims to at least partially address one of the technical problems in the related art.
[0006] Therefore, the purpose of this disclosure is to provide a business node processing method, apparatus, electronic device, storage medium, and computer program product.
[0007] The first aspect of this disclosure provides a service node processing method, comprising: obtaining an initial node information table for a target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the node basic information of each candidate service node; determining at least a portion of first candidate service nodes from the multiple candidate service nodes; determining priority information for abnormal handling of the first candidate service nodes based on the first node basic information of the first candidate service nodes; and determining second candidate service nodes from at least a portion of the first candidate service nodes based on the priority information.
[0008] A second aspect of this disclosure provides a service node processing apparatus, comprising: an acquisition module for acquiring an initial node information table of a target service, wherein the initial node information table describes multiple candidate service nodes related to the target service and basic node information of each candidate service node; a first determination module for determining at least a portion of first candidate service nodes from the multiple candidate service nodes; a second determination module for determining priority information for anomaly handling of the first candidate service nodes based on the first node basic information of the first candidate service nodes; and a third determination module for determining second candidate service nodes from at least a portion of the first candidate service nodes based on the priority information.
[0009] A third aspect of this disclosure provides an electronic device including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the service node processing method as proposed in the first aspect of this disclosure.
[0010] The fourth aspect of this disclosure provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the service node processing method as proposed in the first aspect of this disclosure.
[0011] The fifth aspect of this disclosure provides a computer program product in which, when instructions in the computer program product are executed by a processor, the business node processing method as described in the first aspect of this disclosure is performed.
[0012] The service node processing method, apparatus, electronic device, storage medium, and computer program product proposed in this disclosure have at least the following beneficial effects: by obtaining an initial node information table of the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the node basic information of each candidate service node, at least a portion of the first candidate service nodes are determined from the multiple candidate service nodes, priority information for abnormal processing of the first candidate service nodes is determined based on the first node basic information of the first candidate service nodes, and second candidate service nodes are determined from at least a portion of the first candidate service nodes based on the priority information, the path weighting value from each abnormal node to the root node in the directed node network where the service node is located can be calculated, thereby calculating the priority for processing each abnormal node, thus accurately determining the abnormal node to be processed first, and eliminating the need for multiple calculations for repeated paths of service nodes, effectively improving computational efficiency.
[0013] Additional aspects and advantages of this disclosure will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this disclosure. Attached Figure Description
[0014] The above and / or additional aspects and advantages of this disclosure will become apparent and readily understood from the following description of the embodiments taken in conjunction with the accompanying drawings, in which:
[0015] Figure 1 This is a flowchart illustrating a business node processing method proposed in an embodiment of this disclosure;
[0016] Figure 2 This is a flowchart illustrating a service node processing method proposed in another embodiment of this disclosure;
[0017] Figure 3 This is a flowchart illustrating a service node processing method proposed in another embodiment of this disclosure;
[0018] Figure 4 This is a flowchart of the algorithm for processing business nodes in this embodiment of the disclosure;
[0019] Figure 5 This is a schematic diagram of the structure of a service node processing device according to an embodiment of the present disclosure;
[0020] Figure 6 This is a schematic diagram of the structure of a service node processing device according to another embodiment of this disclosure;
[0021] Figure 7 A block diagram of an exemplary electronic device suitable for implementing embodiments of the present disclosure is shown. Detailed Implementation
[0022] Embodiments of this disclosure are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are used only to explain this disclosure, and should not be construed as limiting this disclosure. Rather, embodiments of this disclosure include all variations, modifications, and equivalents falling within the spirit and scope of the appended claims.
[0023] Figure 1 This is a flowchart illustrating a business node processing method proposed in an embodiment of this disclosure.
[0024] It should be noted that the execution subject of the business node processing method in this embodiment is a business node processing device, which can be implemented by software and / or hardware, and can be configured in an electronic device, without limitation.
[0025] like Figure 1 As shown, the processing method for this business node includes:
[0026] S101: Obtain the initial node information table of the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the basic node information of each candidate service node.
[0027] The target service refers to a service that includes multiple task processing nodes, which form a directed node network. The target service can be a system service in various fields, and there are no restrictions on this.
[0028] Among them, candidate service nodes refer to multiple task processing nodes included in the target service. These multiple candidate service nodes constitute a directed node network. Candidate service nodes are non-root nodes in the directed node network. Candidate service nodes can reach the root node through various paths.
[0029] The initial node information table refers to the node information table formed after collecting and summarizing the basic node information of each candidate business node of the target business in advance. The initial node information table is the node information table before the basic node information in it is updated.
[0030] Among them, the basic node information refers to the data information that can describe the node identifier, node path number, node processing time and completion time, and node level of the candidate business node. The basic node information is stored in the initial node information table, and the basic node information of each candidate business node is uniquely identified by the node identifier.
[0031] In this embodiment of the disclosure, when obtaining the initial node information table of the target service, the basic information of the candidate service nodes included in the target service can be organized. This basic information may include node basic information, which may include: node number, node status (used to identify whether the candidate service node is in an abnormal state), and node running time. The node basic information is uniquely identified using the node identifier of the candidate service node. Node network information can also be collected and stored in the initial node information table. This node network information may include: the association and dependency relationships between nodes and the root node identifier. The root node identifier is used to identify the root service node of the target service. Based on the collected node basic information and node network information, a node information table is constructed, which includes node number, completion time, current level, and path number.
[0032] S102: Determine at least a portion of the first candidate service nodes from multiple candidate service nodes.
[0033] The first candidate business node refers to a candidate business node that is in an abnormal state, and there can be multiple first candidate business nodes.
[0034] In this embodiment of the disclosure, when determining at least some first candidate service nodes from multiple candidate service nodes, the node status of each node in the initial node information table can be analyzed and processed to obtain candidate service nodes whose node status is abnormal among multiple candidate service nodes, and the candidate service nodes in abnormal status that are not root nodes can be taken as first candidate service nodes, thereby realizing the determination of at least some first candidate service nodes from multiple candidate service nodes.
[0035] S103: Based on the basic information of the first candidate service node, determine the priority information for handling anomalies of the first candidate service node.
[0036] Among them, the basic information of the first node refers to the basic information of the first candidate business node stored in the initial node information table.
[0037] Among them, priority information refers to data information that can be used to determine the priority of the first candidate service node in anomaly handling. This priority information can be, for example, the longest running time between the first candidate service node and the downstream root node affected by it.
[0038] In this embodiment of the disclosure, after obtaining the initial node information table of the target service and determining at least some first candidate service nodes from multiple candidate service nodes, priority information for abnormal handling of the first candidate service nodes can be determined based on the first node basic information of the first candidate service nodes.
[0039] In the embodiments of the present disclosure, when determining the priority information for performing exception processing on a first candidate service node according to the first node basic information of the first candidate service node, for a first candidate service node, the current level L0 of the first candidate service node may be recorded, one candidate service node (non-root node) with the level L0 is extracted from the initial node information table, and the first node basic information of the extracted non-root candidate service node is: (x1, t1, L0, n1), where x1 is the node identifier of the candidate service node, t1 is the node running time of the candidate service node, L0 is the node level of the candidate service node, and n1 is the unique path number of the candidate service node. Then, the next-level node information of the candidate service node is obtained, including the node number x5 and the running time t5, and a unique path number n5 is randomly generated. The information of the new node is generated as follows: (x5, t1+t5, L1, n1n5), where n1n5 is formed by splicing the unique path number of the x1 node and the unique path number of the x5 node, and the current level information L1 = L0 + 1. It is determined whether the new node x5 already exists in the node information table. If not, this record is added. If it exists, the completion time T of the currently stored x5 node is determined. If T < t1+t5, for all nodes N whose unique path number contains "n1n5", their completion time information is updated to: T_N + (t1+t5-T), where T_N is the currently stored completion time data of node N, and other non-root nodes at the L0 level continue to be acquired. The above steps are repeated until all non-root nodes at the L0 level have been calculated. All non-root nodes at the current maximum level are extracted from the node information table, and the above calculation steps are repeated until the calculation is completed. For each root node E, all exception nodes X that affect its completion time and the influence time data T of each exception node on this root node are stored, and the influence time data can be used as the priority information for performing exception processing on the first candidate service node.
[0040] Optionally, in some embodiments, the first node basic information includes: a first node level and a first node running time, where the first node level is used to describe the level of the first candidate service node in the service node network of the target service. When determining the priority information for performing exception processing on the first candidate service node according to the first node basic information of the first candidate service node, a candidate service node corresponding to the first candidate service node may be determined, where the node level of the corresponding candidate service node is smaller than the first node level and adjacent to the first node level. The priority information is determined according to the first node running time and the corresponding candidate service node, so that all exception service nodes related to the target service can be analyzed and processed, the comprehensiveness of node priority sorting processing is ensured, and thus the service node with the highest processing priority can be found relatively accurately.
[0041] Among them, the business node network refers to the directed node network composed of all candidate business nodes of the target business.
[0042] The first node level describes the level of the first candidate service node in the service node network of the target service.
[0043] The first node running time refers to the running time of the first candidate business node.
[0044] In this embodiment of the disclosure, when determining the priority information for anomaly handling of the first candidate service node based on the first node basic information of the first candidate service node, a candidate service node corresponding to the first candidate service node can be determined. This candidate service node has a lower node level than the first node level and is adjacent to the first node level; that is, the corresponding candidate service node is the next-level candidate service node adjacent to the first candidate service node. Then, priority information can be determined based on the first node's running time and the corresponding candidate service node. A time modification amount can be generated based on the first node's running time and the corresponding candidate service node's running time, and a unique path can be generated from the first candidate service node to the corresponding candidate service node. All node basic information containing this unique path is obtained from the initial node information table. Based on the generated time modification amount, the running time of the selected node basic information that needs modification is modified to obtain a modified node information table. Then, the running times of all nodes in the modified node information table are sorted, and this sorting result can be used as the priority information of the candidate service nodes.
[0045] S104: Determine the second candidate service node from at least a portion of the first candidate service nodes based on priority information.
[0046] The second candidate business node refers to the first candidate business node among multiple first candidate business nodes that needs to be given priority in exception handling.
[0047] In this embodiment of the disclosure, after determining the priority information for abnormal handling of the first candidate service node based on the first node basic information of the first candidate service node, a second candidate service node can be determined from at least a portion of the first candidate service nodes based on the priority information.
[0048] In this embodiment of the disclosure, when determining a second candidate service node from at least a portion of the first candidate service nodes based on priority information, the first candidate service node with the longest running time can be selected as the second candidate service node from the running time of each first candidate service node indicated in the priority information.
[0049] In this embodiment, by obtaining an initial node information table of the target service, which describes multiple candidate service nodes related to the target service and the basic node information of each candidate service node, at least a portion of the first candidate service nodes are determined from the multiple candidate service nodes. Based on the basic node information of the first candidate service nodes, priority information for anomaly handling of the first candidate service nodes is determined. Based on the priority information, second candidate service nodes are determined from at least a portion of the first candidate service nodes. The path weighting value from each abnormal node to the root node in the directed node network where the service node is located can be calculated, thereby calculating the priority for handling each abnormal node, thus accurately determining the abnormal node to be handled first. For repeated paths of service nodes, there is no need to calculate multiple times, effectively improving the calculation efficiency.
[0050] Figure 2 This is a flowchart illustrating a service node processing method proposed in another embodiment of this disclosure.
[0051] like Figure 2 As shown, the processing method for this business node includes:
[0052] S201: Obtain the initial node information table of the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the basic node information of each candidate service node.
[0053] S202: Determine at least a portion of the first candidate service nodes from multiple candidate service nodes.
[0054] S203: Determine the candidate service node corresponding to the first candidate service node, wherein the node level of the corresponding candidate service node is lower than the node level of the first node and is adjacent to the node level of the first node.
[0055] For a detailed description of S201 to S203, please refer to the above embodiments, which will not be repeated here.
[0056] S204: Determine whether the basic information of the second initial node of the corresponding candidate business node belongs to the initial node information table to obtain the determination result.
[0057] The second initial node basic information refers to the node basic information of the corresponding candidate business node. This second initial node basic information refers to the node basic information of the corresponding candidate business node before its time information was modified.
[0058] In this embodiment of the disclosure, when determining whether the second initial node basic information of the corresponding candidate service node belongs to the initial node information table, the node basic information of the corresponding candidate service node before its time information is modified can be obtained as the second initial node basic information of the corresponding candidate service node. Then, the node identifier of the corresponding candidate service node can be obtained from the second initial node basic information. Matching processing is performed based on the node identifier in the initial node information table to determine whether the second initial node basic information is stored in the initial node information table. If a matching node identifier is obtained, it is determined that the second initial node basic information belongs to the initial node information table. If no matching node identifier is obtained, it is determined that the second initial node basic information does not belong to the initial node information table, thereby obtaining the determination result.
[0059] S205: Determine priority information based on the determined results, the running time of the first node, and the basic information of the second initial node.
[0060] In this embodiment of the disclosure, after determining whether the basic information of the second initial node of the corresponding candidate service node belongs to the initial node information table, priority information can be determined based on the determination result, the running time of the first node, and the basic information of the second initial node.
[0061] In this embodiment of the disclosure, when determining priority information based on the determination result, the running time of the first node, and the basic information of the second initial node, different update processes can be performed on the initial node information table based on the running time of the first node and the basic information of the second initial node for different determination results to obtain an updated node information table. The urgency information and processing order of each first candidate business node are determined based on the updated node information table, and the urgency information and processing order are used as priority information.
[0062] Optionally, in some embodiments, the basic information of the second initial node includes: the running time of the second initial node; wherein, when determining priority information based on the determination result, the running time of the first node and the basic information of the second initial node, a reference running time can be generated based on the running time of the first node and the running time of the second initial node, and priority information can be determined based on the reference running time and the determination result, so that different information update methods can be set for whether the node is stored in the node information table to ensure the correctness of information update.
[0063] The basic information of the second initial node includes: the running time of the second initial node.
[0064] The reference running time refers to the running time obtained by summing the running times of the first node and the second initial node.
[0065] In this embodiment of the disclosure, when determining priority information based on the determination result, the running time of the first node, and the basic information of the second initial node, a reference running time can be generated based on the running time of the first node and the running time of the second initial node. The running time of the first node and the running time of the second initial node can be accumulated to obtain a time accumulation result, which is used as the reference running time. Then, priority information can be determined based on the reference running time and the determination result. Depending on the different determination results, different time modification methods can be set for whether the basic information of the second initial node belongs to the initial node information table or not. Based on the different time modification methods and the reference running time, the running time of some nodes in the initial node information table can be modified to obtain an updated node information table. Then, the urgency information and processing order of each first candidate business node can be determined based on the updated node information table, and the urgency information and processing order are used as priority information.
[0066] In this embodiment of the disclosure, by determining whether the second initial node basic information of the corresponding candidate business node belongs to the initial node information table, a determination result is obtained. Based on the determination result, the running time of the first node, and the second initial node basic information, priority information is determined. Thus, different data processing methods can be set for different situations where the second initial node basic information of the corresponding candidate business node belongs to the initial node information table, to perform node basic information input or node basic information modification in the node information table, ensuring the correctness of the business node processing flow.
[0067] S206: Determine the second candidate service node from at least a portion of the first candidate service nodes based on priority information.
[0068] For a detailed description of S206, please refer to the above embodiments, which will not be repeated here.
[0069] In this embodiment, by obtaining an initial node information table of the target service, which describes multiple candidate service nodes related to the target service and the basic node information of each candidate service node, at least a portion of the first candidate service nodes are determined from the multiple candidate service nodes. Based on the basic node information of the first candidate service nodes, priority information for anomaly handling of the first candidate service nodes is determined. Based on the priority information, second candidate service nodes are determined from at least a portion of the first candidate service nodes. The path weighting value from each abnormal node to the root node in the directed node network where the service node is located can be calculated, thereby calculating the priority for handling each abnormal node, thus accurately determining the abnormal node to be handled first. For repeated paths of service nodes, there is no need to calculate multiple times, effectively improving the calculation efficiency.
[0070] Figure 3 This is a flowchart illustrating a service node processing method proposed in another embodiment of this disclosure.
[0071] like Figure 3 As shown, the processing method for this business node includes:
[0072] S301: Obtain the initial node information table of the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the basic node information of each candidate service node.
[0073] S302: Determine at least a portion of the first candidate service nodes from multiple candidate service nodes.
[0074] S303: Determine the candidate service node corresponding to the first candidate service node, wherein the node level of the corresponding candidate service node is lower than the node level of the first node and is adjacent to the node level of the first node.
[0075] S304: Determine whether the basic information of the second initial node of the corresponding candidate business node belongs to the initial node information table to obtain the determination result.
[0076] For a detailed description of S301 to S304, please refer to the above embodiments, which will not be repeated here.
[0077] S305: Generate a reference running time based on the running time of the first node and the running time of the second initial node.
[0078] The basic information of the first node also includes: the first node path identifier of the first candidate service node, and the basic information of the second initial node also includes: the second node level and the second node path identifier of the corresponding candidate service node. The first node path identifier is used to describe the position of the first candidate service node in the service node network, and the second node path identifier is used to describe the position of the corresponding candidate service node in the service node network.
[0079] S306: If the determination result indicates that the basic information of the second initial node does not belong to the initial node information table, then the basic information of the second target node is generated based on the reference running time, the second node level, the first node path identifier and the second node path identifier, and the basic information of the second target node is stored in the initial node information table to obtain the target node information table.
[0080] In this embodiment of the disclosure, the determination result can be analyzed and processed. If the determination result indicates that the basic information of the second initial node does not belong to the initial node information table, the reference running time, the second node level, the first node path identifier and the second node path identifier are used to construct the basic information of the second target node. The basic information of the second target node can be stored in the initial node information table, and the above processing is performed on all the first candidate business nodes to obtain the target node information table.
[0081] Optionally, in some embodiments, when generating the basic information of the second target node based on the reference running time, the second node level, the first node path identifier, and the second node path identifier, the target node path can be generated based on the first node path identifier and the second node path identifier, and the basic information of the second target node can be generated based on the reference running time, the second node level, and the target node path. This allows for supplementary processing of the node information table when the basic information of the second target node is not available, thereby ensuring the comprehensiveness and correctness of the basic information of the nodes in the node information table.
[0082] The target node path refers to the unique path between the first candidate business checkpoint and the corresponding candidate business node, obtained by concatenating the first node path identifier and the second node path identifier.
[0083] In this embodiment of the disclosure, when generating the basic information of the second target node based on the reference running time, the second node level, the first node path identifier, and the second node path identifier, the first node path identifier and the second node path identifier can be concatenated to obtain the concatenated node path. The concatenated node path is used as the target node path. The basic information of the target node path, the reference running time, and the second node level is constructed, and the constructed basic information of the node is used as the basic information of the second target node.
[0084] S307: If the determination result indicates that the basic information of the second initial node belongs to the initial node information table, then the initial node information table is updated according to the reference running time to obtain the target node information table.
[0085] The target node information table refers to the node information table after updating the completion time of some nodes that need to be modified in the initial node information table.
[0086] In this embodiment of the disclosure, the determination result can be analyzed and processed. If the determination result indicates that the basic information of the second initial node belongs to the initial node information table, the node completion time to be modified is obtained from the initial node information table, and the node completion time is modified and updated according to the reference running time to obtain the modified node information table as the target node information table.
[0087] Optionally, in some embodiments, when updating the initial node information table based on the reference running time to obtain the target node information table, candidate business nodes whose node paths contain the target node path can be obtained from the initial node information table as candidate business nodes to be updated. The first node completion time of the corresponding candidate business node is obtained. When the first node completion time is less than the reference running time, a running time modification amount is generated based on the reference running time and the first node completion time. Based on the running time modification amount, the initial node completion time of the candidate business node to be updated is updated to obtain the target node completion time. The updated initial node information table is then used as the target node information table. This allows for setting corresponding time modification increments to update the node information table, resulting in higher accuracy in selecting abnormal nodes based on the node completion time in the node information table.
[0088] In this embodiment of the disclosure, when updating the initial node information table according to the reference running time to obtain the target node information table, candidate business nodes whose node paths contain the target node path can be obtained from the initial node information table as candidate business nodes to be updated. The first node completion time of the corresponding candidate business node is obtained. When the first node completion time is less than the reference running time, a running time modification amount is generated according to the reference running time and the first node completion time. The difference between the reference running time and the first node completion time can be calculated, and the result of the time difference can be used as the running time modification amount. According to the running time modification amount, the initial node completion time of the candidate business node to be updated is updated. The time modification amount can be accumulated on the initial node completion time, and the time value obtained after the accumulation process can be used as the target node completion time. The updated initial node information table is used as the target node information table.
[0089] S308: Determine priority information based on the target node information table.
[0090] Optionally, in some embodiments, when determining priority information based on the target node information table, the target node completion time of the candidate business nodes in the target node information table can be sorted to obtain a sorting result. Based on the sorting result, priority information can be determined, thereby accurately calculating the longest running time from the abnormal node to the downstream root node affected by it, so as to determine the urgency and processing order of the abnormal node, ensuring that the most accurate node processing order is obtained, and ensuring the smooth progress of the target business.
[0091] In the embodiments of the present disclosure, the node completion time of all first candidate service nodes in the target node information table may be acquired for sorting processing to obtain a sorting result, then according to the sorting result, the first candidate service nodes may be arranged in descending order of the node completion time, to obtain node identification sequence information of the arranged first candidate service nodes as priority information, that is, the first candidate service node with the longest time has the highest node processing priority.
[0092] For example, as Figure 4 shown in, Figure 4 is an algorithm flowchart of service node processing in the embodiments of the present disclosure. First, basic information may be entered: node basic information includes node number, node status (whether abnormal), and node running time; node network information includes association dependency relationship between nodes and root node flag. A node information table (node number, completion time, current level, path number) is constructed, and the current level is recorded as L0. All abnormal node numbers, such as x1, x2, x3, x4, etc., and corresponding running time, such as t1, t2, t3, t4, etc., are acquired. For each abnormal node, a unique path number is randomly generated, such as n1, n2, n3, n4, etc., and the information is entered into the node information table, for example: (x1, t1, L0, n1). A non-root node with a level of L0 is taken out from the node information table, for example: (x1, t1, L0, n1), and the adjacent next-level node information thereof is acquired, which includes node number x5 and running time t5. A unique path number n5 is randomly generated, and the information of the new node is generated as follows: (x5, t1+t5, L1, n1n5), where n1n5 is formed by splicing the unique path number of the x1 node and the unique path number of the x5 node, and the current level information L1 = L0+1. It is judged whether the new node x5 already exists in the node information table. If it does not exist, this record is added; if it exists, the completion time T of the currently stored x5 node is judged. If T < t1+t5, for all nodes N whose unique path number contains "n1n5", the completion time information thereof is updated as: T_N+(t1+t5-T), where T_N is the currently stored completion time data of the node N. Other non-root nodes at the L0 level are continuously acquired, and the above steps are repeated until all non-root nodes at the L0 layer have been calculated. All non-root nodes at the current maximum level are taken out from the node information table, and the above steps are repeated. After the above steps are completed, for each root node E, all abnormal nodes X that affect its completion time and the influence time data T of each abnormal node on this root node are stored, and the influence time T of each node group (E, X) is unique.
[0093] In this embodiment of the disclosure, when the determination result indicates that the basic information of the second initial node does not belong to the initial node information table, the basic information of the second target node is generated based on the reference running time, the second node level, the first node path identifier, and the second node path identifier, and the basic information of the second target node is stored in the initial node information table. When the determination result indicates that the basic information of the second initial node belongs to the initial node information table, the initial node information table is updated based on the reference running time to obtain the target node information table. Based on the target node information table, priority information is determined, thereby enabling real-time updating of the node information table and ensuring the real-time nature and accuracy of the information in the node information.
[0094] S309: Determine the second candidate service node from at least a portion of the first candidate service nodes based on priority information.
[0095] For a detailed description of S309, please refer to the above embodiments, which will not be repeated here.
[0096] In this embodiment, by obtaining an initial node information table of the target service, which describes multiple candidate service nodes related to the target service and the basic node information of each candidate service node, at least a portion of the first candidate service nodes are determined from the multiple candidate service nodes. Based on the basic node information of the first candidate service nodes, priority information for anomaly handling of the first candidate service nodes is determined. Based on the priority information, second candidate service nodes are determined from at least a portion of the first candidate service nodes. The path weighting value from each abnormal node to the root node in the directed node network where the service node is located can be calculated, thereby calculating the priority for handling each abnormal node, thus accurately determining the abnormal node to be handled first. For repeated paths of service nodes, there is no need to calculate multiple times, effectively improving the calculation efficiency.
[0097] Figure 5 This is a schematic diagram of the structure of a service node processing device proposed in an embodiment of this disclosure.
[0098] like Figure 5 As shown, the service node processing device 50 includes:
[0099] The acquisition module 501 is used to acquire the initial node information table of the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the basic node information of each candidate service node;
[0100] The first determining module 502 is used to determine at least a portion of the first candidate service nodes from a plurality of candidate service nodes;
[0101] The second determining module 503 is used to determine the priority information for abnormal handling of the first candidate service node based on the first node basic information of the first candidate service node.
[0102] The third determining module 504 is used to determine the second candidate service node from at least a portion of the first candidate service nodes based on priority information.
[0103] In some embodiments of this disclosure, the basic information of the first node includes: the first node level and the first node running time, wherein the first node level is used to describe the level of the first candidate service node in the service node network of the target service;
[0104] Among them, such as Figure 6 As shown, Figure 6 This is a schematic diagram of the structure of a service node processing device according to another embodiment of the present disclosure. The second determining module 503 includes:
[0105] The first determining submodule 5031 is used to determine the candidate service node corresponding to the first candidate service node, wherein the node level of the corresponding candidate service node is lower than the node level of the first node and is adjacent to the node level of the first node.
[0106] The second determining submodule 5032 is used to determine priority information based on the running time of the first node and the corresponding candidate business node.
[0107] In some embodiments of this disclosure, the second determining submodule 5032 is specifically used for:
[0108] Determine whether the basic information of the second initial node of the corresponding candidate business node belongs to the initial node information table to obtain the determination result;
[0109] Priority information is determined based on the results, the running time of the first node, and the basic information of the second initial node.
[0110] In some embodiments of this disclosure, the basic information of the second initial node includes: the running time of the second initial node; wherein, the second determining submodule 5032 is further configured to:
[0111] A reference running time is generated based on the running time of the first node and the running time of the second initial node;
[0112] Priority information is determined based on the reference runtime and the determined results.
[0113] In some embodiments of this disclosure, the basic information of the first node further includes: the first node path identifier of the first candidate service node, and the basic information of the second initial node further includes: the second node level and the second node path identifier of the corresponding candidate service node. The first node path identifier is used to describe the position of the first candidate service node in the service node network, and the second node path identifier is used to describe the position of the corresponding candidate service node in the service node network.
[0114] The second determining submodule 5032 is also used for:
[0115] If the result indicates that the basic information of the second initial node does not belong to the initial node information table, then the basic information of the second target node is generated based on the reference running time, the second node level, the first node path identifier, and the second node path identifier, and the basic information of the second target node is stored in the initial node information table to obtain the target node information table.
[0116] If the result indicates that the basic information of the second initial node belongs to the initial node information table, then the initial node information table is updated according to the reference running time to obtain the target node information table.
[0117] Priority information is determined based on the target node information table.
[0118] In some embodiments of this disclosure, the second determining submodule 5032 is further configured to:
[0119] Generate the target node path based on the path identifier of the first node and the path identifier of the second node;
[0120] Based on the reference runtime, the second node level, and the target node path, generate the basic information of the second target node.
[0121] In some embodiments of this disclosure, the second determining submodule 5032 is further configured to:
[0122] Retrieve candidate business nodes whose node paths contain the target node path from the initial node information table as candidate business nodes to be updated.
[0123] Obtain the completion time of the first node of the corresponding candidate business node;
[0124] When the completion time of the first node is less than the reference running time, the running time modification amount is generated based on the reference running time and the completion time of the first node.
[0125] Based on the amount of runtime modification, the initial node completion time of the candidate business node to be updated is updated to obtain the target node completion time, and the updated initial node information table is used as the target node information table.
[0126] In some embodiments of this disclosure, the second determining submodule 5032 is further configured to:
[0127] The target node completion time of the candidate business nodes in the target node information table is sorted to obtain the sorting result.
[0128] Based on the sorting results, priority information is determined.
[0129] With the above Figures 1 to 4 Corresponding to the business node processing method provided in the embodiments, this disclosure also provides a business node processing apparatus. Since the business node processing apparatus provided in the embodiments of this disclosure is similar to the one described above... Figures 1 to 4 The business node processing method provided in the embodiments corresponds to the business node processing method provided in the embodiments of this disclosure. Therefore, the implementation method of the business node processing method is also applicable to the business node processing apparatus provided in the embodiments of this disclosure, and will not be described in detail in the embodiments of this disclosure.
[0130] In this embodiment, by obtaining an initial node information table of the target service, which describes multiple candidate service nodes related to the target service and the basic node information of each candidate service node, at least a portion of the first candidate service nodes are determined from the multiple candidate service nodes. Based on the basic node information of the first candidate service nodes, priority information for anomaly handling of the first candidate service nodes is determined. Based on the priority information, second candidate service nodes are determined from at least a portion of the first candidate service nodes. The path weighting value from each abnormal node to the root node in the directed node network where the service node is located can be calculated, thereby calculating the priority for handling each abnormal node, thus accurately determining the abnormal node to be handled first. For repeated paths of service nodes, there is no need to calculate multiple times, effectively improving the calculation efficiency.
[0131] To implement the above embodiments, this disclosure also proposes a non-transitory computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the business node processing method proposed in the foregoing embodiments of this disclosure.
[0132] To implement the above embodiments, this disclosure also proposes a computer program product that, when the instruction processor in the computer program product is executed, performs the business node processing method as proposed in the foregoing embodiments of this disclosure.
[0133] Figure 7 A block diagram of an exemplary electronic device suitable for implementing embodiments of the present disclosure is shown.
[0134] Figure 7 The electronic device 7 shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments disclosed herein.
[0135] like Figure 7 As shown, the electronic device 7 is represented in the form of a general-purpose computing device. The components of the electronic device 7 may include, but are not limited to: one or more processors or processing units 16, memory 28, and bus 18 connecting different system components (including memory 28 and processing unit 16).
[0136] Bus 18 represents one or more of several bus architectures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of the various bus architectures. Examples of these architectures include, but are not limited to, the Industry Standard Architecture (ISA) bus, the Micro Channel Architecture (MAC) bus, the Enhanced ISA bus, the Video Electronics Standards Association (VESA) local bus, and the Peripheral Component Interconnect (PCI) bus.
[0137] Electronic device 7 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by electronic device 7, including volatile and non-volatile media, removable and non-removable media.
[0138] Memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. Electronic device 7 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 34 may be used to read and write non-removable, non-volatile magnetic media (…). Figure 7 Not shown; usually referred to as a "hard drive".
[0139] although Figure 7Not shown, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk") and an optical disc drive for reading and writing to a removable non-volatile optical disc (e.g., a compact disc read-only memory (CD-ROM), a digital video disc read-only memory (DVD-ROM), or other optical media) may be provided. In these cases, each drive may be connected to bus 18 via one or more data media interfaces. Memory 28 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the embodiments of this disclosure.
[0140] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in memory 28. Such program modules 42 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include an implementation of a network environment. Program modules 42 typically perform the functions and / or methods described in the embodiments of this disclosure.
[0141] Electronic device 7 can also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), and with one or more devices that enable human interaction with electronic device 7, and / or with any device that enables electronic device 7 to communicate with one or more other computing devices (e.g., network card, modem, etc.). This communication can be performed via input / output (I / O) interface 22. Furthermore, electronic device 7 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 20. As shown, network adapter 20 communicates with other modules of electronic device 7 via bus 18. It should be understood that, although not shown in the figure, other hardware and / or software modules can be used in conjunction with electronic device 7, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.
[0142] The processing unit 16 executes various functional applications and parameter information determination by running programs stored in the memory 28, such as implementing the business node processing method mentioned in the foregoing embodiments.
[0143] It should be noted that in the description of this disclosure, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance. Furthermore, in the description of this disclosure, unless otherwise stated, "a plurality of" means two or more.
[0144] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing a particular logical function or process, and the scope of preferred embodiments of this disclosure includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the function involved, as will be understood by those skilled in the art to which embodiments of this disclosure pertain.
[0145] It should be understood that various parts of this disclosure can be implemented using hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented using software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.
[0146] Those skilled in the art will understand that all or part of the steps of the methods in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.
[0147] Furthermore, the functional units in the various embodiments of this disclosure can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.
[0148] The storage media mentioned above can be read-only memory, disk, or optical disk, etc.
[0149] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of this disclosure. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.
[0150] Although embodiments of the present disclosure have been shown and described above, it is to be understood that the above embodiments are exemplary and should not be construed as limiting the present disclosure. Those skilled in the art can make changes, modifications, substitutions and variations to the above embodiments within the scope of the present disclosure.
Claims
1. A method for processing business nodes, characterized in that, include: Obtain an initial node information table for the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the basic node information of each candidate service node; At least a portion of the first candidate service nodes are determined from the plurality of candidate service nodes, wherein the first candidate service nodes refer to candidate service nodes that are in an abnormal state; The first node basic information of the first candidate service node is determined. The first node basic information includes: first node level and first node running time. The first node level is used to describe the level of the first candidate service node in the service node network of the target service. Determine the candidate service node corresponding to the first candidate service node, wherein the node level of the corresponding candidate service node is lower than the node level of the first node and is adjacent to the node level of the first node; Based on the running time of the first node and the corresponding candidate service node, priority information for handling the first candidate service node is determined, wherein the priority information is the longest running time information between the first candidate service node and the downstream root node affected by it. A second candidate service node is determined from at least a portion of the first candidate service nodes based on the priority information.
2. The method as described in claim 1, characterized in that, in, The step of determining the priority information based on the runtime of the first node and the corresponding candidate service node includes: Determine whether the second initial node basic information of the corresponding candidate service node belongs to the initial node information table to obtain the determination result; The priority information is determined based on the determination result, the running time of the first node, and the basic information of the second initial node.
3. The method as described in claim 2, characterized in that, The second initial node basic information includes: the second initial node running time; wherein, determining the priority information based on the determination result, the first node running time, and the second initial node basic information includes: A reference running time is generated based on the running time of the first node and the running time of the second initial node; The priority information is determined based on the reference runtime and the determination result.
4. The method as described in claim 3, characterized in that, The basic information of the first node also includes: the first node path identifier of the first candidate service node; the basic information of the second initial node also includes: the second node level and the second node path identifier of the corresponding candidate service node; the first node path identifier is used to describe the position of the first candidate service node in the service node network; the second node path identifier is used to describe the position of the corresponding candidate service node in the service node network. The step of determining the priority information based on the reference running time and the determination result includes: If the determination result indicates that the basic information of the second initial node does not belong to the initial node information table, then the basic information of the second target node is generated according to the reference running time, the second node level, the first node path identifier and the second node path identifier, and the basic information of the second target node is stored in the initial node information table to obtain the target node information table; If the determination result indicates that the basic information of the second initial node belongs to the initial node information table, then the initial node information table is updated according to the reference running time to obtain the target node information table; The priority information is determined based on the target node information table.
5. The method as described in claim 4, characterized in that, The step of generating basic information for the second target node based on the reference running time, the second node level, the first node path identifier, and the second node path identifier includes: Generate the target node path based on the first node path identifier and the second node path identifier; Based on the reference running time, the second node level, and the target node path, the basic information of the second target node is generated.
6. The method as described in claim 5, characterized in that, The step of updating the initial node information table based on the reference running time to obtain the target node information table includes: Candidate business nodes whose node paths contain the target node path are obtained from the initial node information table and are used as candidate business nodes to be updated. Obtain the first node completion time of the corresponding candidate service node; When the completion time of the first node is less than the reference running time, a running time modification amount is generated based on the reference running time and the completion time of the first node. Based on the runtime modification amount, the initial node completion time of the candidate service node to be updated is updated to obtain the target node completion time, and the updated initial node information table is used as the target node information table.
7. The method as described in claim 6, characterized in that, The step of determining the priority information based on the target node information table includes: The target node completion time of the candidate business nodes in the target node information table is sorted to obtain the sorting result. The priority information is determined based on the sorting results.
8. A business node processing device, characterized in that, include: The acquisition module is used to acquire an initial node information table of the target service, wherein the initial node information table is used to describe multiple candidate service nodes related to the target service and the basic node information of each candidate service node; The first determining module is used to determine at least a portion of the first candidate service nodes from the plurality of candidate service nodes, wherein the first candidate service nodes refer to candidate service nodes that are in an abnormal state. The second determining module is used to determine the first node basic information of the first candidate service node, the first node basic information including: first node level and first node running time, wherein the first node level is used to describe the level of the first candidate service node in the service node network of the target service, and to determine the candidate service node corresponding to the first candidate service node, wherein the node level of the corresponding candidate service node is lower than the first node level and adjacent to the first node level; and to determine the priority information for anomaly handling of the first candidate service node based on the first node running time and the corresponding candidate service node, wherein the priority information is the longest running time information between the first candidate service node and the downstream root node affected by it. The third determining module is used to determine the second candidate service node from the at least part of the first candidate service nodes based on the priority information.
9. The apparatus as claimed in claim 8, Its features are, The second determining module includes: The first determining submodule is used to determine the candidate service node corresponding to the first candidate service node, wherein the node level of the corresponding candidate service node is lower than the node level of the first node and is adjacent to the first node level. The second determining submodule is used to determine the priority information based on the running time of the first node and the corresponding candidate service node.
10. The apparatus as claimed in claim 9, characterized in that, in, The second determining submodule is specifically used for: Determine whether the second initial node basic information of the corresponding candidate service node belongs to the initial node information table to obtain the determination result; The priority information is determined based on the determination result, the running time of the first node, and the basic information of the second initial node.
11. The apparatus as claimed in claim 10, characterized in that, The basic information of the second initial node includes: the running time of the second initial node; wherein, the second determining submodule is further used for: A reference running time is generated based on the running time of the first node and the running time of the second initial node; The priority information is determined based on the reference runtime and the determination result.
12. The apparatus as claimed in claim 11, characterized in that, The basic information of the first node also includes: the first node path identifier of the first candidate service node; the basic information of the second initial node also includes: the second node level and the second node path identifier of the corresponding candidate service node; the first node path identifier is used to describe the position of the first candidate service node in the service node network; the second node path identifier is used to describe the position of the corresponding candidate service node in the service node network. The second determining submodule is further configured to: If the determination result indicates that the basic information of the second initial node does not belong to the initial node information table, then the basic information of the second target node is generated according to the reference running time, the second node level, the first node path identifier and the second node path identifier, and the basic information of the second target node is stored in the initial node information table to obtain the target node information table; If the determination result indicates that the basic information of the second initial node belongs to the initial node information table, then the initial node information table is updated according to the reference running time to obtain the target node information table; The priority information is determined based on the target node information table.
13. The apparatus as claimed in claim 12, characterized in that, The second determining submodule is further configured to: Generate the target node path based on the first node path identifier and the second node path identifier; Based on the reference running time, the second node level, and the target node path, the basic information of the second target node is generated.
14. The apparatus as claimed in claim 13, characterized in that, The second determining submodule is further configured to: Candidate business nodes whose node paths contain the target node path are obtained from the initial node information table and are used as candidate business nodes to be updated. Obtain the first node completion time of the corresponding candidate service node; When the completion time of the first node is less than the reference running time, a running time modification amount is generated based on the reference running time and the completion time of the first node. Based on the runtime modification amount, the initial node completion time of the candidate service node to be updated is updated to obtain the target node completion time, and the updated initial node information table is used as the target node information table.
15. The apparatus as claimed in claim 14, characterized in that, The second determining submodule is further configured to: The target node completion time of the candidate business nodes in the target node information table is sorted to obtain the sorting result. The priority information is determined based on the sorting results.
16. An electronic device, characterized in that, include: At least one processor; as well as A memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
17. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, in, The computer instructions are used to cause the computer to perform the method according to any one of claims 1-7.
18. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the steps of the method according to any one of claims 1-7.
Citation Information
Patent Citations
Positioning method and system of computing node and management node
CN102446131A
