Systems for monitoring computer resources

• US 8,600,915 B2
• Filed: 12/19/2011
• Issued: 12/03/2013
• Est. Priority Date: 12/19/2011
• Status: Active Grant

• Current Assignee: Go Daddy Operating Company LLC (GoDaddy, Inc.)
• Original Assignee: Go Daddy Operating Company LLC (GoDaddy, Inc.)
• Inventors: Thompson, Erskine
• Primary Examiner(s): Chaki, Kakali
• Assistant Examiner(s): Seck, Ababacar
• Application Number:
  US13/330,364
• Publication Number:
  US 20130159221A1
• Time in Patent Office: 715 Days
• Field of Search: 703/12
• US Class Current: 706/12
• CPC Class Codes: G06F 11/0709 in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
• CPC Class Codes: G06F 11/076 by exceeding a count or rate limit, e.g. word- or bit count limit
• CPC Class Codes: G06F 11/0769 Readable error formats, e.g. cross-platform generic formats, human understandable formats
• CPC Class Codes: G06F 11/3409 for performance assessment
• CPC Class Codes: G06F 11/3447 Performance evaluation by modeling
• CPC Class Codes: H04L 61/302 Administrative registration, e.g. for domain names at internet corporation for assigned names and numbers [ICANN]

Abstract

One embodiment of a system of the present invention for monitoring computer resources includes means for retrieving a set of resource-metric records for a predetermined time interval, means for forming a first mathematical matrix containing metric'"'"'s values arranged on date-time and resource-metric axes, means for creating a second mathematical matrix containing features and a third mathematical matrix containing weights, means for building a feature relationship tree, means for generating a predicted value for the resource-metric identifier, means for determining a variance between predicted value and metric'"'"'s value, and means for triggering an alert if the variance exceeds a predetermined alert threshold.

Claims

1. A system, comprising:

a) means for retrieving a first set of records for a first predetermined time interval from one or more resource-metric records stored at one or more electronic storage devices, wherein said one or more resource-metric records at least contain a resource-metric identifier, a metric'"'"'s value, and a date-time value when said metric'"'"'s value was obtained,

b) means for forming a first mathematical matrix containing one or more metric'"'"'s values arranged on date-time and resource-metric axes,

c) means for creating a second mathematical matrix containing one or more features and a third mathematical matrix containing one or more weights, wherein multiplication of said second mathematical matrix and said third mathematical matrix produces said first mathematical matrix,

d) means for building a feature relationship tree, wherein each feature in said one or more features is assigned a list of date-time values and date-time weights from said third mathematical matrix, and said each feature is assigned a list of resource-metric identifiers and resource-metric weights from said second mathematical matrix,

e) means for generating a predicted value for said resource-metric identifier and a most recent date-time value in said feature relationship tree,

f) means for determining a variance between said predicted value and said metric'"'"'s value for said resource-metric identifier, and

g) means for triggering an alert if said variance exceeds a predetermined alert threshold.

2. The system of claim 1, further comprising the step of:

h) means for collecting said one or more resource-metric records from one or more resources on a computer network.

3. The system of claim 1, further comprising the step of:

h) means for saving said one or more resource-metric records to said one or more electronic storage devices.

4. The system of claim 1, wherein said creating said second mathematical matrix and said third mathematical matrix is achieved by applying a non-negative matrix factorization algorithm to said first mathematical matrix.

5. The system of claim 1, further comprising the step of:

h) means for sorting said list of date-time values and date-time weights for said each feature by date-time weight in descending order in said feature relationship tree.

6. The system of claim 1, further comprising the step of:

h) means for sorting said list of resource-metric identifiers and resource-metric weights for said each feature by resource-metric weight in descending order in said feature relationship tree.

7. The system of claim 1, further comprising the step of:

h) means for sorting said features by highest date-time weight of said each feature in descending order in said feature relationship tree.

8. The system of claim 1, further comprising the step of:

h) means for pruning nodes in said list of date-time values and date-time weights by leaving top N1 nodes by date-time weights in said each feature and deleting nodes with sequential positions more than N1, wherein N1 is a first predetermined value.

9. The system of claim 1, further comprising the step of:

h) means for pruning nodes in said list of resource-metric identifiers and resource-metric weights by leaving top N2 nodes by resource-metric weights in said each feature and deleting nodes with sequential positions more than N2, wherein N2 is a second predetermined value.

10. The system of claim 1, further comprising the step of:

h) means for deleting features from said feature relationship tree if said features do not contain a node corresponding to said most recent date-time value in said first set of records retrieved from said one or more electronic storage devices.

11. The system of claim 1, wherein said generating said predicted value for said resource-metric identifier and said most recent date-time value in said feature relationship tree is achieved by averaging said metric'"'"'s values.

12. The system of claim 1, wherein said generating said predicted value for said resource-metric identifier and said most recent date-time value in said feature relationship tree is achieved via a k-Nearest Neighbor algorithm.

13. The system of claim 1, wherein said variance between said predicted value and said metric'"'"'s value is normalized on a sliding scale.

14. The system of claim 1, wherein said variance between said predicted value and said metric'"'"'s value is normalized on a scale between 0 and 1.

15. The system of claim 1, wherein said variance between said predicted value and said metric'"'"'s value is normalized using a Gaussian function.

16. The system of claim 1, further comprising the step of:

h) means for verifying that a latest metric'"'"'s value for said resource-metric identifiers will trigger said alert before triggering said alert.

17. A system, comprising:

a) means for collecting one or more resource-metric records from one or more resources on a computer network, wherein said one or more resource-metric records at least contain a resource-metric identifier, a metric'"'"'s value, and a date-time value when said metric'"'"'s value was obtained,

b) means for saving said one or more resource-metric records to one or more electronic storage devices,

c) means for retrieving a first set of records from said one or more resource-metric records for a first predetermined time interval from said one or more electronic storage devices,

d) means for forming a first mathematical matrix containing one or more metric'"'"'s values arranged on date-time and resource-metric axes,

e) means for creating a second mathematical matrix containing one or more features and a third mathematical matrix containing one or more weights by applying a non-negative matrix factorization algorithm to said first mathematical matrix, wherein multiplication of said second mathematical matrix and said third mathematical matrix produces said first mathematical matrix,

f) means for building a feature relationship tree, wherein each feature in said one or more features is assigned a list of date-time values and date-time weights from said third mathematical matrix, and said feature is assigned a list of resource-metric identifiers and resource-metric weights from said second mathematical matrix,

g) means for sorting said list of date-time values and date-time weights for said each feature by date-time weight in descending order in said feature relationship tree,

h) means for sorting said list of resource-metric identifiers and resource-metric weights for said each feature by resource-metric weight in descending order in said feature relationship tree,

i) means for sorting said features by highest date-time weight of said each feature in descending order in said feature relationship tree,

j) means for pruning nodes in said list of date-time values and date-time weights by leaving top N1 nodes by date-time weights in said each feature and deleting nodes with sequential positions more than N1, wherein N1 is a first predetermined value,

k) means for pruning nodes in said list of resource-metric identifiers and resource-metric weights by leaving top N2 nodes by resource-metric weights in said each feature and deleting nodes with sequential positions more than N2, wherein N2 is a second predetermined value,

l) means for deleting features from said feature relationship tree if said features do not contain a node corresponding to a most recent date-time value in said first set of records retrieved from said one or more electronic storage devices,

m) means for generating a predicted value for each resource-metric identifier and said most recent date-time value in said feature relationship tree via a k-Nearest Neighbor algorithm,

n) means for determining a variance between said predicted value and said metric'"'"'s value for said each resource-metric identifier as a normalized value between 0 and 1 using a Gaussian function for said each resource-metric identifier, and

o) means for triggering an alert if said variance exceeds a predetermined alert threshold.

18. A system, comprising:

a) means for retrieving a first set of records for a single resource and a first predetermined time interval from one or more metric records stored at one or more electronic storage devices, wherein said one or more metric records at least contain a metric identifier, a metric'"'"'s value, and a date-time value when said metric'"'"'s value was obtained,

b) means for forming a first mathematical matrix containing one or more metric'"'"'s values arranged on date-time and metric identifier axes,

c) means for creating a second mathematical matrix containing one or more features and a third mathematical matrix containing one or more weights, wherein multiplication of said second mathematical matrix and said third mathematical matrix produces said first mathematical matrix,

d) means for building a feature relationship tree, wherein each feature in said one or more features is assigned a list of date-time values and date-time weights from said third mathematical matrix, and said each feature is assigned a list of metric identifiers and metric identifier weights from said second mathematical matrix,

e) means for generating a predicted value for said metric identifier and a most recent date-time value in said feature relationship tree,

f) means for determining a variance between said predicted value and said metric'"'"'s value for said metric identifier, and

g) means for triggering an alert if said variance exceeds a predetermined alert threshold.

19. A system, comprising:

a) means for retrieving a first set of records for a single metric and a first predetermined time interval from one or more resource records stored at one or more electronic storage devices, wherein said one or more resource records at least contain a resource identifier, a metric'"'"'s value, and a date-time value when said metric'"'"'s value was obtained,

b) means for forming a first mathematical matrix containing one or more metric'"'"'s values arranged on date-time and resource identifier axes,

c) means for creating a second mathematical matrix containing one or more features and a third mathematical matrix containing one or more weights, wherein multiplication of said second mathematical matrix and said third mathematical matrix produces said first mathematical matrix,

d) means for building a feature relationship tree, wherein each feature in said one or more features is assigned a list of date-time values and date-time weights from said third mathematical matrix, and said each feature is assigned a list of resource identifiers and resource identifier weights from said second mathematical matrix,

e) means for generating a predicted value for said resource identifier and a most recent date-time value in said feature relationship tree,

f) means for determining a variance between said predicted value and said metric'"'"'s value for said resource identifier, and

g) means for triggering an alert if said variance exceeds a predetermined alert threshold.