Patentable/Patents/US-9608867
US-9608867

Detecting deviation of data center connectivity by conditional sub-graph matching

PublishedMarch 28, 2017
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

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.

Patent Claims
20 claims

Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.

Claim 1

Original Legal Text

1. A method in a computer system comprising: receiving, at the computer system, a signature, wherein the signature is represented by a sub-graph; defining a start node, wherein the start node is defined based on a condition of a component of a data center, the condition is determined based on a relationship between the start node and a next node of the data center, and the relationship between the start node and the next node is defined by an edge; and determining, using a processor of the computer system, if the data center is over-provisioned or under-provisioned, wherein the determining comprises matching the sub-graph and a portion of a main graph based on the condition and the signature, and a failure to match the sub-graph and at least the portion of the main graph indicates that the data center is either over-provisioned or under-provisioned.

Plain English Translation

A computer system detects data center over- or under-provisioning by comparing a desired connectivity (represented as a "sub-graph" signature) against the actual connectivity of the data center (represented as a "main graph"). The process starts by selecting a "start node" within the data center based on a component's condition. This condition depends on the relationship between the start node and its directly connected "next node," where the relationship is defined by an edge. The system then attempts to match the sub-graph signature to the main graph, starting from the selected node and following the edge. If a complete match fails, it indicates that the data center's resources are either over- or under-provisioned compared to the desired state.

Claim 2

Original Legal Text

2. The method of claim 1 , wherein the sub-graph represents a pre-determined connectivity of the data center, and the main graph represents an existing connectivity of the data center.

Plain English Translation

The method for detecting data center over- or under-provisioning from the previous description specifies that the "sub-graph" represents a pre-determined, desired connectivity of the data center. The "main graph" represents the existing, actual connectivity of the data center. The method compares these two graphs to identify discrepancies indicating resource misallocation.

Claim 3

Original Legal Text

3. The method of claim 2 , further comprising: determining whether a node of the data center qualifies as the start node, wherein the determining is based on the condition, the signature corresponds to the pre-determined connectivity, and the signature is represented visually by the sub-graph; matching the signature and the condition; and designating the node as the start node.

Plain English Translation

The method for detecting data center over- or under-provisioning from the previous descriptions includes a step to determine which node qualifies as the "start node." This determination relies on the "condition" of the node and the "signature" representing the pre-determined connectivity, visually represented by the sub-graph. The method matches the sub-graph "signature" and the "condition". If the node meets these criteria, it is designated as the "start node" for the graph matching process.

Claim 4

Original Legal Text

4. The method of claim 3 , further comprising: matching the signature to the sub-graph to determine whether the data center is over-provisioned or under-provisioned.

Plain English Translation

The method for detecting data center over- or under-provisioning from the previous descriptions further includes matching the signature to the sub-graph. If the node meets the criteria to be the start node, then the pre-determined connectivity graph is compared to the actual sub-graph connectivity. The results of this comparison are used to determine if the data center is over-provisioned or under-provisioned.

Claim 5

Original Legal Text

5. The method of claim 3 , wherein the conditional matching is begun at the start node, and a first failure to meet the condition stops the conditional matching, wherein the first failure indicates that the data center is not over-provisioned or under-provisioned.

Plain English Translation

The method for detecting data center over- or under-provisioning from the previous descriptions begins the conditional matching process at the "start node." If, during the matching process, a condition is not met (a "first failure"), the matching stops. This failure indicates that the data center's resources are not over-provisioned or under-provisioned in the way the matching process expected.

Claim 6

Original Legal Text

6. The method of claim 5 , further comprising: determining that the sub-graph and at least the portion of the main graph do not match after one or more adjustments are performed to the component upon the first failure; and designating another node of the data center as the start node.

Plain English Translation

The method for detecting data center over- or under-provisioning from the previous descriptions addresses scenarios where the initial conditional matching fails. After the "first failure" to meet a condition during the graph matching process, one or more adjustments are made to the component that triggered the failure. If, after these adjustments, the sub-graph and main graph still do not match, another node within the data center is selected and designated as the new "start node," and the matching process restarts.

Claim 7

Original Legal Text

7. The method of claim 2 , further comprising: accessing a Service Level Agreement (SLA) to determine whether the data center is over-provisioned or under-provisioned upon the failure to conditionally match the sub-graph and at least the portion of the main graph.

Plain English Translation

The method for detecting data center over- or under-provisioning from the previous descriptions incorporates Service Level Agreements (SLAs). If the conditional matching of the sub-graph (pre-determined connectivity) and the main graph (existing connectivity) fails, the system accesses an SLA to determine whether the data center is over- or under-provisioned based on the agreement's performance metrics and resource allocation guidelines.

Claim 8

Original Legal Text

8. A non-transitory computer readable storage medium comprising program instructions executable to: receive, at a computer system, a signature, wherein the signature is represented by a sub-graph; define a start node, wherein the start node is defined based on a condition of a component of a data center, the condition is determined based on a relationship between the start node and a next node of the data center, and the relationship between the start node and the next node is defined by an edge; and determine, using a processor of the computer system, if the data center is over-provisioned or under-provisioned, wherein the determining comprises matching the sub-graph and a portion of a main graph based on the condition and the signature, and a failure to match the sub-graph and at least the portion of the main graph indicates that the data center is either over-provisioned or under-provisioned.

Plain English Translation

A computer-readable storage medium stores instructions that, when executed, cause a computer to detect data center over- or under-provisioning. This involves receiving a "sub-graph" signature that represents desired connectivity, defining a "start node" based on a component's condition (determined by its relationship with a "next node" via an edge), and then determining if the data center is over- or under-provisioned by matching the sub-graph against the actual data center connectivity represented as a "main graph". A failure to match the sub-graph to the main graph indicates a provisioning issue.

Claim 9

Original Legal Text

9. The non-transitory computer readable storage medium of claim 8 , wherein the sub-graph represents a pre-determined connectivity of the data center, and the main graph represents an existing connectivity of the data center.

Plain English Translation

The computer-readable storage medium from the previous description stores instructions where the "sub-graph" represents the pre-determined, desired connectivity of the data center. The "main graph" represents the existing, actual connectivity. The comparison of these two graphs determines if the data center is properly provisioned.

Claim 10

Original Legal Text

10. The non-transitory computer readable storage medium of claim 9 , further comprising: determining whether a node of the data center qualifies as the start node, wherein the determining is based on the condition, the signature corresponds to the pre-determined connectivity, and the signature is represented visually by the sub-graph; matching the signature and the condition; designating the node as the start node; and matching the signature to the sub-graph to determine whether the data center is over-provisioned or under-provisioned.

Plain English Translation

The computer-readable storage medium from the previous descriptions further includes instructions to determine whether a node qualifies as the "start node." The instructions determine the start node based on conditions, the signature corresponding to the pre-determined connectivity, and the signature represented visually by the sub-graph. Once the start node is determined, the signature and condition are matched and the node is designated as the "start node". Then the signature and the sub-graph are matched to determine if the data center is over- or under-provisioned.

Claim 11

Original Legal Text

11. The non-transitory computer readable storage medium of claim 10 , wherein the conditional matching is begun at the start node, and a first failure to meet the condition stops the conditional matching, wherein the first failure indicates that the data center is not over-provisioned or under-provisioned provisioned.

Plain English Translation

The computer-readable storage medium from the previous descriptions includes instructions to begin conditional matching at the "start node". If there is a "first failure" to meet the condition, the conditional matching stops. The failure indicates the data center is not over- or under-provisioned.

Claim 12

Original Legal Text

12. The non-transitory computer readable storage medium of claim 11 , further comprising: determining that the sub-graph and at least the portion of the main graph do not match after one or more adjustments are performed to the component upon the first failure; and designating another node of the data center as the start node.

Plain English Translation

The computer-readable storage medium from the previous descriptions includes instructions for when the initial conditional matching fails. After a "first failure", the instructions determine that the sub-graph and the main graph don't match, after one or more adjustments are performed to the component. After the adjustments, another node is designated as the "start node".

Claim 13

Original Legal Text

13. The non-transitory computer readable storage medium of claim 8 , further comprising: accessing a Service Level Agreement (SLA) to determine whether the data center is over-provisioned or under-provisioned upon the failure to conditionally match the sub-graph and at least the portion of the main graph.

Plain English Translation

The computer-readable storage medium from the previous descriptions includes instructions to access a Service Level Agreement (SLA) if conditional matching fails. After failing to match the sub-graph (pre-determined connectivity) and the main graph (existing connectivity), the instructions access the SLA to determine if the data center is over- or under-provisioned.

Claim 14

Original Legal Text

14. A system comprising: one or more processors; and a memory coupled to the one or more processors, wherein the memory stores program instructions executable by the one or more processors to: receive, at a computer system, a signature, wherein the signature is represented by a sub-graph; define a start node, wherein the start node is defined based on a condition of a component of a data center, the condition is determined based on a relationship between the start node and a next node of the data center, and the relationship between the start node and the next node is defined by an edge; and determine, using a processor of the computer system, if the data center is over-provisioned or under-provisioned, wherein the determining comprises matching the sub-graph and a portion of a main graph based on the condition and the signature, and a failure to match the sub-graph and at least the portion of the main graph indicates that the data center is either over-provisioned or under-provisioned.

Plain English Translation

A system comprises processors and memory storing instructions to detect data center over- or under-provisioning. The instructions receive a "sub-graph" signature representing desired connectivity, define a "start node" based on a component's condition (relationship with a "next node" via an edge), and determine provisioning status by matching the sub-graph against the actual data center connectivity ("main graph"). A failed match indicates that the data center is either over-provisioned or under-provisioned.

Claim 15

Original Legal Text

15. The system of claim 14 , wherein the sub-graph represents a pre-determined connectivity of the data center, and the main graph represents an existing connectivity of the data center.

Plain English Translation

The system for detecting data center over- or under-provisioning from the previous description specifies that the "sub-graph" represents a pre-determined, desired connectivity of the data center, and the "main graph" represents the existing, actual connectivity of the data center. The system uses the two graphs to detect discrepancies indicating resource misallocation.

Claim 16

Original Legal Text

16. The system of claim 15 , further comprising: determining whether a node of the data center qualifies as the start node, wherein the determining is based on the condition, the signature corresponds to the pre-determined connectivity, and the signature is represented visually by the sub-graph; matching the signature and the condition; and designating the node as the start node.

Plain English Translation

The system for detecting data center over- or under-provisioning from the previous descriptions, includes instructions to determine whether a node qualifies as the "start node". The determination is based on the condition, the signature (corresponding to pre-determined connectivity, visualized as a sub-graph). The signature and the condition are matched. Once a node satisfies those qualifications, it is designated as the "start node".

Claim 17

Original Legal Text

17. The system of claim 16 , further comprising: matching the signature to the sub-graph to determine whether the data center is over-provisioned or under-provisioned.

Plain English Translation

The system for detecting data center over- or under-provisioning from the previous descriptions further includes instructions to match the signature to the sub-graph, to determine whether the data center is over- or under-provisioned.

Claim 18

Original Legal Text

18. The system of claim 17 , wherein the conditional matching is begun at the start node, and a first failure to meet the condition stops the conditional matching, wherein the first failure indicates that the data center is not over-provisioned or under-provisioned.

Plain English Translation

The system for detecting data center over- or under-provisioning from the previous descriptions begins conditional matching from the "start node." A "first failure" to meet a condition will stop the conditional matching, which indicates that the data center is not over- or under-provisioned.

Claim 19

Original Legal Text

19. The system of claim 18 , further comprising: determining that the sub-graph and at least the portion of the main graph do not match after one or more adjustments are performed to the component upon the first failure; and designating another node of the data center as the start node.

Plain English Translation

The system for detecting data center over- or under-provisioning from the previous descriptions includes instructions to determine that the sub-graph and the main graph don't match. This determination is made after performing one or more adjustments to the component and experiencing a "first failure." After that failure, another node is designated as the "start node."

Claim 20

Original Legal Text

20. The system of claim 14 , further comprising: accessing a Service Level Agreement (SLA) to determine whether the data center is over-provisioned or under-provisioned upon the failure to conditionally match the sub-graph and at least the portion of the main graph.

Plain English Translation

The system for detecting data center over- or under-provisioning from the previous descriptions includes instructions to access a Service Level Agreement (SLA). Upon failure to conditionally match the sub-graph (pre-determined connectivity) and the main graph (existing connectivity), the SLA is used to determine whether the data center is over- or under-provisioned.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

January 4, 2016

Publication Date

March 28, 2017

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, FAQs, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Detecting deviation of data center connectivity by conditional sub-graph matching” (US-9608867). https://patentable.app/patents/US-9608867

© 2026 Nomic Interactive Technology LLC. Machine-readable context available at /api/llm-context/US-9608867. See llms.txt for full attribution policy.