State information completion using context graphs

• US 10,320,636 B2
• Filed: 12/28/2016
• Issued: 06/11/2019
• Est. Priority Date: 12/21/2016
• Status: Active Grant

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Inventors: Llagostera, Jaume Ferrarons, Noguero, David Solans, Charles, David Sanchez, Segura, Alberto Huelamo, Simo, Marc Sole, Mulero, Victor Muntes
• Primary Examiner(s): Mirza, Adnan M
• Application Number:
  US15/392,585
• Publication Number:
  US 20180176108A1
• Time in Patent Office: 895 Days
• CPC Class Codes: H04L 41/142 using statistical or mathematical methods
• CPC Class Codes: H04L 43/0817 by checking functioning

Abstract

Incomplete state information for nodes of a datacenter is completed utilizing historical state information. A context graph is received having a plurality of nodes that correspond to components of the datacenter, each node including properties that correspond to the represented component. It is determined that at least one of the properties for a node is incomplete. A context hash is derived from the context graph and compared to a plurality of subgraph hashes. Based upon the comparison, one or more subgraphs are identified that are similar to the context hash. Where a single similar subgraph is identified, the property information for the single subgraph is imputed to the context graph to complete the incomplete information. Where more than one similar subgraph is identified, the property information for the identified similar subgraphs is aggregated and the aggregated property information is imputed to the context graph to complete the incomplete information.

Claims

1. A method comprising:

receiving a context graph indicating a plurality of relationships among a plurality of nodes corresponding to hardware and software components of a datacenter, each node comprising properties corresponding to a particular component of the datacenter;

determining at least one of the properties is null or missing for at least one node of the plurality of nodes;

comparing a context hash derived from the context graph to a plurality of subgraph hashes derived from a library of subgraphs, each subgraph hash of the plurality of subgraph hashes and each subgraph of the subgraphs correspond to a respective portion of a plurality of portions of the context graph;

based on the comparing, identifying one or more subgraph hashes derived from the library of subgraphs that are similar to the context hash derived from the context graph; and

imputing, in the at least one node of the plurality of nodes, historical properties derived from the one or more subgraph hashes to complete the at least one property that is null or missing for the at least one node of the plurality of nodes.

2. The method of claim 1, wherein identifying one or more subgraph hashes derived from the library of subgraphs comprises identifying a set of subgraph hashes derived from the library of subgraphs that, when aggregated, are similar to the context hash derived from the context graph.

3. The method of claim 2, further comprising aggregating the historical properties from subgraphs that correspond to the set of subgraph hashes and imputing at least a portion of the aggregated historical properties to complete the at least one property that is null or missing for the at least one node of the plurality of nodes.

4. The method of claim 3, wherein the historical properties are aggregated based on an average.

5. The method of claim 3, wherein the historical properties are aggregated utilizing a weight based on a percentage of matching nodes.

6. The method of claim 1, further comprising providing a probability distribution for the at least one property that is null or missing for the at least one node of the plurality of nodes.

7. The method of claim 1, further comprising receiving a plurality of historical properties from a historical database corresponding to the library of subgraphs.

8. The method of claim 1, further comprising:

receiving the historical properties from one or more of at least one report and at least one monitoring tool; and

building the context graph utilizing the received properties.

9. The method of claim 1, wherein the library of subgraphs corresponds to historical data collected from multiple datacenters.

10. A computerized system:

a processor; and

a non-transitory computer storage medium storing computer-useable instructions that, when used by the processor, cause the processor to;

receive a context graph indicating a plurality of relationships among a plurality of nodes corresponding to components of a datacenter, each node comprising properties that include a particular resource consumption state of a particular hardware component of the datacenter;

for a node in the context graph, determine that a value for at a selected property of the properties is null or missing for a resource consumption state of the node at a given point in time;

for the node in the context graph, determine a plurality of context hashes derived from the context graph based on a plurality of properties for the resource consumption state of the node that have complete property values at the given point in time;

compare the plurality of context hashes derived from the context graph to subgraph hashes derived from a library of subgraphs;

identify a set of subgraph hashes derived from the library of subgraphs that, when combined, are similar to at least a portion of the plurality of context hashes derived from the context graph; and

aggregate historical resource consumption properties derived from subgraphs corresponding to the set of subgraph hashes to provide the value for the selected property that is null or missing of the node at the given point in time.