State information completion using context graphs
First Claim
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.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
10 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
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.
-
Specification