CN113793128A - Method, device, equipment and computer readable medium for generating business fault reason information - Google Patents
Method, device, equipment and computer readable medium for generating business fault reason information Download PDFInfo
- Publication number
- CN113793128A CN113793128A CN202111110713.XA CN202111110713A CN113793128A CN 113793128 A CN113793128 A CN 113793128A CN 202111110713 A CN202111110713 A CN 202111110713A CN 113793128 A CN113793128 A CN 113793128A
- Authority
- CN
- China
- Prior art keywords
- service
- information
- node
- path
- fault
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computing arrangements based on specific mathematical models
- G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/20—Administration of product repair or maintenance
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Data Mining & Analysis (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Evolutionary Computation (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Artificial Intelligence (AREA)
- Algebra (AREA)
- Probability & Statistics with Applications (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the disclosure discloses a method and a device for generating service fault reason information, electronic equipment and a computer readable medium. One embodiment of the method comprises: acquiring service fault information to be processed and a pre-generated service directed graph, wherein each node of the service directed graph corresponds to one item of service information, and a weight value is arranged between two nodes connected through a directed line; matching the service fault information in the service directed graph to obtain a target node matched with the service fault information; determining at least one path with the target node as an initial node; and generating service fault reason information corresponding to the service fault information based on at least one path. The embodiment realizes more accurate determination of the service fault reason information.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to a method, a device, equipment and a computer readable medium for generating service fault reason information.
Background
As more services are provided by business systems, the systems become more complex. Various faults often occur in the service system during the use process. When a fault occurs, the experience of a service person is generally relied on to find out the cause of the fault.
However, when the cause of the failure is determined in the above manner, there are often technical problems as follows:
the reasons for failures are often very different and there is often complex internal call logic between services. Therefore, experience of service personnel is easily influenced by subjective factors, and the fault reason is difficult to accurately determine, so that normal operation of a service system is influenced, and service processing efficiency is influenced.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Some embodiments of the present disclosure propose methods, apparatuses, devices and computer readable media to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a method for generating service fault cause information, where the method includes: acquiring service fault information to be processed and a pre-generated service directed graph, wherein each node of the service directed graph corresponds to one item of service information, and a weight value is arranged between two nodes connected through a directed line; matching the service fault information in the service directed graph to obtain a target node matched with the service fault information; determining at least one path with the target node as an initial node; and generating service fault reason information corresponding to the service fault information based on at least one path.
In a second aspect, some embodiments of the present disclosure provide an apparatus for generating service fault cause information, where the apparatus includes: the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is configured to acquire service fault information to be processed and a pre-generated service directed graph, each node of the service directed graph corresponds to one item of service information, and a weight value is arranged between two nodes connected through a directed line; the matching unit is configured to match the service fault information in the service directed graph to obtain a target node matched with the service fault information; a determining unit configured to determine at least one path having a target node as a start node; and the generating unit is configured to generate service fault reason information corresponding to the service fault information based on at least one path.
In a third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the method described in any of the implementations of the first aspect.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium on which a computer program is stored, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect.
The above embodiments of the present disclosure have the following advantages: and organizing a plurality of items of service information in the service system by using the service directed graph. The service directed graph can be used for representing the corresponding relation between the service fault information and the service fault reason information, and the service fault reason information can be more accurately determined due to the elimination of subjective factors. Therefore, faults can be eliminated in time, and the influence on the service processing efficiency due to long-time faults is avoided.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and elements are not necessarily drawn to scale.
Fig. 1 is a schematic diagram of an application scenario of a service failure cause information generation method according to some embodiments of the present disclosure;
FIG. 2 is a flow diagram of some embodiments of a method of business fault cause information generation according to the present disclosure;
FIG. 3 is an exemplary traffic directed graph of a method of generating traffic fault cause information according to some embodiments of the present disclosure;
FIG. 4 is a flow diagram of further embodiments of a method of business fault cause information generation according to the present disclosure;
fig. 5 is a schematic structural diagram of some embodiments of a service failure cause information generating apparatus according to the present disclosure;
FIG. 6 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic diagram of an application scenario of a service failure cause information generation method according to some embodiments of the present disclosure.
The execution main body of the service fault cause information generation method can be hardware or software. When the hardware is implemented, the hardware may be implemented as a distributed cluster consisting of a plurality of servers or terminal devices, or may be implemented as a single server or a single terminal device. When it is software, it can be installed in the above-listed hardware devices. It may be implemented, for example, as multiple software or software modules to provide distributed services, or as a single software or software module. And is not particularly limited herein.
In this application scenario, the execution main body may first obtain the service fault information to be processed and a pre-generated service directed graph. As shown, the traffic directed graph includes 6 nodes a-F. The service information corresponding to the A is abnormal intranet connection of the weighing equipment, the service information corresponding to the B is that the weight of the goods is 0, the service information corresponding to the C is that the goods are mistakenly sorted to the X route, and the service information corresponding to the D is that the charging of the goods is higher. The service information corresponding to E is that the weight of the goods is less than 50 g, and the service information corresponding to F is a remote island coded for the purpose of the goods. A weight value is arranged between two nodes connected by a directed line, and the weight value is as shown in the figure. Taking the weight corresponding to the directional line connecting the A and the B as 0.6 as an example, the meaning is as follows: the 60% weight of the load may be due to abnormal network connections within the weighing apparatus. Similarly, a weight of zero may be 40% of the weight of the load because the load weighs less than 50 grams.
On this basis, the execution main body can match the service failure information in the service directed graph to obtain the target node matched with the service failure information. In the application scenario, the service failure information is "charge is higher" as an example. On this basis, the service failure information can be matched with the service information corresponding to each node, and the target node is obtained as the node D. Then, at least one path with the target node as the start node may be determined. In the application scene, three paths can be obtained, namely D-C-B-A, D-C-F, D-C-B-E. And then, based on the three paths, generating service fault reason information corresponding to the service fault information. As an example, the weighted value of each path may be multiplied to obtain the probability value corresponding to the path. The probability value for D-C-B-a was calculated to be 27.3% (0.65 x 0.7 x 0.6). The D-C-F probability value was 13% (0.65 x 0.2). The probability value for D-C-B-E was 18.2% (0.65 x 0.7 x 0.4). Therefore, the path with the maximum probability value, namely the service information corresponding to the end node (A) in the D-C-B-A can be selected as the service fault reason information. That is to say, in the application scenario, the service fault cause information is that the intranet connection of the weighing equipment is abnormal.
It should be understood that the number of nodes shown in FIG. 1 is exemplary. The nodes can have any data according to actual needs.
With continued reference to fig. 2, a flow 200 of some embodiments of a method of generating business fault cause information in accordance with the present disclosure is shown. The method for generating the service fault reason information comprises the following steps:
In some embodiments, an execution subject of the service fault cause information generation method may first obtain service fault information to be processed and a service directed graph generated in advance. The service directed graph may be stored locally in the execution subject, or may be stored in various electronic devices connected in communication. So that the execution body can acquire the service directed graph in various ways through wired connection or wireless connection.
In some embodiments, the traffic directed graph is used to characterize a correspondence between the traffic failure information and the traffic failure cause information. Each node of the service directed graph corresponds to one service information. The service information may be various related information that may cause a failure. For example, in the field of logistics, the business information may be an abnormal connection of the weighing device, a weight of the piece of goods of 0, a wrong sorting of the piece of goods to the X-route, and the like. The nodes in the service directed graph can be connected through directed lines, and a weight value is arranged between the two nodes connected through the directed lines. The weight value is used for representing the probability of the occurrence of the corresponding service information. In practice, the weight value may be specified or determined by statistics on historical data.
Fig. 3 illustrates a traffic directed graph. The service information corresponding to the A is abnormal intranet connection of the weighing equipment, the service information corresponding to the B is that the weight of the goods is 0, the service information corresponding to the C is that the goods are wrongly sorted to the X route, and the service information corresponding to the D is that the charging of the goods is higher. On this basis, the weight corresponding to the directed line connecting a and B is 0.6, the weight corresponding to the directed line connecting B and C is 0.7, and the weight corresponding to the directed line connecting C and D is 0.65. Taking the example that the weight corresponding to the directional line connecting the A and the B is 0.6, the meaning of the expression is as follows: the 60% weight of the load may be due to abnormal network connections within the weighing apparatus. As another example, the directional line connecting C and D corresponds to a weight of 0.65, meaning that the higher charge for the piece is 65% likely due to the wrong sorting of the piece into the X route. It is understood that the service information may be different according to the service field. The service fault information may be input by service personnel after observation on site, or may be obtained by analyzing information such as a site picture.
In some embodiments, the execution subject may match the service failure information in the service directed graph. In practice, various matching modes can be adopted to match the service information corresponding to each node in the service fault information service directed graph according to needs. And carrying out precise matching or fuzzy matching according to actual needs. As an example, the node corresponding to the service information with the highest matching degree with the service failure information may be determined as the target node.
In some embodiments, the execution agent may determine at least one path with the target node as the start node. As an example, the traffic directed graph may be traversed to find all paths with the target node as the starting node, resulting in at least one path.
In some optional implementation manners of some embodiments, if the scale of the traffic directed graph is large, that is, the number of nodes therein is too large, a large amount of computing resources and computing time are consumed in a traversal manner, which affects timely elimination of a fault. Therefore, in response to the total number of nodes in the traffic directed graph being greater than a preset threshold, the shortest path with the destination node as the starting node is determined. As an example, Dijkstra's algorithm may be employed to determine the shortest path with the destination node as the starting node. On the basis, the first service fault reason information can be generated based on the shortest path. If the probability value of the first failure cause information is greater than the preset threshold, the first service failure cause information can be determined as the service failure cause information. Thereby making it possible to improve the troubleshooting speed.
If the probability value is smaller than the preset threshold value, the service directed graph can be traversed to search other paths taking the target node as the starting node. And generating second service fault reason information according to the rest paths.
And step 204, generating service fault reason information corresponding to the service fault information based on at least one path.
In some embodiments, the execution subject may generate service failure cause information corresponding to the service failure information based on the at least one path.
In some optional implementation manners of some embodiments, generating, based on the at least one path, service failure cause information corresponding to the service failure information includes: and determining probability values corresponding to the paths according to the weight values corresponding to the multiple directed lines in each path. For example, the probability value corresponding to the path may be obtained by multiplying a plurality of weight values on the path. And determining the probability value corresponding to each path and the service information corresponding to the end node in the path as the service fault sub-reason information corresponding to the path. And then, determining at least one piece of service failure sub-reason information corresponding to at least one path as service failure reason information. For example, a piece of service failure sub-cause information with the highest probability value may be determined as the service failure cause information. Or selecting preset number of service fault sub-reason information to be determined as the service fault reason information according to the sequence of the probability values from large to small.
In some optional implementation manners of some embodiments, in addition to considering the probability value of each path, the service failure cause information may be comprehensively determined by combining the number of nodes of each path. For example, the number of nodes may be chosen
In some optional implementation manners of some embodiments, according to a descending order of probability values included in at least one piece of service failure sub-cause information, the overhaul robot is controlled to overhaul equipment corresponding to service information included in at least one piece of service failure sub-cause information in sequence. Therefore, faults can be eliminated in time, and the service processing efficiency is improved.
As an example, if the service information is that the intranet connection of the weighing device is abnormal, the overhaul robot is controlled to restart the network connection device.
In some optional implementation manners of some embodiments, the traffic directed graph may be adjusted after obtaining the traffic fault cause information each time. Therefore, with the increase of the use times, the service directed graph is also accurate, so that the accuracy of subsequently obtained service fault reason information is improved, and the fault removal efficiency is improved.
Therefore, after obtaining the service failure cause information, the execution subject may obtain the historical probability base of the node corresponding to the service failure cause information. Wherein, the historical probability base of the node may be the number of times that the service information corresponding to the node has been determined as the service failure cause information. For example, the service information corresponding to the node a is that the intranet connection of the weighing device is abnormal. Through statistics, the number of times of outputting abnormal intranet connection of the weighing equipment as service fault cause information is 10. Then the historical probability base of the a node is 10. Of course, an initial probability base may be set for the node at initialization, as desired. For example, an initial probability base of 5 may be set for the a node. At this time, if the counted number of times of outputting the intranet connection abnormality of the weighing device as the service fault cause information is 10 times, the historical probability base number of the node a is 15.
On the basis, the execution body can adjust the weight value of the directed line connecting the nodes based on the historical probability base. For example, the weight value corresponding to the directed line connecting the node a is 0.6(6/10), and if the service fault cause information generated this time is again the connection abnormality of the intranet of the weighing apparatus. Then the weight value becomes 0.636 (7/11). Thereby, the weight value can be more accurate.
In some embodiments, a service directed graph is utilized to organize multiple items of service information in a service system. The service directed graph can be used for representing the corresponding relation between the service fault information and the service fault reason information, and the service fault reason information can be more accurately determined due to the elimination of subjective factors. Therefore, faults can be eliminated in time, and the influence on the service processing efficiency due to long-time faults is avoided.
With further reference to fig. 4, a flow 400 of further embodiments of a method of business failure cause information generation is illustrated. The process 400 of the method for generating information about a cause of a service fault includes the following steps:
And step 402, matching the service fault information in the service directed graph to obtain a target node matched with the service fault information.
In some embodiments, the specific implementation of steps 401-402 and the technical effect thereof can refer to steps 201-202 in those embodiments corresponding to fig. 2.
In some embodiments, the known service fault information may be service information observed by service personnel or observed by field observation devices. For example, the service failure information charges the cargo higher. Further, the field personnel find that the weight of the cargo is zero and input the service information into the execution body through the field terminal. At this time, for the fault that the charge of the goods is higher, the weight of the goods is known to be zero. In practice, known service information may also be obtained by a detection device in the field, such as a weight sensor, an image acquisition device, and the like, as an example.
And step 404, matching the known service information in the service directed graph to obtain a known service information node.
In some embodiments, the execution subject of the service failure cause information generation method is matched by a method similar to step 202, so as to obtain the known service information node.
In some embodiments, at least one path with the target node as the start node may be determined with reference to step 203 in those embodiments corresponding to fig. 2. Similarly, at least one path with the service information node as the starting node may be determined.
In some optional implementations of some embodiments, in response to determining that the known service information node and the target node are on the same path and the known service information node is upstream of the target node, based on at least one path using the known service information node as an initial node, service failure cause information corresponding to the service failure information is generated.
In these implementations, the executing agent may determine whether the known service information node and the target node are in the same path. If the path is in the same path and the known service information node is located at the upstream of the target node, the calculation can be directly carried out based on the known service information node as the starting node, and compared with the target node, the path can be shortened, so that the settlement amount is reduced, the calculation speed is increased, the service fault reason information is quickly generated, and the fault is eliminated in time.
Optionally, if the known service information node and the target node are not in the same path, at least one path using the target node and the known service information node as the start node may be obtained by summarizing the obtained paths.
And step 406, generating service fault reason information corresponding to the service fault information based on the at least one path.
In some embodiments, the specific implementation of step 406 and the technical effect thereof may refer to step 404 in those embodiments corresponding to fig. 2, and are not described herein again.
In some embodiments, after the service fault reason information is generated, the service fault reason information can be sent to a maintenance robot or a field maintenance personnel terminal, so that faults can be timely eliminated. However, in practice, due to reasons such as incomplete information or inaccurate weight values in the traffic directed graph, a fault may not be eliminated according to the generated fault cause information. At this time, the actual failure cause information needs to be searched by other means.
On the basis, in response to the fact that the service fault reason information is determined not to be matched with the actual fault reason information and no node corresponding to the actual fault reason information exists in the service directed graph, the fact that the service information in the service directed graph is incomplete is explained. Accordingly, it is possible to create a new node corresponding to actual failure cause information in the traffic directed graph and set a weight value for the new node.
For example, the fault information is that the weight of the goods is zero, and by querying in the service directed graph, 60% of the fault information is found to be caused by abnormal network connection in the weighing equipment. Through testing the discovery to the weighing equipment intranet, the weighing equipment intranet is connected normally. Further testing found that it was true that the weight of the load was zero due to the load weighing less than 50 grams. Therefore, a new node can be created in the traffic directed graph, and the traffic information corresponding to the new node is that the weight of the goods is less than 50 g. The weight value of the new node can be set according to actual conditions.
As can be seen from fig. 4, compared with the description of some embodiments corresponding to fig. 2, the flow 400 of the method for generating service failure cause information in some embodiments corresponding to fig. 4 combines known service information in the process of generating service failure cause information. Therefore, the method can fully combine the field situation to quickly generate the service fault reason information so as to quickly eliminate the fault.
With further reference to fig. 5, as an implementation of the methods shown in the above-mentioned figures, the present disclosure provides some embodiments of a service failure cause information generation apparatus, which correspond to those shown in fig. 2, and which may be specifically applied in various electronic devices.
As shown in fig. 5, the service failure cause information generating apparatus 500 of some embodiments includes: an acquisition unit 501, a matching unit 502, a determination unit 503, and a generation unit 504. The obtaining unit 501 is configured to obtain service fault information to be processed and a pre-generated service directed graph, where each node of the service directed graph corresponds to one item of service information, and a weight value is set between two nodes connected by a directed line. The matching unit 502 is configured to match the service failure information in the service directed graph, and obtain a target node matched with the service failure information. The determination unit 503 is configured to determine at least one path with the target node as the start node. The generating unit 504 is configured to generate service failure cause information corresponding to the service failure information based on the at least one path.
In an optional implementation manner of some embodiments, the generating unit 504 is further configured to determine a probability value corresponding to each path according to the weight values corresponding to the plurality of directed lines in each path; determining the probability value corresponding to each path and the service information corresponding to the end node in the path as the service fault sub-reason information corresponding to the path; and determining at least one piece of service fault sub-reason information corresponding to at least one path as service fault reason information.
In an optional implementation of some embodiments, the apparatus 500 may further include: and the control unit is configured to control the overhaul robot to overhaul the equipment corresponding to the service information included in the at least one piece of service failure sub-reason information in sequence according to the descending order of the probability value included in the at least one piece of service failure sub-reason information.
In an optional implementation manner of some embodiments, the determining unit 503 is further configured to determine the shortest path with the target node as the starting node in response to that the total number of nodes in the traffic directed graph is greater than a preset threshold; and traversing the traffic directed graph to find the rest of paths taking the target node as the starting node.
In an optional implementation manner of some embodiments, the obtaining unit 501 is further configured to obtain known service information corresponding to the service failure information. The matching unit 502 is further configured to match the known service information in the service directed graph, resulting in a known service information node. And the determining unit 503 is further configured to determine at least one path with the target node or the known traffic information node as the starting node.
In an optional implementation of some embodiments, the determining unit 503 is further configured to, in response to determining that the known traffic information node and the target node are in the same path and that the known traffic information node is upstream of the target node, base on at least one path with the known traffic information node as an originating node.
In an optional implementation of some embodiments, the apparatus 500 may further include: and the node creating unit is configured to respond to the fact that the service fault reason information is not matched with the actual fault reason information and no node corresponding to the actual fault reason information exists in the service directed graph, create a new node corresponding to the actual fault reason information in the service directed graph and set a weight value for the new node.
In an optional implementation of some embodiments, the apparatus 500 may further include: a weight adjustment unit configured to: acquiring a historical probability base number of a node corresponding to the service fault reason information; and adjusting the weight value of the connecting node directed line based on the historical probability base number.
It will be understood that the elements described in the apparatus 500 correspond to various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 500 and the units included therein, and are not described herein again.
Referring now to fig. 6, shown is a schematic diagram of an electronic device 600 suitable for use in implementing some embodiments of the present disclosure. The electronic device in some embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle-mounted terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 6 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network through the communication device 609, or installed from the storage device 608, or installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium described in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring service fault information to be processed and a pre-generated service directed graph, wherein each node of the service directed graph corresponds to one item of service information, and a weight value is arranged between two nodes connected through a directed line; matching the service fault information in the service directed graph to obtain a target node matched with the service fault information; determining at least one path with the target node as an initial node; and generating service fault reason information corresponding to the service fault information based on at least one path.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by software, and may also be implemented by hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit, a matching unit, a determination unit, and a generation unit. The names of these units do not form a limitation on the unit itself in some cases, and for example, the acquiring unit may also be described as a "unit that acquires the service failure information to be processed and the pre-generated service directed graph".
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.
Claims (11)
1. A method for generating service fault reason information comprises the following steps:
acquiring service fault information to be processed and a pre-generated service directed graph, wherein each node of the service directed graph corresponds to one item of service information, and a weight value is arranged between two nodes connected through a directed line;
matching the service fault information in the service directed graph to obtain a target node matched with the service fault information;
determining at least one path with the target node as an initial node;
and generating service fault reason information corresponding to the service fault information based on the at least one path.
2. The method according to claim 1, wherein the generating, based on the at least one path, service failure cause information corresponding to the service failure information includes:
determining probability values corresponding to the paths according to weight values corresponding to a plurality of directed lines in each path;
determining the probability value corresponding to each path and the service information corresponding to the end node in the path as the service fault sub-reason information corresponding to the path;
and determining at least one piece of service fault sub-reason information corresponding to the at least one path as the service fault reason information.
3. The method of claim 2, wherein the method further comprises:
and controlling the maintenance robot to sequentially maintain the equipment corresponding to the service information included in the at least one piece of service fault sub-reason information according to the sequence of the probability values included in the at least one piece of service fault sub-reason information from large to small.
4. The method of claim 1, wherein the determining at least one path with the target node as an origin node comprises:
determining a shortest path with the target node as an initial node in response to the total number of nodes in the service directed graph being greater than a preset threshold;
and traversing the traffic directed graph to find the rest of paths taking the target node as the starting node.
5. The method according to any one of claims 1-4, wherein the method further comprises:
acquiring known service information corresponding to the service fault information;
matching the known service information in the service directed graph to obtain a known service information node; and
the determining at least one path with the target node as an initial node comprises:
determining at least one path with the target node or the known service information node as an originating node.
6. The method of claim 5, wherein the determining at least one path with the target node or the known traffic information node as an originating node comprises:
in response to determining that the known traffic information node and the target node are on the same path and that the known traffic information node is upstream of the target node, based on at least one path with the known traffic information node as an originating node.
7. The method of claim 6, wherein the method further comprises:
in response to determining that the service fault cause information is not matched with the actual fault cause information and that the node corresponding to the actual fault cause information does not exist in the service directed graph, creating a new node corresponding to the actual fault cause information in the service directed graph, and setting a weight value for the new node.
8. The method of claim 1, wherein the method further comprises:
acquiring a historical probability base number of a node corresponding to the service fault reason information;
and adjusting the weight value of the directed line connecting the nodes based on the historical probability base.
9. A service failure cause information generation apparatus includes:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is configured to acquire service fault information to be processed and a pre-generated service directed graph, each node of the service directed graph corresponds to one item of service information, and a weight value is arranged between two nodes connected through a directed line;
the matching unit is configured to match the service fault information in the service directed graph to obtain a target node matched with the service fault information;
a determining unit configured to determine at least one path with the target node as a start node;
and the generating unit is configured to generate service fault reason information corresponding to the service fault information based on the at least one path.
10. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.
11. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111110713.XA CN113793128A (en) | 2021-09-18 | 2021-09-18 | Method, device, equipment and computer readable medium for generating business fault reason information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111110713.XA CN113793128A (en) | 2021-09-18 | 2021-09-18 | Method, device, equipment and computer readable medium for generating business fault reason information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113793128A true CN113793128A (en) | 2021-12-14 |
Family
ID=79184191
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111110713.XA Pending CN113793128A (en) | 2021-09-18 | 2021-09-18 | Method, device, equipment and computer readable medium for generating business fault reason information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113793128A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114710397A (en) * | 2022-04-24 | 2022-07-05 | 中国工商银行股份有限公司 | Method, device, electronic equipment and medium for positioning fault root cause of service link |
| CN115981711A (en) * | 2023-03-20 | 2023-04-18 | 花瓣云科技有限公司 | Code processing method and electronic equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106941423A (en) * | 2017-04-13 | 2017-07-11 | 腾讯科技（深圳）有限公司 | Failure cause localization method and device |
| CN108833184A (en) * | 2018-06-29 | 2018-11-16 | 腾讯科技（深圳）有限公司 | Service fault localization method, device, computer equipment and storage medium |
| CN110493025A (en) * | 2018-05-15 | 2019-11-22 | 中国移动通信集团浙江有限公司 | It is a kind of based on the failure root of multilayer digraph because of the method and device of diagnosis |
| CN110932976A (en) * | 2019-12-12 | 2020-03-27 | 国家电网有限公司大数据中心 | Meteorological disaster-based power grid fault service recovery method, device and equipment |
| CN111858123A (en) * | 2020-07-29 | 2020-10-30 | 中国工商银行股份有限公司 | Fault root cause analysis method and device based on directed graph network |
| CN111859031A (en) * | 2020-07-15 | 2020-10-30 | 中国安全生产科学研究院 | Accident failure factor analysis method for oil and gas pipeline |
| CN113095515A (en) * | 2019-12-19 | 2021-07-09 | 中国移动通信集团辽宁有限公司 | Service fault information processing method and device |
-
2021
- 2021-09-18 CN CN202111110713.XA patent/CN113793128A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106941423A (en) * | 2017-04-13 | 2017-07-11 | 腾讯科技（深圳）有限公司 | Failure cause localization method and device |
| CN110493025A (en) * | 2018-05-15 | 2019-11-22 | 中国移动通信集团浙江有限公司 | It is a kind of based on the failure root of multilayer digraph because of the method and device of diagnosis |
| CN108833184A (en) * | 2018-06-29 | 2018-11-16 | 腾讯科技（深圳）有限公司 | Service fault localization method, device, computer equipment and storage medium |
| CN110932976A (en) * | 2019-12-12 | 2020-03-27 | 国家电网有限公司大数据中心 | Meteorological disaster-based power grid fault service recovery method, device and equipment |
| CN113095515A (en) * | 2019-12-19 | 2021-07-09 | 中国移动通信集团辽宁有限公司 | Service fault information processing method and device |
| CN111859031A (en) * | 2020-07-15 | 2020-10-30 | 中国安全生产科学研究院 | Accident failure factor analysis method for oil and gas pipeline |
| CN111858123A (en) * | 2020-07-29 | 2020-10-30 | 中国工商银行股份有限公司 | Fault root cause analysis method and device based on directed graph network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114710397A (en) * | 2022-04-24 | 2022-07-05 | 中国工商银行股份有限公司 | Method, device, electronic equipment and medium for positioning fault root cause of service link |
| CN114710397B (en) * | 2022-04-24 | 2024-02-06 | 中国工商银行股份有限公司 | Service link fault root cause positioning method and device, electronic equipment and medium |
| CN115981711A (en) * | 2023-03-20 | 2023-04-18 | 花瓣云科技有限公司 | Code processing method and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113793128A (en) | Method, device, equipment and computer readable medium for generating business fault reason information | |
| CN113988720B (en) | Shunting path generation method and device, electronic equipment and computer readable medium | |
| CN115640285B (en) | Power abnormality information transmission method, device, electronic equipment and medium | |
| CN113327598A (en) | Model training method, speech recognition method, device, medium and equipment | |
| CN114780338A (en) | Host information processing method and device, electronic equipment and computer readable medium | |
| US20210021690A1 (en) | Method and apparatus for generating information | |
| CN111612434B (en) | Method, apparatus, electronic device and medium for generating processing flow | |
| CN115272760A (en) | Small sample smoke image fine classification method suitable for forest fire smoke detection | |
| CN113094272B (en) | Application testing method, device, electronic equipment and computer readable medium | |
| CN111628913B (en) | Online time length determining method and device, readable medium and electronic equipment | |
| CN111680754B (en) | Image classification method, device, electronic equipment and computer readable storage medium | |
| CN114579401A (en) | Task detection method and device, electronic equipment and storage medium | |
| CN114035861A (en) | Cluster configuration method and device, electronic equipment and computer readable medium | |
| CN113297277A (en) | Test statistic determination method, device, readable medium and electronic equipment | |
| CN112346870A (en) | Model processing method and system | |
| CN116703263B (en) | Power equipment distribution method, device, electronic equipment and computer readable medium | |
| CN113554385B (en) | Distribution robot control method, distribution robot control device, electronic equipment and computer readable medium | |
| CN112073202B (en) | Information generation method and device, electronic equipment and computer readable medium | |
| CN112036821B (en) | Quantization method, quantization device, quantization medium and quantization electronic equipment based on grid map planning private line | |
| CN110633707A (en) | Method and device for predicting speed | |
| CN112668194B (en) | Automatic driving scene library information display method, device and equipment based on page | |
| CN111274150B (en) | Service instance access method and device and electronic equipment | |
| CN117978612B (en) | Network fault detection method, storage medium and electronic equipment | |
| CN116737917B (en) | Text recommendation information generation method, electronic device and computer readable medium | |
| CN114792258B (en) | Information generation method and device, electronic equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |