Method for finding failing components in a large distributed storage system connectivity

A system comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor to perform:

• measuring problems and health of a plurality of physical and logical components in a distributed storage system, the plurality of physical and logical components forming nodes of the distributed storage system, and generating a graph of the nodes organized in a plurality of hierarchical levels;
• generating, for each node in the graph, a score summarizing the measured problems and health of the node;
• generating, for each node in the graph, a score summarizing the measured problems and health of the node;
• determining a highest score at a highest hierarchical level of the graph by:
• traversing the nodes of the plurality of hierarchical levels of the graph, starting at a highest hierarchical level,
• determining a node having a score that is greater than or equal to scores of any nodes in a sub-graph of the node at any lower level, and
• determining that the determined node is a failing component at a most significant level;
• and
• determining an associated node as a failing component at a most significant level.

A computer program product comprising a non-transitory computer readable storage having program instructions embodied therewith, the program instructions executable by a computer, to cause the computer to perform a method comprising:

• measuring problems and health of a plurality of physical and logical components in a distributed storage system, the plurality of physical and logical components forming nodes of the distributed storage system, and generating a graph of the nodes organized in a plurality of hierarchical levels;
• generating, for each node in the graph, a score summarizing the measured problems and health of the node;
• generating, for each node in the graph, a score summarizing the measured problems and health of the node;
• determining a highest score at a highest hierarchical level of the graph by:
• traversing the nodes of the plurality of hierarchical levels of the graph, starting at a highest hierarchical level,
• determining a node having a score that is greater than or equal to scores of any nodes in a sub-graph of the node at any lower level, and
• determining that the determined node is a failing component at a most significant level;
• and
• determining an associated node as a failing component at a most significant level.