SYSTEM AND METHOD FOR RELATIONSHIP BASED ROOT CAUSE RECOMMENDATION

• US 20170068581A1
• Filed: 09/04/2015
• Published: 03/09/2017
• Est. Priority Date: 09/04/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: QI, YAO DONG, WU, HAI SHAN, XU, DI DX, YANG, YI BJ, WANG, LAN JUN
• Granted Patent: US 10,318,366 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/0709 in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
• CPC Class Codes: G06F 11/079 Root cause analysis, i.e. error or fault diagnosis in a hardware test environment G06F11/22; in a software test environment G06F11/36
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 41/0654 using network fault recovery ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/5009 Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
• CPC Class Codes: H04L 41/5096 wherein the managed service relates to distributed or central networked applications
• CPC Class Codes: H04L 43/0864 Round trip delays

Abstract

A method of identifying a root cause in a distributed computing environment includes traversing a plurality of nodes in a call graph starting with an end user node. Each node corresponds to an application component. A response time is calculated between connected pairs of neighboring nodes. A weight is calculated for each of a plurality of edges connecting the neighboring nodes. The nodes are traversed starting with the end user node in an order based on the weight of each of the edges. A root cause score is calculated for each node based on traversing all of the nodes in the order based on the weight of each of the edges. A ranked list is generated.

Claims

1. A method of identifying a root cause in a distributed computing environment, comprising:

traversing a plurality of nodes in a call graph starting with an end user node, wherein each node corresponds to an application component in the distributed computing environment;

calculating a response time between pairs of neighboring nodes from among the plurality of nodes, wherein the neighboring nodes in each pair are connected to each other in the call graph;

calculating a weight for each of a plurality of edges connecting the neighboring nodes in the pairs;

traversing all of the nodes in the call graph starting with the end user node in an order based on the weight of each of the plurality of edges;

calculating a root cause score for each node in the call graph based on traversing all of the nodes in the call graph in the order based on the weight of each of the plurality of edges; and

generating a ranked list comprising all of the nodes in an order based on the root cause score of each node.

2. The method of claim 1, wherein a node having a highest root cause score is a first node in the ranked list and a node having a lowest root cause score is a last node in the ranked list.

3. The method of claim 1, further comprising:

generating a recommendation comprising the first node in the ranked list, wherein the first node is the root cause identified in the distributed computing environment.

4. The method of claim 3, wherein the first node in the ranked list corresponds to an application component that acts as a system bottleneck in the distributed computing environment.

5. The method of claim 1, wherein the weight of each edge is calculated based on a correlation between (i) the response time between the neighboring nodes in the corresponding pair and (ii) a response time between the neighboring node furthest from the end user node and the end user node.

6. The method of claim 1, wherein the application components are computer servers.

7. The method of claim 1, wherein the order in which all of the nodes in the call graph are traversed is a highest weight to lowest weight order.

8. The method of claim 1, wherein the order in which all of the nodes in the call graph are traversed is a lowest weight to highest weight order.

9. The method of claim 1, further comprising:

detecting similar abnormal patterns that occur while traversing all of the nodes in the call graph starting with the end user node in the order based on the weight of each of the plurality of edges.

10. A method of identifying a root cause in a distributed computing environment, comprising:

traversing a plurality of nodes in a call graph starting with an end user node, wherein each node corresponds to an application component in the distributed computing environment;

calculating a throughput between pairs of neighboring nodes from among the plurality of nodes, wherein the neighboring nodes in each pair are connected to each other in the call graph;

calculating a weight for each of a plurality of edges connecting the neighboring nodes in the pairs;

traversing all of the nodes in the call graph starting with the end user node in an order based on the weight of each of the plurality of edges;

calculating a root cause score for each node in the call graph based on traversing all of the nodes in the call graph in the order based on the weight of each of the plurality of edges; and

generating a ranked list comprising all of the nodes in an order based on the root cause score of each node.

11. The method of claim 10, wherein a node having a highest root cause score is a first node in the ranked list and a node having a lowest root cause score is a last node in the ranked list.

12. The method of claim 10, further comprising:

generating a recommendation comprising the first node in the ranked list, wherein the first node is the root cause identified in the distributed computing environment.

13. The method of claim 12, wherein the first node in the ranked list corresponds to an application component that acts as a system bottleneck in the distributed computing environment.

14. The method of claim 10, wherein the weight of each edge is calculated based on a correlation between (i) the throughput between the neighboring nodes in the corresponding pair and (ii) a throughput between the neighboring node furthest from the end user node and the end user node.

15. The method of claim 10, wherein the order in which all of the nodes in the call graph are traversed is a highest weight to lowest weight order.

16. The method of claim 10, wherein the order in which all of the nodes in the call graph are traversed is a lowest weight to highest weight order.

17. A method of identifying a root cause in a distributed computing environment, comprising:

traversing a plurality of nodes in a call graph starting with an end user node, wherein each node corresponds to an application component in the distributed computing environment;

calculating a packet loss rate between pairs of neighboring nodes from among the plurality of nodes, wherein the neighboring nodes in each pair are connected to each other in the call graph;

calculating a weight for each of a plurality of edges connecting the neighboring nodes in the pairs;

traversing all of the nodes in the call graph starting with the end user node in an order based on the weight of each of the plurality of edges;

calculating a root cause score for each node in the call graph based on traversing all of the nodes in the call graph in the order based on the weight of each of the plurality of edges; and

generating a ranked list comprising all of the nodes in an order based on the root cause score of each node, wherein a node having a highest root cause score is a first node in the ranked list and a node having a lowest root cause score is a last node in the ranked list.

18. The method of claim 17, further comprising:

generating a recommendation comprising the first node in the ranked list, wherein the first node is the root cause identified in the distributed computing environment.

19. The method of claim 18, wherein the first node in the ranked list corresponds to an application component that acts as a system bottleneck in the distributed computing environment.

20. The method of claim 17, wherein the weight of each edge is calculated based on a correlation between (i) the packet loss rate between the neighboring nodes in the corresponding pair and (ii) a packet loss rate between the neighboring node furthest from the end user node and the end user node.