Service node optimization method and device, electronic equipment and storage medium
By establishing a relationship diagram of business services and nodes, the ideal time-consuming threshold for business nodes is calculated, which solves the problem of low accuracy caused by manual experience settings in the prior art, and improves the accuracy and adaptability of obstructing node judgments.
Patent Information
- Application Number
- CN202411115883.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-14
- Publication Date
- 2024-11-26
AI Technical Summary
In the prior art, manual setting of the service node time-consuming threshold based on experience leads to low accuracy and lack of rigor when judging obstructed nodes.
By obtaining the ideal business time-consuming and business data of each business service, a first and second relationship diagram are established, the ideal node time-consuming of each business node is calculated based on the ideal business time-consuming and probability values, and the execution ratio is carried out. Weighted calculations determine the node time-consuming threshold of the business node to judge the obstructed node.
It improves the accuracy and adaptability of judging obstructed nodes, and ensures the scientificity and rationality of the node time-consuming threshold in the business process.
Smart Images

Figure CN119026743A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of data processing technology, and in particular to a method and device for optimizing a service node, an electronic device, and a storage medium. Background Art
[0002] Usually, the business department of an enterprise includes multiple sub-departments, each of which is responsible for handling matters corresponding to a certain business node in the business process. At the same time, the enterprise provides a variety of business services to the outside world. The execution of each business service is allocated and transferred to the corresponding sub-department according to the corresponding business process to cooperate and complete. Among them, the processing time of business services is the data that users are most concerned about and can most directly reflect the business service capabilities of the enterprise. Therefore, the enterprise will evaluate the business service level of the business department and optimize the business process based on the processing time of business services. However, when evaluating the business service level, users usually only provide user feedback at the level of each type of business service, and will not sink to each business node of the business service (for example: in the business service of newly installed broadband, it specifically includes: work order creation node, installation and maintenance scheduling node, work order acceptance node, work order reservation node, on-site installation node and work order completion node. Users usually only evaluate and feedback the entire new broadband business service, and will not evaluate a certain node), resulting in the enterprise being unable to conduct a reasonable and scientific business service evaluation of specific business nodes.
[0003] In order to solve the problem of how to analyze the obstruction business nodes of the business process from the processing time consumption data of a large amount of business services, and then reduce the processing time of the entire business process by optimizing the obstruction business nodes, so as to improve the business service capabilities of the enterprise, it is usually adopted to set a business node time consumption threshold for each sub-department through manual experience. If the time consumed by a sub-department to handle matters exceeds the business node time consumption threshold, this sub-department is considered to be an obstruction node in the entire business process. If it does not exceed the business node time consumption threshold, this sub-department is considered to be a normal node in the entire business process.
[0004] However, in the prior art, the business node time consumption threshold corresponding to each sub-department is set manually based on experience, and the obstruction nodes in the entire business process are judged by comparing the time consumed by the sub-department to handle matters with the corresponding business node time consumption threshold. This method lacks rigor in setting the business node time consumption threshold, resulting in low accuracy in judging obstruction nodes. Summary of the invention
[0005] The present disclosure provides a method and device for optimizing a business node, an electronic device, and a storage medium. The main purpose is to solve the problem that in the prior art, the business node time consumption threshold corresponding to each sub-department is set manually based on experience, and the obstruction node in the entire business process is judged by comparing the time consumed by the sub-department to handle matters with the corresponding business node time consumption threshold, which lacks rigor in setting the business node time consumption threshold, resulting in low accuracy in judging the obstruction node.
[0006] According to a first aspect of the present disclosure, a method for optimizing a service node is provided, comprising:
[0007] Obtaining the ideal business time corresponding to each business service, and obtaining the business data corresponding to each business service within a preset time period; wherein each business service includes multiple business nodes, and the business data at least includes the number of executions of the business service;
[0008] Perform data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes;
[0009] Performing data search processing in the first relationship graph data according to the ideal business time consumption to obtain an ideal probability value corresponding to each of the business services, and performing data search processing in the second relationship graph data according to the ideal probability value to obtain an ideal node time consumption corresponding to each of the business nodes;
[0010] The ideal node time consumption is weightedly calculated according to the execution ratio corresponding to each of the business services to obtain a node time consumption threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the execution times to the total execution times of all business services.
[0011] Optionally, performing data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes includes:
[0012] Obtaining node identification information corresponding to each of the service nodes, node time consumption corresponding to each of the service nodes, and execution times of each of the service services contained in the service data;
[0013] Calculating the business time of each business service according to the node time; wherein the business time is obtained by summing the node time corresponding to the multiple business nodes included in the business service;
[0014] According to the service time consumption and the execution times, data establishment processing is performed through a preset simulation algorithm to obtain the first relationship graph data; wherein the first relationship graph data is used to determine the occurrence probability of the service time consumption;
[0015] According to the node identification information, the node time consumption and the execution times, data establishment processing is performed through the preset simulation algorithm to obtain the second relationship graph data, and the second relationship graph data is used to determine the occurrence probability of the node time consumption.
[0016] Optionally, performing data search processing in the first relationship graph data according to the ideal business time consumption to obtain an ideal probability value corresponding to each of the business services includes:
[0017] Determine, according to the ideal business duration corresponding to each of the business services and the first relationship graph data, a first corresponding relationship between each of the ideal business durations and each of the first relationship graph data;
[0018] Based on the first corresponding relationship, data search processing is performed in the first relationship graph data according to the ideal service time consumption to obtain the ideal probability value.
[0019] Optionally, performing data search processing in the second relationship graph data according to the ideal probability value to obtain the time consumption of the ideal node corresponding to each of the service nodes includes:
[0020] According to the ideal probability value corresponding to each of the business services and the second relationship graph data, determine a second corresponding relationship between each of the ideal probability values and each of the second relationship graph data; wherein each of the ideal probability values corresponds to at least one of the second relationship graph data;
[0021] Based on the second corresponding relationship, data search processing is performed in the second relationship graph data according to the ideal probability value to obtain the ideal node time consumption.
[0022] Optionally, performing weighted calculation processing on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain the node time consumption threshold corresponding to each of the business nodes includes:
[0023] Determine the distribution information of each of the business nodes in each of the business services to obtain node distribution information; wherein the node distribution information is used to determine the distribution status of the business nodes in each of the business services;
[0024] The ideal node time consumption is weightedly calculated according to the execution ratio and the node distribution information to obtain the node time consumption threshold.
[0025] Optionally, after performing weighted calculation processing on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain the node time consumption threshold corresponding to each of the business nodes, the method further includes:
[0026] The target node time consumption of obtaining the target service node; wherein the target service node is any service node among all the service nodes;
[0027] When the target node time consumption is less than or equal to the target time consumption threshold, the target service node is determined to be a normal node; wherein the target time consumption threshold is the node time consumption threshold corresponding to the target service node among all the node time consumption thresholds;
[0028] When the target node time consumption is greater than the target time consumption threshold, obtaining the target number of times that the target node time consumption is greater than the target time consumption threshold;
[0029] When the target number is greater than a preset number threshold, the target service node is determined to be an obstruction node.
[0030] According to a second aspect of the present disclosure, there is provided a device for optimizing a service node, including:
[0031] A first acquisition unit is used to acquire an ideal business duration corresponding to each business service, and acquire business data corresponding to each business service within a preset time period; wherein each business service includes multiple business nodes, and the business data at least includes the number of execution times of the business service;
[0032] An establishing unit, used for performing data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes;
[0033] A search unit, configured to perform data search processing in the first relationship graph data according to the ideal business time consumption to obtain an ideal probability value corresponding to each of the business services, and perform data search processing in the second relationship graph data according to the ideal probability value to obtain an ideal node time consumption corresponding to each of the business nodes;
[0034] A calculation unit is used to perform weighted calculation processing on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain a node time consumption threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the execution times to the total execution times of all business services.
[0035] Optionally, the establishing unit includes:
[0036] An acquisition module, used to acquire node identification information corresponding to each of the business nodes, node time consumption corresponding to each of the business nodes, and execution times of each of the business services contained in the business data;
[0037] A calculation module, used to calculate the service time consumption of each service according to the node time consumption; wherein the service time consumption is obtained by summing the node time consumptions corresponding to the multiple service nodes included in the service;
[0038] An establishment module, used to perform data establishment processing through a preset simulation algorithm according to the service time consumption and the execution times, to obtain the first relationship graph data; wherein the first relationship graph data is used to determine the occurrence probability of the service time consumption;
[0039] The establishment module is also used to perform data establishment processing through the preset simulation algorithm according to the node identification information, the node time consumption and the number of executions to obtain the second relationship graph data, and the second relationship graph data is used to determine the occurrence probability of the node time consumption.
[0040] Optionally, the searching unit includes:
[0041] A determination module, configured to determine a first corresponding relationship between each of the ideal business durations and each of the first relationship graph data according to the ideal business duration corresponding to each of the business services and the first relationship graph data;
[0042] A search module is used to perform data search processing in the first relationship graph data based on the first corresponding relationship and the ideal business time consumption to obtain the ideal probability value.
[0043] Optionally, the searching unit is further used for:
[0044] According to the ideal probability value corresponding to each of the business services and the second relationship graph data, determine a second corresponding relationship between each of the ideal probability values and each of the second relationship graph data; wherein each of the ideal probability values corresponds to at least one of the second relationship graph data;
[0045] Based on the second corresponding relationship, data search processing is performed in the second relationship graph data according to the ideal probability value to obtain the ideal node time consumption.
[0046] Optionally, the computing unit includes:
[0047] A determination module, used to determine the distribution information of each of the business nodes in each of the business services, and obtain node distribution information; wherein the node distribution information is used to determine the distribution status of the business nodes in each of the business services;
[0048] A calculation module is used to perform weighted calculation processing on the ideal node time consumption according to the execution ratio and the node distribution information to obtain the node time consumption threshold.
[0049] Optionally, the device further comprises:
[0050] A second acquisition unit is used to acquire a target node time consumption of a target service node; wherein the target service node is any service node among all the service nodes;
[0051] A determination unit, configured to determine that the target service node is a normal node when the target node time consumption is less than or equal to a target time consumption threshold; wherein the target time consumption threshold is a node time consumption threshold corresponding to the target service node among all the node time consumption thresholds;
[0052] The second acquisition unit is further configured to, when the target node time consumption is greater than the target time consumption threshold, acquire a target number of times that the target node time consumption is greater than the target time consumption threshold;
[0053] The determining unit is further configured to determine that the target service node is an obstruction node when the target number of times is greater than a preset number threshold.
[0054] According to a third aspect of the present disclosure, there is provided an electronic device, including:
[0055] at least one processor; and
[0056] a memory communicatively connected to the at least one processor; wherein,
[0057] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method described in the first aspect.
[0058] According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute the method described in the first aspect.
[0059] According to a fifth aspect of the present disclosure, a computer program product is provided, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements the method as described in the first aspect above.
[0060] The present disclosure provides a method and device for optimizing business nodes, an electronic device, and a storage medium, which obtain an ideal business time corresponding to each business service, and obtain business data corresponding to each of the business services within a preset time period; wherein each of the business services includes multiple business nodes, and the business data at least includes the number of executions of the business service; data establishment processing is performed according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes; data search processing is performed in the first relationship graph data according to the ideal business time to obtain an ideal probability value corresponding to each of the business services, and data search processing is performed in the second relationship graph data according to the ideal probability value to obtain an ideal node time corresponding to each of the business nodes; the ideal node time is weightedly calculated according to the execution ratio corresponding to each of the business services to obtain a node time threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the number of executions to the total number of executions of all business services. Compared with the related art, the embodiment of the present disclosure establishes a first relationship graph of business services and a second relationship graph of each business node, and reversely allocates the ideal node time of the business node according to the acquired ideal business time, the first relationship graph and the second relationship graph of each business node, and then weights and calculates them according to the number of executions of each business service to obtain the node time threshold of the business node. By comparing the node time threshold obtained by the embodiment of the present disclosure with the time consumed by the sub-department to handle matters, the method of judging the obstruction nodes in the entire business process has high accuracy and adaptability when judging the obstruction nodes.
[0061] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0062] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.
[0063] Figure 1 A schematic diagram of a flow chart of a method for optimizing a service node provided by an embodiment of the present disclosure;
[0064] Figure 2 A processing interface diagram of a business service provided by an embodiment of the present disclosure;
[0065] Figure 3 A schematic diagram of a relationship graph data provided by an embodiment of the present disclosure;
[0066] Figure 4 A schematic diagram of a process for establishing relationship graph data provided by an embodiment of the present disclosure;
[0067] Figure 5 A schematic diagram of a calculation process of a node time consumption threshold provided in an embodiment of the present disclosure;
[0068] Figure 6 A schematic diagram of the structure of a service node optimization device provided by an embodiment of the present disclosure;
[0069] Figure 7 A schematic diagram of the structure of another service node optimization device provided by an embodiment of the present disclosure;
[0070] Figure 8 A schematic block diagram of an electronic device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION
[0071] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.
[0072] The disclosed embodiment can be applied to any blocked node evaluation that can provide multiple business services, each of which has multiple sub-department nodes. This makes it easier to discover weaknesses in the business management of the enterprise, locate the obstruction links in the business process of the enterprise, reduce the time consumption of business processing, and improve the business service capabilities of the enterprise.
[0073] When an enterprise is providing business services, a large number of business processing work orders will flow. Therefore, it is necessary to judge the low processing efficiency or blocked nodes in the business flow data of a large number of business processing work orders. The disclosed embodiment is specifically implemented and applied in the visual analysis large screen project, mainly to discover the weaknesses in enterprise management, locate the obstruction links in the business process of the enterprise, reduce the time consumption of business processing, and improve the business service capabilities of the enterprise.
[0074] The following describes a method and device for optimizing a service node, an electronic device, and a storage medium according to an embodiment of the present disclosure with reference to the accompanying drawings.
[0075] Figure 1 A flowchart of a method for optimizing a service node provided in an embodiment of the present disclosure.
[0076] like Figure 1 As shown, the method comprises the following steps:
[0077] Step 101, obtain the ideal business duration corresponding to each business service, and obtain the business data corresponding to each business service within a preset time period; wherein each business service includes multiple business nodes, and the business data at least includes the execution times of the business service.
[0078] In the embodiment of the present disclosure, the preset time period is a custom-set time period, such as 1 week, 1 month, etc. The business data may represent the business process data of the business service. The business process data (business data) includes the business node and the processing time consumed by each business node each time the business is executed within the cycle time range. Specifically, the embodiment of the present disclosure does not limit the preset time period and the content of the business data.
[0079] Among them, the ideal business time is the ideal time for processing the business service as fed back by users. For example, when the overall time consumption of the business process is 58 hours, the user's favorable rate is the highest, then 58 hours is the ideal business time. The ideal time consumption is obtained, including but not limited to the following methods: determining the ideal business time consumption of the business process based on user feedback or favorable rate. For example, among all user evaluations, if the processing time of 58 hours or more corresponds to a sudden drop in the user favorable rate of the business process, or the frequency of keywords such as "time-consuming" appearing in the evaluation text suddenly increases, then 58 hours is determined to be the ideal business time.
[0080] The business service is an overall business process, and the business nodes included in the business service are various business links under the overall business process. For example, if the business service is home broadband installation, the business nodes included in the business service are various links under the home broadband installation: work order creation, installation and maintenance scheduling, work order acceptance, work order appointment, on-site installation, work order completion, etc.
[0081] At the same time, in actual applications, when obtaining business data, after the business data is proposed in the business flow system, it can be stored in the form of an array, which includes identification information consisting of the identification corresponding to the business node and time data consisting of the processing time each time the business node is executed, namely, node time. For example: the first type of business service includes 3 business nodes, namely node A1, node B1, and node C1 (A1, B1, and C1 are 3 process nodes executed sequentially by the first type of business service), and the processing time of each node is [TX1, TX2, ···TXN], X is A, B or C, and N is the number of times it is executed. Then the business process data corresponding to the first type of business service includes: array 1 [A1, TA1, TA2, ···TAN], array 2 [B1, TB1, TB2, ···TBN], array 3 [C1, TC1, TC2, ···TCN].
[0082] The second type of business service includes 4 business nodes, namely node A2, node B2, node C2, and node D2 (A2, B2, C2, and D2 are the 4 process nodes executed sequentially by the second type of business service). The processing time of each node is [TY1, TY2, ···TYM], Y is A, B, C or D, and M is the number of times it is executed. The business process data corresponding to the second type of business service include: array 1 [A2, TA1, TA2, ···TAM], array 2 [B2, TB1, TB2, ···TBM], array 3 [C2, TC1, TC2, ···TCM], array 4 [D2, TD1, TD2, ···TDM].
[0083] ···
[0084] And so on.
[0085] Step 102: Perform data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes.
[0086] In an embodiment of the present disclosure, a method for establishing the first relationship graph data and the second relationship graph data is a method of custom settings, such as a Monte Carlo simulation method, wherein the first relationship graph data is the data obtained after a Monte Carlo simulation of the overall processing time of each business service is performed based on the business data of each business service, and the horizontal axis is the processing time (business time) of the business service, and the vertical axis is a relationship coordinate graph of the probability of occurrence, and a cumulative probability curve is drawn in the relationship coordinate graph.
[0087] For example, Figure 2 As shown, Figure 2 A processing interface diagram of a business service provided in an embodiment of the present disclosure, wherein the business service takes home broadband installation as an example. The home broadband installation has processes such as work order creation, installation and maintenance scheduling, work order acceptance, work order reservation, on-site installation, and work order completion. The processing time of each business node in each business order can be queried in the business flow system. After obtaining the processing time of each business node, a Monte Carlo simulation is first established for the overall processing time of each type of business service to obtain a relational coordinate diagram of the overall processing time of the business service.
[0088] Regarding the first relationship graph data, Figure 3 As shown, Figure 3A schematic diagram of a relationship graph data provided by an embodiment of the present disclosure, wherein the column represents the proportion of the business process corresponding to the overall processing time of the business process in all business process processes, that is, the probability corresponding to the number of occurrences, and the curve represents the cumulative probability. For example, the proportion of the overall processing time of the business process is less than 60 hours is 70%. The proportion of the business process processing time is less than 56 hours is 35%.
[0089] The establishment method and content form of the second relationship graph data are the same as those of the first relationship graph data. The difference is that the horizontal axis of the second relationship graph data is the time consumption data (node consumption) when the sub-department node is actually executed, and the vertical axis is the occurrence probability.
[0090] It should be noted that the first relationship graph data at least includes the first probability value corresponding to the business time consumption of the business service, each business service corresponds to multiple second relationship graph data, and the second relationship graph data at least includes the second probability value corresponding to the time consumption of each node.
[0091] Step 103: perform data search in the first relationship graph data according to the ideal business time to obtain the ideal probability value corresponding to each of the business services, and perform data search in the second relationship graph data according to the ideal probability value to obtain the ideal node time corresponding to each of the business nodes.
[0092] In the embodiment of the present disclosure, the data search and processing of the ideal business time in the first relationship graph data is to perform data search and processing on the ideal business time in the first relationship graph data corresponding to the same business service. For example, when performing data search on the ideal business time corresponding to the first category of business services, it is necessary to perform the search on the first relationship graph data corresponding to the first category of business services.
[0093] The ideal probability value is a cumulative probability, and the ideal cumulative probability (ideal probability value) is matched according to the ideal business time in the corresponding time and probability coordinate diagram of each type of business service (first relationship diagram data). (Ideal probability value) indicates the probability value corresponding to the sum of the number of occurrences of the ideal business time that the user can accept, that is, in the first relationship diagram, the sum of the probabilities corresponding to the ideal business time and the business time that is less than the ideal business time.
[0094] The ideal probability value is searched and processed in the second relationship graph data. Similarly, the ideal probability value is searched and processed in the second relationship graph data corresponding to the same business service. For example, when searching for the ideal probability value corresponding to the first type of business service, it is necessary to search in the second relationship graph data corresponding to all the business nodes included in the first type of business service.
[0095] It should be noted that the process of finding the ideal probability value and the ideal node time consumption can be expressed as obtaining the ideal probability value based on the ideal business time consumption and the first relationship graph data, and then determining the ideal time consumption (ideal node time consumption) of the sub-department node based on the ideal probability value and the second relationship graph data.
[0096] Step 104, weighted calculation processing is performed on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain a node time consumption threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the execution times to the total execution times of all business services.
[0097] In the embodiment of the present disclosure, since one business node can exist in multiple business services, and the ideal node time is the ideal time of the sub-department node (business node) corresponding to each business service, without considering all types of business services, it is necessary to perform a corresponding weighted sum calculation on the ideal node time according to the number of executions of different business services existing in the business node, the proportion of the number of executions of any type of business service in the number of executions of all types of business services and the execution ratio, so as to obtain the ideal time of the business node considering all types of business services as the node time threshold.
[0098] Specifically, the calculation of the node time threshold can be performed in the following manner but is not limited to: the ideal time consumption of nodes A1, B1 and C1 for the first type of business service is 23 hours, 18 hours and 19 hours respectively, and the ideal time consumption of nodes A2, B2, C2 and D2 for the second type of business service is 15 hours, 32 hours, 22 hours and 19 hours respectively; and the number of business process processing times for the first type of business service is 1000 times, and the number of business process processing times for the second type of business service is 3000 times, then node A1 The ideal time consumption of the sub-department node corresponding to node A2 (i.e., the threshold of the time consumption for business process processing) is 23×(1 / 4)+15×(3 / 4)=17 hours, and the ideal time consumption of the sub-department node corresponding to nodes B1 and B2 is 28×(1 / 4)+32×(3 / 4)=31 hours, and the ideal time consumption of the sub-department node corresponding to nodes C1 and C2 is 19×(1 / 4)+22×(3 / 4)=21.25 hours, and the ideal time consumption of the sub-department node corresponding to node D2 is 19×(3 / 4)=14.25. Among them, A1 and A2 are the same business nodes in different business services, B1 and B2 are the same business nodes in different business services, and C1 and C2 are the same business nodes in different business services.
[0099] Regarding the same business node in different business services, for example: the first type of business service is home broadband installation, which includes the following business nodes: work order creation, installation and maintenance scheduling, work order acceptance, work order reservation, on-site installation, and work order completion; the second type of business service is home broadband disassembly, which includes the following business nodes: work order creation, disassembly scheduling, work order acceptance, work order reservation, on-site disassembly, and work order completion. In this case, the business nodes work order creation, work order acceptance, work order reservation, and work order completion are the same business nodes in different business services.
[0100] The business node optimization method provided by the present disclosure obtains the ideal business time corresponding to each business service, and obtains the business data corresponding to each of the business services within a preset time period; wherein each of the business services includes multiple business nodes, and the business data at least includes the number of executions of the business service; data establishment processing is performed according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes; data search processing is performed in the first relationship graph data according to the ideal business time to obtain an ideal probability value corresponding to each of the business services, and data search processing is performed in the second relationship graph data according to the ideal probability value to obtain an ideal node time corresponding to each of the business nodes; weighted calculation processing is performed on the ideal node time according to the execution ratio corresponding to each of the business services to obtain a node time threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the number of executions to the total number of executions of all business services. Compared with the related art, the embodiment of the present disclosure establishes a first relationship graph of business services and a second relationship graph of each business node, and reversely allocates the ideal node time of the business node according to the acquired ideal business time, the first relationship graph and the second relationship graph of each business node, and then weights and calculates them according to the number of executions of each business service to obtain the node time threshold of the business node. By comparing the node time threshold obtained by the embodiment of the present disclosure with the time consumed by the sub-department to handle matters, the method of judging the obstruction nodes in the entire business process has high accuracy and adaptability when judging the obstruction nodes.
[0101] It should be noted that the business process data includes the business node and the processing time of each business node each time the business is executed within the cycle time range. For example: the bureau has a home broadband installation process, which will go through various links and finally complete the installation at the user's home. The installation process involves multiple links, and each link is performed by a business node or department. So how to judge which business node has low processing efficiency during the installation process and is a blocked node? The business node needs to be warned and rectified. Therefore, the purpose of the embodiment of the present disclosure is to find the blocked node with low processing efficiency in a large amount of business process data, and optimize the entire business process by optimizing the blocked node.
[0102] In one possible implementation of the embodiment of the present disclosure, as a refinement of the above step 102, regarding the establishment process of the first relationship graph data and the second relationship graph data, the embodiment of the present disclosure provides a schematic diagram of the establishment process of the relationship graph data, such as Figure 4 As shown, including:
[0103] Step 401: Obtain node identification information corresponding to each of the service nodes, node time consumption corresponding to each of the service nodes, and execution times of each of the service services contained in the service data.
[0104] In the embodiments of the present disclosure, the business process data (business data) includes the business node and the processing time consumed each time each business node executes a business within a cycle time range. In actual applications, when obtaining business data, the business data can be stored in an array form after being proposed in the business flow system. The array includes identification information composed of the identification corresponding to the business node and time data composed of the processing time consumed each time the business node is executed, namely, the node time.
[0105] The node time consumption is used to indicate the time consumption for executing the service node once; the number of execution times of the service service is the same as the number of execution times of the service node included in the service service.
[0106] Step 402, calculating the service time of each of the business services according to the node time; wherein the service time is obtained by summing up the node time corresponding to the multiple business nodes included in the business service.
[0107] In the embodiment of the present disclosure, the business time consumption is used to indicate the time consumption for executing the business service once. When calculating the business time consumption, the node time consumptions corresponding to all the business nodes included in the business service are added together to obtain the business time consumption.
[0108] Step 403, according to the service time consumption and the execution times, data establishment processing is performed through a preset simulation algorithm to obtain the first relationship graph data; wherein the first relationship graph data is used to determine the occurrence probability of the service time consumption.
[0109] In the embodiment of the present disclosure, the preset simulation algorithm is an algorithm with custom settings, such as Monte Carlo simulation, etc., after performing Monte Carlo simulation on the overall processing time of each business service based on the business data of each business service, the horizontal axis is the processing time of the business service (business time), and the vertical axis is the relationship coordinate diagram of the probability of occurrence, and the data obtained after drawing the cumulative probability curve in the relationship coordinate diagram is the first relationship diagram data.
[0110] Step 404, based on the node identification information, the node time consumption and the execution times, data establishment processing is performed through the preset simulation algorithm to obtain the second relationship graph data, and the second relationship graph data is used to determine the occurrence probability of the node time consumption.
[0111] In the embodiment of the present disclosure, the establishment method and content form of the second relationship graph data are the same as those of the first relationship graph data. The difference is that the horizontal axis of the second relationship graph data is the time consumption data (node consumption) when the sub-department node is actually executed, and the vertical axis is the occurrence probability.
[0112] Based on the node time consumption, a relational coordinate diagram of the time consumption and probability relationship corresponding to each sub-department node (business node) is established, namely the second relational diagram data. The second relational diagram data is obtained by obtaining the time consumption data and execution times of each sub-department node (business node) during actual execution, and drawing it in the coordinate system.
[0113] In one implementable manner of the disclosed embodiment, as a refinement of the above-mentioned step 103, the process of performing data search and processing in the first relationship graph data to obtain the ideal probability value can be implemented in the following manner but is not limited to: determining a first corresponding relationship between each ideal business time consumption and each first relationship graph data based on the ideal business time consumption corresponding to each business service and the first relationship graph data; based on the first corresponding relationship, performing data search and processing in the first relationship graph data according to the ideal business time consumption to obtain the ideal probability value.
[0114] In the disclosed embodiment, the ideal cumulative probability (ideal probability value) is matched in the time consumption and probability relationship coordinate diagram (first relationship diagram data) of each corresponding type of business service according to the ideal business consumption, and (ideal probability value) indicates the probability value corresponding to the sum of the number of occurrences of the ideal business consumption that the user can accept.
[0115] For example: if the ideal time required for the business process of the business service obtained from user feedback is 58 hours (for example: the business process with an overall time requirement of 58 hours has the highest praise rate), through the time-consuming and probability relationship coordinate diagram (first relationship diagram data), the cumulative probability corresponding to 58 hours is matched to 52%, indicating that the first category of business services with the shortest time requirement in the top 52% are the ideal business services for users.
[0116] It should be noted that the first corresponding relationship is the corresponding relationship between the ideal business time corresponding to each business service and the first relationship graph data corresponding to this business service. When performing data search and processing in the first relationship graph data according to the ideal business time, data search and processing is performed in the first relationship graph data corresponding to the specified business service according to the ideal business time corresponding to the specified business service, wherein the specified business service is any business service among all the business services.
[0117] Specifically, the first corresponding relationship is used to determine the corresponding relationship between the ideal business time corresponding to a certain business service and the first relationship graph data corresponding to the business service.
[0118] In one implementable manner of the disclosed embodiment, as a refinement of the above-mentioned step 103, the process of performing data search processing in the second relationship graph data to obtain the ideal node time consumption can be implemented in the following manner but is not limited to: according to the ideal probability value corresponding to each of the business services and the second relationship graph data, determine the second corresponding relationship between each of the ideal probability values and each of the second relationship graph data; wherein each of the ideal probability values corresponds to at least one of the second relationship graph data; based on the second corresponding relationship, perform data search processing in the second relationship graph data according to the ideal probability value to obtain the ideal node time consumption.
[0119] In the disclosed embodiment, the ideal probability value is brought into the established relationship coordinate diagram of each sub-department node (second relationship diagram data), and the ideal processing time, i.e., the ideal node time, of each sub-department node (business node) in each type of business service is queried.
[0120] The second corresponding relationship is the corresponding relationship between the ideal probability value corresponding to each of the business services and the second relationship graph data corresponding to all the business nodes contained in this business service. When performing data search processing in the second relationship graph data according to the ideal probability value, data search processing is performed in the second relationship graph data corresponding to all the business nodes contained in the specified business service according to the ideal probability value corresponding to the specified business service, wherein the specified business service is any business service among all the business services.
[0121] The ideal probability value corresponding to each business service can be used to find the ideal node time corresponding to all the business nodes in this business service. The second corresponding relationship is used to determine the corresponding relationship between the ideal probability value corresponding to a certain business service and the second relationship graph data corresponding to all the business nodes included in this business service.
[0122] It should be noted that since the relationship coordinate diagram of the time consumption and probability relationship corresponding to each type of business service (first relationship diagram data) is obtained through Monte Carlo simulation based on the business process data extracted from the business flow system, after obtaining the relationship coordinate diagram of the time consumption and probability relationship corresponding to each sub-department node (second relationship diagram data), based on the principle of Monte Carlo simulation, the ideal probability value can be transferred back from each type of business service to each corresponding sub-department node (business node), so as to realize the confirmation of the ideal node time consumption of each sub-department node (business node), so as to facilitate the subsequent determination of the business process processing time consumption threshold (node time consumption threshold) according to the ideal node time consumption.
[0123] For example: the first type of business service includes three business nodes, namely node A1, node B1, and node C1. The relationship coordinate diagram of the time consumption and probability relationship is obtained through Monte Carlo simulation (first relationship diagram data), and the ideal probability value corresponding to the ideal business time consumption of the business process of the entire process of the first type of business service is calculated. Based on this principle, the ideal probability value is transferred back from each type of business service to each corresponding sub-department node (business node), that is, according to the ideal probability value of the first type of business service, in the relationship coordinate diagram of the time consumption and probability relationship of each sub-department node (business node) (second relationship diagram data), the ideal node time consumption of node A1, node B1 and node C1 are queried respectively.
[0124] In one possible implementation of the embodiment of the present disclosure, as a refinement of the above step 102, regarding the calculation of the node time consumption threshold, the embodiment of the present disclosure provides a schematic diagram of the calculation process of the node time consumption threshold, such as Figure 5 As shown, including:
[0125] Step 501, determine the distribution information of each of the business nodes in each of the business services to obtain node distribution information; wherein the node distribution information is used to determine the distribution status of the business nodes in each of the business services.
[0126] In the embodiment of the present disclosure, since one business node can exist in multiple business services, and the ideal node time consumption is the ideal time consumption of the sub-department node (business node) corresponding to each business service, not all types of business services are considered. Therefore, in order to consider all types of business services, it is necessary to determine the distribution information of the business nodes and calculate the node time consumption threshold based on the distribution information.
[0127] Among them, the distribution information can be used to determine the distribution of each of the business nodes in all types of the business services. The distribution information can be used to directly determine the same business node in different business services. For example, it can be directly determined that the first business node exists in the first type of business service and the second type of business service, the second business node exists in the first type of business service, and the third business node exists in the first type of business service and the second type of business service.
[0128] Step 502: Perform weighted calculation on the ideal node time consumption according to the execution ratio and the node distribution information to obtain the node time consumption threshold.
[0129] In the disclosed embodiment, when calculating the node time consumption, it is necessary to perform weighted calculation based on the same business node in different business services. The same business node in different business services can be determined by the distribution information. For example, it is determined by the distribution information that the first business node exists in the first category of business services and the second category of business services, the second business node exists in the first category of business services, and the third business node exists in the first category of business services and the second category of business services. Then, when calculating the node time consumption threshold, the first business node in the first category of business services and the first business node in the second category of business services are weighted and calculated to obtain the node time consumption threshold corresponding to the first business node. The second business node in the first category of business services is weighted and calculated alone to obtain the node time consumption threshold corresponding to the second business node. The third business node in the first category of business services and the third business node in the second category of business services are weighted and calculated to obtain the node time consumption threshold corresponding to the third business node.
[0130] In one implementable manner of the embodiment of the present disclosure, after obtaining the node time consumption threshold, it is necessary to apply the node time consumption threshold. Specifically, through the node time consumption threshold, it is determined whether the time consumed by the service node each time it executes the service exceeds the node time consumption threshold. If it exceeds, it indicates that there is node congestion at this service node, which affects the overall processing process of the service. Therefore, regarding the application of the node time consumption threshold, the following method may also be used but is not limited to: obtaining the target node consumption of the target service node; wherein the target service node is any service node among all the service nodes; when the target node consumption is less than or equal to the target time consumption threshold, determining that the target service node is a normal node; wherein the target time consumption threshold is the node consumption threshold corresponding to the target service node among all the node time consumption thresholds; when the target node consumption is greater than the target time consumption threshold, obtaining the target number of times that the target node consumption is greater than the target time consumption threshold; when the target number is greater than the preset number threshold, determining that the target service node is an obstruction node.
[0131] In the disclosed embodiment, the node time consumption thresholds obtained above are used as the business process processing time consumption thresholds of the corresponding sub-department nodes. When the time consumed by the sub-department node to execute business exceeds the threshold, it indicates that during the entire business process processing, the sub-department node is a lagging sub-department node. When the number of times the threshold is exceeded reaches a certain value within a preset time range, it can be determined as a blocking node and determined as a sub-department node that requires process or business optimization.
[0132] In summary, the embodiments of the present disclosure can achieve the following effects:
[0133] 1. The embodiment of the present disclosure establishes a first relationship graph of business services and a second relationship graph of each business node, and reversely allocates the ideal node time of the business node according to the obtained ideal business time, the first relationship graph and the second relationship graph of each business node, and then weights and calculates according to the number of executions of each business service to obtain the node time threshold of the business node. The node time threshold obtained by the embodiment of the present disclosure is compared with the time consumed by the sub-department to handle matters to determine the obstruction nodes in the entire business process. This method has high accuracy and adaptability in determining the obstruction nodes.
[0134] 2. The disclosed embodiment utilizes the weighted sum of the ideal time consumption of the sub-department nodes of each type of business service to determine the business process processing time consumption threshold of each sub-department node, thereby judging whether the sub-department node is a blocked node when executing tasks subsequently.
[0135] 3. Based on the Monte Carlo simulation principle, the ideal time consumption of the entire business service is reversely distributed to each sub-department node of the business service. The ideal processing time of each sub-department node in each type of business service is queried to determine the ideal time consumption of each business node.
[0136] Corresponding to the above-mentioned service node optimization method, the present invention also provides a service node optimization device. Since the device embodiment of the present invention corresponds to the above-mentioned method embodiment, the details not disclosed in the device embodiment can be referred to the above-mentioned method embodiment, and will not be repeated in the present invention.
[0137] Figure 6 A schematic diagram of a structure of an optimization device for a service node provided in an embodiment of the present disclosure, such as Figure 6 As shown, including:
[0138] The first acquisition unit 61 is used to acquire the ideal service time corresponding to each service, and acquire the service data corresponding to each service within a preset time period; wherein each service includes multiple service nodes, and the service data includes at least the number of executions of the service;
[0139] An establishing unit 62, configured to perform data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes;
[0140] A search unit 63 is used to perform data search processing in the first relationship graph data according to the ideal business time to obtain an ideal probability value corresponding to each of the business services, and perform data search processing in the second relationship graph data according to the ideal probability value to obtain an ideal node time corresponding to each of the business nodes;
[0141] The calculation unit 64 is used to perform weighted calculation processing on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain the node time consumption threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the execution times to the total execution times of all business services.
[0142] The business node optimization method provided by the present disclosure obtains the ideal business time corresponding to each business service, and obtains the business data corresponding to each of the business services within a preset time period; wherein each of the business services includes multiple business nodes, and the business data at least includes the number of executions of the business service; data establishment processing is performed according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes; data search processing is performed in the first relationship graph data according to the ideal business time to obtain an ideal probability value corresponding to each of the business services, and data search processing is performed in the second relationship graph data according to the ideal probability value to obtain an ideal node time corresponding to each of the business nodes; weighted calculation processing is performed on the ideal node time according to the execution ratio corresponding to each of the business services to obtain a node time threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the number of executions to the total number of executions of all business services. Compared with the related art, the embodiment of the present disclosure establishes a first relationship graph of business services and a second relationship graph of each business node, and reversely allocates the ideal node time of the business node according to the acquired ideal business time, the first relationship graph and the second relationship graph of each business node, and then weights and calculates them according to the number of executions of each business service to obtain the node time threshold of the business node. By comparing the node time threshold obtained by the embodiment of the present disclosure with the time consumed by the sub-department to handle matters, the method of judging the obstruction nodes in the entire business process has high accuracy and adaptability when judging the obstruction nodes.
[0143] Furthermore, in a possible implementation of the embodiment of the present disclosure, as Figure 7 As shown, the establishing unit 62 includes:
[0144] An acquisition module 621 is used to acquire the node identification information corresponding to each of the business nodes, the node time consumption corresponding to each of the business nodes, and the number of executions of each of the business services contained in the business data;
[0145] A calculation module 622, configured to calculate the service time consumption of each service according to the node time consumption; wherein the service time consumption is obtained by summing the node time consumptions corresponding to the multiple service nodes included in the service;
[0146] Establishing module 623, used for performing data establishment processing by a preset simulation algorithm according to the service time consumption and the execution times, to obtain the first relationship graph data; wherein the first relationship graph data is used to determine the occurrence probability of the service time consumption;
[0147] The establishment module 623 is also used to perform data establishment processing through the preset simulation algorithm according to the node identification information, the node time consumption and the number of executions to obtain the second relationship graph data, and the second relationship graph data is used to determine the occurrence probability of the node time consumption.
[0148] Furthermore, in a possible implementation of the embodiment of the present disclosure, as Figure 7 As shown, the search unit 63 includes:
[0149] A determination module 631 is used to determine a first corresponding relationship between each of the ideal business durations and each of the first relationship graph data according to the ideal business duration corresponding to each of the business services and the first relationship graph data;
[0150] The search module 632 is used to perform data search processing in the first relationship graph data based on the first corresponding relationship and the ideal service time consumption to obtain the ideal probability value.
[0151] Furthermore, in a possible implementation of the embodiment of the present disclosure, as Figure 7 As shown, the search unit 63 is also used for:
[0152] According to the ideal probability value corresponding to each of the business services and the second relationship graph data, determine a second corresponding relationship between each of the ideal probability values and each of the second relationship graph data; wherein each of the ideal probability values corresponds to at least one of the second relationship graph data;
[0153] Based on the second corresponding relationship, data search processing is performed in the second relationship graph data according to the ideal probability value to obtain the ideal node time consumption.
[0154] Furthermore, in a possible implementation of the embodiment of the present disclosure, as Figure 7 As shown, the calculation unit 64 includes:
[0155] The determination module 641 is used to determine the distribution information of each of the business nodes in each of the business services to obtain the node distribution information; wherein the node distribution information is used to determine the distribution status of the business nodes in each of the business services;
[0156] The calculation module 642 is used to perform weighted calculation processing on the ideal node time consumption according to the execution ratio and the node distribution information to obtain the node time consumption threshold.
[0157] Furthermore, in a possible implementation of the embodiment of the present disclosure, as Figure 7 As shown, the device also includes:
[0158] A second acquisition unit 65 is used to acquire a target node time consumption of a target service node; wherein the target service node is any service node among all the service nodes;
[0159] A determination unit 66, configured to determine that the target service node is a normal node when the target node time consumption is less than or equal to a target time consumption threshold; wherein the target time consumption threshold is a node time consumption threshold corresponding to the target service node among all the node time consumption thresholds;
[0160] The second acquisition unit 65 is further configured to, when the target node time consumption is greater than the target time consumption threshold, acquire a target number of times that the target node time consumption is greater than the target time consumption threshold;
[0161] The determining unit 66 is further configured to determine that the target service node is an obstruction node when the target number of times is greater than a preset number threshold.
[0162] It should be noted that the above explanation of the method embodiment is also applicable to the device of the embodiment of the present disclosure, and the principle is the same, which is no longer limited in the embodiment of the present disclosure.
[0163] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
[0164] Figure 8 A schematic block diagram of an example electronic device 800 that can be used to implement an embodiment of the present disclosure 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, 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 disclosure described and / or required herein.
[0165] like Figure 8As shown, the device 800 includes a computing unit 801, which can perform various appropriate actions and processes according to a computer program stored in a ROM (Read-Only Memory) 802 or a computer program loaded from a storage unit 808 to a RAM (Random Access Memory) 803. In the RAM 803, various programs and data required for the operation of the device 800 can also be stored. The computing unit 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An I / O (Input / Output) interface 805 is also connected to the bus 804.
[0166] A number of components in the device 800 are connected to the I / O interface 805, including: an input unit 806, such as a keyboard, a mouse, etc.; an output unit 807, such as various types of displays, speakers, etc.; a storage unit 808, such as a disk, an optical disk, etc.; and a communication unit 809, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 809 allows the device 800 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0167] The computing unit 801 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 801 include, but are not limited to, a CPU (Central Processing Unit), a GPU (Graphic Processing Units), various dedicated AI (Artificial Intelligence) computing chips, various computing units running machine learning model algorithms, a DSP (Digital Signal Processor), and any appropriate processor, controller, microcontroller, etc. The computing unit 801 performs the various methods and processes described above, such as the optimization method of the service node. For example, in some embodiments, the optimization method of the service node may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 808. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 800 via the ROM 802 and / or the communication unit 809. When the computer program is loaded into the RAM 803 and executed by the computing unit 801, one or more steps of the method described above may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to execute the aforementioned service node optimization method in any other appropriate manner (for example, by means of firmware).
[0168] Various embodiments of the systems and techniques described above herein may be implemented in digital electronic circuit systems, integrated circuit systems, FPGAs (Field Programmable Gate Arrays), ASICs (Application-Specific Integrated Circuits), ASSPs (Application Specific Standard Products), SOCs (System On Chips), CPLDs (Complex Programmable Logic Devices), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include: being implemented in one or more computer programs that may be executed and / or interpreted on a programmable system including at least one programmable processor that may be a dedicated or general-purpose programmable processor that may 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.
[0169] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code 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.
[0170] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any suitable combination of the foregoing. More specific examples of machine-readable storage media may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a RAM, a ROM, an EPROM (Electrically Programmable Read-Only-Memory) or a flash memory, an optical fiber, a CD-ROM (Compact Dis sc Read-Only Memory), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0171] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer 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 pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).
[0172] 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: LAN (Local Area Network), WAN (Wide Area Network), the Internet, and blockchain networks.
[0173] A computer 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 relationship between the client and the server 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 ("Virtual Private Server", or "VPS" for short). The server may also be a server of a distributed system, or a server combined with a blockchain.
[0174] It should be noted that artificial intelligence is a discipline that studies how computers can simulate certain human thought processes and intelligent behaviors (such as learning, reasoning, thinking, planning, etc.), and includes both hardware-level and software-level technologies. Artificial intelligence hardware technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, and big data processing; artificial intelligence software technologies mainly include computer vision technology, speech recognition technology, natural language processing technology, as well as machine learning / deep learning, big data processing technology, knowledge graph technology, and other major directions.
[0175] 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 recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.
[0176] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. 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 disclosure shall be included in the protection scope of the present disclosure.
Claims
1. A method for optimizing a service node, characterized in that: include: Obtaining the ideal business time corresponding to each business service, and obtaining the business data corresponding to each business service within a preset time period; wherein each business service includes multiple business nodes, and the business data at least includes the execution times of the business service; Perform data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes; Performing data search processing in the first relationship graph data according to the ideal business time consumption to obtain an ideal probability value corresponding to each of the business services, and performing data search processing in the second relationship graph data according to the ideal probability value to obtain an ideal node time consumption corresponding to each of the business nodes; The ideal node time consumption is weightedly calculated according to the execution ratio corresponding to each of the business services to obtain a node time consumption threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the execution times to the total execution times of all business services.
2. The method according to claim 1, characterized in that The data establishment process is performed according to the business data to obtain the first relationship graph data corresponding to each business service and the second relationship graph data corresponding to each business node, including: Obtaining node identification information corresponding to each of the service nodes, node time consumption corresponding to each of the service nodes, and execution times of each of the service services contained in the service data; Calculating the business time consumption of each business service according to the node time consumption; wherein the business time consumption is obtained by summing the node time consumptions corresponding to the multiple business nodes included in the business service; According to the service time consumption and the execution times, data establishment processing is performed through a preset simulation algorithm to obtain the first relationship graph data; wherein the first relationship graph data is used to determine the occurrence probability of the service time consumption; According to the node identification information, the node time consumption and the execution times, data establishment processing is performed through the preset simulation algorithm to obtain the second relationship graph data, and the second relationship graph data is used to determine the occurrence probability of the node time consumption.
3. The method according to claim 1, characterized in that The performing data search processing in the first relationship graph data according to the ideal business time consumption to obtain the ideal probability value corresponding to each of the business services includes: Determine, according to the ideal business duration corresponding to each of the business services and the first relationship graph data, a first corresponding relationship between each of the ideal business durations and each of the first relationship graph data; Based on the first corresponding relationship, data search processing is performed in the first relationship graph data according to the ideal service time consumption to obtain the ideal probability value.
4. The method according to claim 1, characterized in that: The time consumption of performing data search processing in the second relationship graph data according to the ideal probability value to obtain the ideal node corresponding to each of the service nodes includes: According to the ideal probability value corresponding to each of the business services and the second relationship graph data, determine a second corresponding relationship between each of the ideal probability values and each of the second relationship graph data; wherein each of the ideal probability values corresponds to at least one of the second relationship graph data; Based on the second corresponding relationship, data search processing is performed in the second relationship graph data according to the ideal probability value to obtain the ideal node time consumption.
5. The method according to claim 1, characterized in that The weighted calculation process of the ideal node time consumption according to the execution ratio corresponding to each business service to obtain the node time consumption threshold corresponding to each business node includes: Determine the distribution information of each of the business nodes in each of the business services to obtain node distribution information; wherein the node distribution information is used to determine the distribution status of the business nodes in each of the business services; The ideal node time consumption is weightedly calculated according to the execution ratio and the node distribution information to obtain the node time consumption threshold.
6. The method according to claim 1, characterized in that After performing weighted calculation processing on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain the node time consumption threshold corresponding to each of the business nodes, the method further includes: The target node time consumption of obtaining the target service node; wherein the target service node is any service node among all the service nodes; When the target node time consumption is less than or equal to the target time consumption threshold, the target service node is determined to be a normal node; wherein the target time consumption threshold is the node time consumption threshold corresponding to the target service node among all the node time consumption thresholds; When the target node time consumption is greater than the target time consumption threshold, obtaining the target number of times that the target node time consumption is greater than the target time consumption threshold; When the target number is greater than a preset number threshold, the target service node is determined to be an obstruction node.
7. A service node optimization device, characterized in that: include: A first acquisition unit is used to acquire an ideal business duration corresponding to each business service, and acquire business data corresponding to each business service within a preset time period; wherein each business service includes multiple business nodes, and the business data at least includes the number of execution times of the business service; An establishing unit, used for performing data establishment processing according to the business data to obtain first relationship graph data corresponding to each of the business services and second relationship graph data corresponding to each of the business nodes; A search unit, configured to perform data search processing in the first relationship graph data according to the ideal business time consumption to obtain an ideal probability value corresponding to each of the business services, and perform data search processing in the second relationship graph data according to the ideal probability value to obtain an ideal node time consumption corresponding to each of the business nodes; A calculation unit is used to perform weighted calculation processing on the ideal node time consumption according to the execution ratio corresponding to each of the business services to obtain a node time consumption threshold corresponding to each of the business nodes, wherein the execution ratio is the ratio of the execution times to the total execution times of all business services.
8. 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, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 6.
9. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-6.
10. A computer program product, characterized in that The invention comprises a computer program which, when executed by a processor, implements the method according to any one of claims 1 to 6.
Citation Information
Cited By
Financial service process node optimization method and device, equipment, medium and product
CN119722274A
