An event-based analysis engine reacts to one or more events. For example, if an event occurs, the event-based analysis engine performs an action based on a rule. In one particular example, the event may be based on historical information.
In one aspect, a method includes receiving a trigger associated with a rule, determining if the rule requires that historical information be provided to an event-based analysis engine, filtering out events not needed by the rule if the rule requires historical information and providing the event-based analysis engine with historical information based on the filtering.
In another aspect, an article includes a non-transitory machine-readable medium that stores executable instructions to provide data to an event-based analysis engine. The instructions cause a machine to receive a trigger associated with a rule, determine if the rule requires that historical information be provided to an event-based analysis engine, filter out events not needed by the rule if the rule requires historical information and provide the event-based analysis engine with historical information based on the filtering.
In a further aspect, an apparatus includes circuitry to provide data to an event-based analysis engine and configured to receive a trigger associated with a rule, determine if the rule requires that historical information be provided to an event-based analysis engine, filter out events not needed by the rule if the rule requires historical information and provide the event-based analysis engine with historical information based on the filtering.
Described herein are techniques to provide historical data to an event-based analysis engine. For example, the historical data is provided automatically (without user intervention). In one particular example, the historical data is provided using a generic and/or rule-specific loading mechanism. In one example, the techniques described herein work even if the rules and events that are stored in a memory of the event-based analysis engine are lost, for example, due to a restart of the event-based analysis engine.
Referring to
The module 106 includes a parser 122, filter 132 and a query component 142. The parser 122 parses a rule and identifies whether a rule requires historical data. For example, the parser 122 is configured to recognize a rule that requires historical data if at least one of the following conditions are true: (1) the rule includes a statistical operator, (2) the rule includes a change management operator; and (3) the rule correlates between two or more event types. The statistical operator is used to run a calculation of a metric over a time period requiring all the events or the aggregation of the events for the time period. The change management operator determines if data has changed so that historical data is required to determine whether the data has changed from one point in time to another point in time. The rule correlating between two or more event types means that the rule is required to store an event associated with a required event type so that whenever a new event (one of the required event types) is received, the rule can be executed.
The rules are evaluated when an event is sent to the event-based analysis engine 102. The event-based analysis engine is configured to recognize which rules to evaluate based on the event that is received. In an example where the rule is required to check a condition for more than one event (which are not received at the same time), the event-based analysis engine 102 keeps the events for both types in memory 114 so whenever it receives both events event-based analysis engine 102 can start evaluating the rule condition.
If historical data is required, the parser 122 provides the required objects (e.g., a host, disk and so forth), event types (e.g., a backup job, CPU utilization, disk status and so forth) and a time period to the filter 132.
The filter 132 filters out any event that is not required by the rule and returns the results back to the parser 122. For example, if a rule requires that a backup state of a backup job be successful, then any backup that is not successful is filtered out. The information that will be sent in this example are the backup jobs events that are needed for the enabled rules (i.e., just for the backup servers that the rule is enabled on, the backup jobs for the required time period and just the backup jobs whose state is exactly what is required by the rule).
The parser 122 provides the filtered results from the input filter 132 to the query component 142. The query component 142 receives the filtered results from the parser 122 and queries the database 108 to retrieve the historical data and provides the historical information to the event-based engine 102.
Referring to
Process 200 determines if the rule will require that historical data be provided to an event-based analysis engine (208). For example, the rule contains at least one of a statistical operator, a change management operator or a correlation between two or more event types.
If the rule will require historical data be provided to the event-based analysis engine, then process 200 filters out events that are not required (212).
Process 200 provides event-based analysis engine with the required information (218). For example, the query component 142 searches the database 108 and provides the memory 114 of the event-based analysis engine 102 with the historical data.
Referring to
The processes described herein (e.g., the process 200) are not limited to use with the hardware and software of
The system may be implemented, at least in part, via a computer program product, (e.g., in a machine-readable storage device), for execution by, or to control the operation of, data processing apparatus (e.g., a programmable processor, a computer, or multiple computers)). Each such program may be implemented in a high level procedural or object-oriented programming language to communicate with a computer system. However, the programs may be implemented in assembly or machine language. The language may be a compiled or an interpreted language and it may be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network. A computer program may be stored on a storage medium or device (e.g., CD-ROM, hard disk, or magnetic diskette) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform the processes described herein. The processes described herein may also be implemented as a machine-readable storage medium, configured with a computer program, where upon execution, instructions in the computer program cause the computer to operate in accordance with the processes. A non-transitory machine-readable medium may include but is not limited to a hard drive, compact disc, flash memory, non-volatile memory, volatile memory, magnetic diskette and so forth but does not include a transitory signal per se.
The system and processes described herein are not limited to the specific examples described.
For example, referring to
In another example, the process 200 is not limited to the specific processing order of
The processing blocks (for example, in the process 200 of
Elements of different embodiments described herein may be combined to form other embodiments not specifically set forth above. Other embodiments not specifically described herein are also within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
7076685 | Pillai et al. | Jul 2006 | B2 |
7409379 | Katzer | Aug 2008 | B1 |
7482931 | Lin | Jan 2009 | B2 |
7606813 | Gritsay et al. | Oct 2009 | B1 |
7613726 | Spivak et al. | Nov 2009 | B1 |
7668953 | Sinclair et al. | Feb 2010 | B1 |
7761594 | Mowat | Jul 2010 | B1 |
7836427 | Li et al. | Nov 2010 | B1 |
8224761 | Rockwood | Jul 2012 | B1 |
20040093581 | Nielsen et al. | May 2004 | A1 |
20040117407 | Kumar et al. | Jun 2004 | A1 |
20040250258 | Raghuvir et al. | Dec 2004 | A1 |
20050125688 | Ogawa et al. | Jun 2005 | A1 |
20050246304 | Knight et al. | Nov 2005 | A1 |
20060179028 | Bram et al. | Aug 2006 | A1 |
20060179042 | Bram et al. | Aug 2006 | A1 |
20060179058 | Bram et al. | Aug 2006 | A1 |
20070094199 | Deshpande et al. | Apr 2007 | A1 |
20070260470 | Bornhoevd et al. | Nov 2007 | A1 |
20080196006 | Bates et al. | Aug 2008 | A1 |
20090019000 | Arends et al. | Jan 2009 | A1 |
20090113387 | Ziegler | Apr 2009 | A1 |
20090150319 | Matson et al. | Jun 2009 | A1 |
20090171879 | Bullen et al. | Jul 2009 | A1 |
20090287628 | Indeck et al. | Nov 2009 | A1 |
20100128676 | Wu et al. | May 2010 | A1 |
20100175055 | Wang et al. | Jul 2010 | A1 |
20100198636 | Choudhary et al. | Aug 2010 | A1 |
20110138291 | Twiddy et al. | Jun 2011 | A1 |
20110141913 | Clemens et al. | Jun 2011 | A1 |
20110167433 | Appelbaum et al. | Jul 2011 | A1 |
20110191692 | Walsh et al. | Aug 2011 | A1 |
20110238452 | Ziade et al. | Sep 2011 | A1 |
20120131185 | Petersen et al. | May 2012 | A1 |
20120291008 | Bates et al. | Nov 2012 | A1 |
20120317504 | Patel et al. | Dec 2012 | A1 |
20130132108 | Solilov et al. | May 2013 | A1 |
20130191185 | Galvin | Jul 2013 | A1 |
20140165140 | Singla et al. | Jun 2014 | A1 |
Entry |
---|
Blitzer et al.; “Managing a Memory of an Event-Based Analysis Engine;” U.S. Appl. No. 13/534,461, filed Jun. 27, 2012; 22 pages. |
Blitzer et al.; “Simplifying Rules Generation for an Event-Based Analysis Engine by Allowing a User to Combine Related Objects in a Rule;” U.S. Appl. No. 13/533,159, filed Jun. 26, 2012; 29 pages. |
Blitzer et al.; “Simplifying Rules Generation for an Event-Based Analysis Engine;” U.S. Appl. No. 13/534,458, filed Jun. 27, 2012; 30 pages. |
Blitzer, et al.; “Using Data Aggregation to Manage a Memory for an Event-Based Analysis Engine;” U.S. Appl. No. 13/727,855, filed Dec. 27, 2012; 18 Pages. |
Office Action date Jul. 17, 2014 corresponding to U.S. Appl. No. 13/534,481, 10 Pages. |
Office Action dated Feb. 13, 2014 corresponding to U.S. Appl. No. 13/533,159, 14 Pages. |
Response to Office Action dated Feb. 13, 2014 corresponding to U.S. Appl. No. 13/533,159; Response filed Aug. 8, 2014, 12 Pages. |
Office Action dated Jan. 31, 2014 corresponding to U.S. Appl. No. 13/534,488, 23 Pages. |
Response to Office Action dated Jan. 31, 2014 corresponding to U.S. Appl. No. 13/534,488; Response filed Jul. 30, 2014, 13 Pages. |
Final Office Action dated Mar. 26, 2015 corresponding to U.S. Appl. No. 13/534,488; 25 Pages. |
Office Action from the U.S. Patent and Trademark Office dated Dec. 10, 2014 corresponding to U.S. Appl. No. 13/727,855; 14 Pages. |
Tucker et al., “Method of Processing Events for Real-Time Analysis of Key Processes of an Enterprise;” Patent Application AU 2010212459; Filed Aug. 20, 2010; Published Mar. 24, 2011; 34 Pages. |
Notice of Allowance dated Nov. 5, 2014 corresponding to U.S. Appl. No. 13/534,481; 9 Pages. |
Response filed May 11, 2015 to Office Action dated Dec. 10, 2014; for a U.S. Appl. No. 13/727,855; 19 pages. |
Notice of Allowance dated May 29, 2015 corresponding to U.S. Appl. No. 13/727,855; 19 Pages. |
Appeal Brief dated Jun. 12, 2015 corresponding to U.S. Appl. No. 13/533,159; 21 Pages. |
Request for Continued Examination (RCE) with a Response to Final Office Action dated May 11, 2015 corresponding to U.S. Appl. No. 13/534,488; RCE and Response filed Jun. 26, 2015; 15 Pages. |
Non-Final Office Action dated Jul. 31, 2015 corresponding to U.S. Appl. No. 13/534,488; 22 Pages. |