Detecting deviation of data center connectivity by conditional sub-graph matching
Various systems and methods for detecting a deviation of an existing connectivity of a data center from a pre-determined connectivity are presented. One method involves detecting a deviation of an existing connectivity of a data center from a pre-determined connectivity by defining a start node. The start node is defined based on a condition of a component of the data center. The condition is determined based on an explicit relationship between a node and another node of the data center. The method involves conditionally matching a sub-graph and a portion of a main graph by identifying the deviation. The conditional matching is begun at the start node. A failure to conditionally match a portion of the sub-graph and a portion of the main-graph indicates that the deviation exists.
1. A method in a computer system comprising:
detecting, using a processor of the computer system, a deviation of an existing connectivity of a data center from a pre-determined connectivity, comprising:
defining a start node, wherein
the start node is defined based on at least a condition of at least a component of a plurality of components of the data center, and
the condition is determined based on an explicit relationship between a node and an another node of the data center; and
conditionally matching a sub-graph and at least a portion of a main graph by identifying, at least in part, the deviation, wherein
the main graph represents the plurality of components of the data center,
the sub-graph represents a portion of the plurality of components of the data center,
the conditional matching is begun at the start node,
the conditional matching comprises matching a signature with the condition, wherein
the signature corresponds to the pre-determined connectivity, and
a failure to conditionally match at least a portion of the sub-graph and at least a portion of the main graph indicates that the deviation exists.
2. The method of claim 1 comprising representing the plurality of components of the data center visually by the main graph, wherein
the component of the data center corresponds to the node, wherein
the condition of the node is evaluated to determine whether the node qualifies as the start node to begin the conditional matching,
the signature that corresponds to the pre-determined connectivity is matched with the condition of the node,
the node is identified as the start node if the signature matches the condition of the node, and
the start node represents the condition from which the conditional matching is begun; and
an another component of the data center corresponds to the another node, wherein
upon conditionally matching the sub-graph and at least the portion of the main graph, the another node is identified as a next node,
the next node is evaluated to determine whether the next node qualifies as the start node to begin the conditional matching,
the signature that corresponds to the pre-determined connectivity is matched with the condition of the next node,
the next node is identified as the start node if the signature matches the condition of the next node, and
the conditional matching continues at the start node.
3. The method of claim 2 , wherein
an edge defines the explicit relationship between the node and the another node, wherein
the node is an actual instantiation of the component of the data center,
the another node is a specific instantiation of the another component of the data center,
the edge between the node and the another node represents a common instantiation of at least one component of the data center, and
the explicit relationship is a relationship instantiation of the actual instantiation and the specific instantiation.
4. The method of claim 3 , wherein
the signature is represented visually by the sub-graph and defines the pre-determined connectivity of the portion of the plurality of components of data center represented by the sub-graph; and
the signature is associated with at least a rule of a plurality of rules governing the relationship between the plurality of components of the data center.
5. The method of claim 4 , wherein the signature
assigns a unique property to the node, the another node, and the edge, and
parameterizes a plurality of extraneous node properties and a plurality of extraneous edge properties, wherein
the plurality of extraneous node properties and the plurality of extraneous edge properties are not associable with the respective unique properties assigned to the node, the another node, and the edge.
6. The method of claim 2 , wherein
the conditional sub-graph matching results in an iteration between the start node and the condition, wherein
upon a first conditional matching of the sub-graph and at least the portion of the main graph,
the another node is identified as the next node, and
the next node becomes the start node if the signature matches the condition of the next node; and
a second conditional matching begins with the next node.
7. The method of claim 3 , comprising
receiving information represented as the sub-graph, wherein
the information is indicative of the pre-determined connectivity of the data center of plurality of disparate data centers,
defining the start node based on the condition of at least the component of the data center of the plurality of disparate data centers,
determining the condition based on the explicit relationship between the start node and the next node defined by the edge, and
comparing the existing connectivity of the data center represented as the main graph and the pre-determined connectivity of the data center represented as the sub-graph.
8. The method of claim 7 , wherein the comparing the existing connectivity of the data center represented as the main graph and the pre-determined connectivity of the data center represented as the sub-graph, comprises
performing gap analysis on the condition,
conditionally matching the sub-graph and at least the portion of the main graph, wherein
the conditional matching is begun at the start node, and
the condition based on the explicit relationship between the start node and the next node indicates an iterative process such that, upon the conditional matching, the next node becomes the start node, and
identifying the deviation of the existing connectivity from the pre-determined connectivity.
9. The method of claim 1 , comprising
determining the deviation of the existing connectivity of the data center from the pre-determined connectivity, comprising
identifying the deviation based on the failure to conditionally match at least the portion of the sub-graph and at least the portion of the main graph,
analyzing the deviation, comprising
determining whether the deviation is significant enough to be actionable, wherein
the significance is based on whether the data center is over-provisioned or under-provisioned according to a service level agreement (SLA), and
adjusting at least the component of the plurality of the components of the data center to harmonize the existing connectivity and the pre-determined connectivity.
10. The method of claim 3 , wherein
the common instantiation defines an existing capability of the data center by assigning a plurality of modifiable characteristics to the relationship instantiation,
the relationship instantiation is modifiable based on the difference between a modifiable characteristic associated with the actual instantiation and an another modifiable characteristic associated with the specific instantiation, and
upon modification, the relationship instantiation reflects an upgraded capability of the data center.
11. A system comprising:
one or more processors;
a memory coupled to the one or more processors, wherein the memory stores program instructions executable by the one or more processors to:
detect, using the one or more processors, a deviation of an existing connectivity of a data center from a pre-determined connectivity, comprising
defining a start node, wherein
the start node is defined based on at least a condition of at least a component of a plurality of components of the data center, and
the condition is determined based on an explicit relationship between a node and an another node of the data center; and
conditionally matching a sub-graph and at least a portion of a main graph by identifying, at least in part, the deviation, wherein
the main graph represents the plurality of components of the data center,
the sub-graph represents a portion of the plurality of components of the data center,
the conditional matching is begun at the start nod;
the conditional matching comprises matching a signature with the condition, wherein
the signature corresponds to the pre-determined connectivity, and
a failure to conditionally match at least a portion of the sub-graph and at least a portion of the main graph indicates that the deviation exists.
12. The system of claim 11 comprising representing the plurality of components of the data center visually by the main graph, wherein
the component of the data center corresponds to the node, wherein
the condition of the node is evaluated to determine whether the node qualifies as the start node to begin the conditional matching,
the signature that corresponds to the pre-determined connectivity is matched with the condition of the node,
the node is identified as the start node if the signature matches the condition of the node, and
the start node represents the condition from which the conditional matching is begun; and
an another component of the data center corresponds to the another node, wherein
upon conditionally matching the sub-graph and at least the portion of the main graph, the another node is identified as a next node,
the next node is evaluated to determine whether the next node qualifies as the start node to begin the conditional matching,
the signature that corresponds to the pre-determined connectivity is matched with the condition of the next node,
the next node is identified as the start node if the signature matches the condition of the next node, and
the conditional matching continues at the start node.
13. The system of claim 12 , wherein
an edge defines the explicit relationship between the node and the another node, wherein
the node is an actual instantiation of the component of the data center,
the another node is a specific instantiation of the another component of the data center,
the edge between the node and the another node represents a common instantiation of at least one component of the data center, and
the explicit relationship is a relationship instantiation of the actual instantiation and the specific instantiation.
14. The system of claim 13 , wherein the signature:
is represented visually by the sub-graph and defines the pre-determined connectivity of the portion of the plurality of components of data center represented by the sub-graph,
is associated with at least a rule of a plurality of rules governing the relationship between the plurality of components of the data center,
assigns a unique property to the node, the another node, and the edge, and
parameterizes a plurality of extraneous node properties and a plurality of extraneous edge properties, wherein
the plurality of extraneous node properties and the plurality of extraneous edge properties are not associable with the respective unique properties assigned to the node, the another node, and the edge; and
the condition corresponds to the signature.
15. The system of claim 14 , comprising
receiving information represented as the sub-graph, wherein
the information is indicative of the pre-determined connectivity of the data center of plurality of disparate data centers,
defining the start node based on the condition of at least the component of the data center of the plurality of disparate data centers,
determining the condition based on the explicit relationship between the start node and the next node defined by the edge,
comparing the existing connectivity of the data center represented as the main graph and the pre-determined connectivity of the data center represented as the sub-graph, comprising
performing gap analysis on the condition, and
conditionally matching the sub-graph and at least a portion of the main graph, wherein
the conditional matching is begun at the start node, and
the condition based on the explicit relationship between the start node and the next node indicates an iterative process such that, upon the conditional matching, the next node becomes the start node, and
identifying the deviation of the existing connectivity from the pre-determined connectivity.
16. A non-transitory computer readable storage medium of a computing system storing program instructions executable to:
detect, using a processor of the computing system, a deviation of an existing connectivity of a data center from a pre-determined connectivity, comprising:
defining a start node, wherein
the start node is defined based on at least a condition of at least a component of a plurality of components of the data center, and
the condition is determined based on an explicit relationship between a node and an another node of the data center; and
conditionally matching a sub-graph and at least a portion of a main graph by identifying, at least in part, the deviation, wherein
the main graph represents the plurality of components of the data center,
the sub-graph represents a portion of the plurality of components of the data center,
the conditional matching is begun at the start nod;
the conditional matching comprises matching a signature with the condition, wherein
the signature corresponds to the pre-determined connectivity, and
a failure to conditionally match at least a portion of the sub-graph and at least a portion of the main graph indicates that the deviation exists.
17. The non-transitory computer readable storage medium of claim 16 comprising representing the plurality of components of a data-center visually by the main graph, wherein
the component of the data center corresponds to the node, comprising
evaluating the condition of the node to determine whether the node qualifies as the start node to begin the conditional matching,
matching the signature that corresponds to the pre-determined connectivity with the condition of the node,
identifying the node as the start node if the signature matches the condition of the node, and
representing the start node as the condition from which the conditional matching is begun; and
an another component of the data center corresponds to the another node, comprising
identifying the another node as a next node upon conditionally matching the sub-graph and at least the portion of the main graph,
evaluating the next node to determine whether the next node qualifies as the start node to begin the conditional matching,
matching the signature that corresponds to the pre-determined connectivity with the condition of the next node,
identifying the next node as the start node if the signature matches the condition of the next node, and
continuing the conditional matching at the start node.
18. The non-transitory computer readable storage medium of claim 17 , wherein
an edge defines the explicit relationship between the node and the another node, wherein
the node is an actual instantiation of the component of the data center,
the another node is a specific instantiation of the another component of the data center,
the edge between the node and the another node represents a common instantiation of at least one component of the data center, and
the explicit relationship is a relationship instantiation of the actual instantiation and the specific instantiation.
19. The non-transitory computer readable storage medium of claim 16 , wherein
the signature:
is represented visually by the sub-graph and defines the pre-determined connectivity of the portion of the plurality of components of data center represented by the sub-graph,
is associated with at least a rule of a plurality of rules governing the relationship between the plurality of components of the data center,
assigns a unique property to the node, the another node, and the edge, and
parameterizes a plurality of extraneous node properties and a plurality of extraneous edge properties, wherein
the plurality of extraneous node properties and the plurality of extraneous edge properties are not associable with the respective unique properties assigned to the node, the another node, and the edge; and
the condition corresponds to the signature.
20. The non-transitory computer readable storage medium of claim 16 , comprising:
receiving information represented as the sub-graph, wherein
the information is indicative of the pre-determined connectivity of the data center of plurality of disparate data centers,
defining the start node based on the condition of at least the component of the data center of the plurality of disparate data centers,
determining the condition based on the explicit relationship between the start node and the next node defined by the edge,
comparing the existing connectivity of the data center represented as the main graph and the pre-determined connectivity of the data center represented as the sub-graph, comprising
performing gap analysis on the condition, and
conditionally matching the sub-graph and at least a portion of the main graph, wherein
the conditional matching is begun at the start node, and
the condition based on the explicit relationship between the start node and the next node indicates an iterative process such that, upon the conditional matching, the next node becomes the start node, and
identifying the deviation of the existing connectivity from the pre-determined connectivity.