This application is a national stage application under 35 U.S.C. §371 of PCT/US2011/31056, filed Apr. 4, 2011.
An information technology (IT) infrastructure of an enterprise (e.g., a company, an educational organization, a government agency, etc.) can include a relatively large arrangement of components. IT administrators of the enterprise can be tasked with managing the IT infrastructure, including identifying root causes of issues that are detected, among other tasks. However, managing a relatively large IT infrastructure can be complex.
Some embodiments are described with respect to the following figures:
An information technology (IT) infrastructure includes an arrangement of components, such as hardware components (e.g., computers, storage servers, communications devices, and so forth), software components (e.g., applications, operating systems, drivers, and so forth), database components (e.g., relational database management systems, unstructured database systems, and so forth), and/or other components. As part of the overall operation of the IT infrastructure, various events can occur, including events relating to problems, failures, issues, or activities relating to components in the IT infrastructure.
Traditionally, when presented with events relating to problems, failures, issues, or activities, IT administrators are assigned the task of identifying or determining the root causes of such events. However, for a relatively large IT infrastructure, manual determination of root causes of events can be time consuming and error prone.
In accordance with some implementations, mechanisms or techniques are provided to automatically create correlation rules that define relationships between respective two or more types of events. Using correlation rules, a system can automatically identify a correlation between event types such that the system can determine, for a given event, what other event(s) caused the given event. In this manner, root causes of events relating to problems, failures, issues, or activities can be efficiently and accurately identified.
A correlation rule can specify a type of a cause event that is the cause of a type of symptom event. More generally, a correlation rule can specify one or multiple types of cause events that are the cause of one or multiple types of symptom events. A cause event refers to an event that causes occurrence of another event. A symptom event is the event that results from occurrence of another event. An “event” can refer to a problem, a failure, an issue, an activity, an operation, an input, an output, or any other occurrence in an IT infrastructure. Events can be categorized into different types. For example, one type of event is a database going down. Another type of event is a mail server starting up. Yet another type of event is an application server exhibiting an error. There are numerous other examples of event types.
An example of a correlation rule 100 is depicted in
Although a specific example of a form of correlation rule is shown in
Based on information in the correlation rule 100, a particular event (such as memory usage level—near capacity represented by 102 in
In accordance with some implementations, to automatically create correlation rules, a stream of events that have occurred can be analyzed. For example,
The number of events and the types of events illustrated in
Although
As shown in
As depicted in
Note that
Although just one pattern of event types (represented by the dusters 202A-202D) is shown in
The event correlator according to some implementations identifies (at 304) multiple occurrences (clusters) of a pattern of event types in the received events. The event correlator can invoke a clustering technique to cluster sets of events that are likely to be related because they frequently occur together or occur within a particular timeframe. The type property of the events can be used to group the events into multiple clusters of event types (e.g., clusters 202A-202D in multiple time intervals as shown in
The event correlator then analyzes (at 306) Information associated with configuration items related to the events of the pattern of event types. A correlation rule is then created (at 308) defining a relationship between the event types in response to the analyzing determining a relationship between the corresponding configuration items.
The correlation rule creating task (308) of
For each cluster of event types, the event correlator identifies (at 404) a set (e.g. pair) of specific events relating to the cluster of event types. Note that it is the specific events that are associated with configuration items, such that the identifying of the sets of specific events allows for information of the associated configuration items to be accessed (at 406). In the example of
The event correlator next determines (at 408) whether the configuration items to which the specific events are associated are actually related. For example, a shortest-path search can be performed for the configuration items of the specific events in each event pair (of specific events). The shortest-path search algorithm disqualifies the respective event pair if there is no path between the associated configuration items within a predefined number (zero or greater) of hops. In other examples, other techniques for determining whether relationships exist between configuration items can be used.
More generally, whether a relationship between configuration items exists can be determined (validated) based on accessing an information repository that describes relationships between configuration items. For example, the information repository can be a topology database that identifies topological relationships among configuration items. The topology database can be in the form of a graph having nodes corresponding to respective configuration items, and links that define relationships between the configuration items. The nodes of the topological graph can be directly linked, or indirectly linked through other nodes. Two nodes that are directly linked to each other means that the respective configuration items are connected to each other over a path of one hop. A configuration item is linked to itself by zero hops. If a first node is connected to a second node through a third node, then the respective configuration items associated with the first and second nodes are considered to be connected to each other over a path having one hop. More generally, a pair of configuration items are connected to each other over n hops (n≧1) if there are n−1 nodes between the nodes corresponding to the pair of configuration items.
In other implementations, the information repository can include a semantic database, which contains information defining relationships between configuration items.
Time interval t2 in
In the example of
Next, distinct CI instance pairs are abstracted (at 410) (with their path relationships) to the CI class level. Each instance of a configuration item has a class property, which defines the class of the configuration item. A correlation rule created using techniques according to some embodiments relates classes of configuration items, rather than specific instances of configuration items.
As part of the abstraction, the topology of the relationship between the configuration items associated with the related event types is also determined. For example, the related event types may be associated with configuration items having a containment relationship (one configuration item contains another), or alternatively, it is determined that one configuration item is related to another configuration item through an intermediate object. Such determination can allow the created correlation rule to specify the topological relationship between the configuration ire classes. The completed correlation rule includes information identifying the correlated event types and information describing the related configuration item classes (along with their topological relationship), such as in the form of graph 106 shown in
Techniques or mechanisms according to some implementations can also address user concerns about losing control of a system. To gain acceptance by IT personnel, the rule generation can be embedded in a rule-authoring tool. Instead of automatically injecting correlation rules without review by users, proposed correlation rules can be presented to a user, who can choose to accept the correlation rule as is, reject the proposed correlation rule, or modify and/or annotate the proposed correlation rule.
The events 508 contained in the event archive 506 can include various types of information, such as a problem description or other description associated with each event, information relating to users, a timestamp, a type property, and information regarding an associated CI. The type property associated with information relating to an event provides information regarding the type of event.
The event archive 506, database 512, and any correlation rules 504 created by the event correlator 502, are stored in storage media 510, which can be implemented with one or multiple storage devices such as a disk-based storage device, integrated circuit storage device, and/or other type of storage device.
The system 500 also includes one or multiple processors 516. The event correlator 502 is executable on the processor(s) 516. Moreover, the system 500 includes a network interface 518 to allow the system 500 to communicate over a data network with remote systems, such as systems that produced the events for storing in the event archive 506.
Although the event archive 506 and CMDB 512 are stored in the storage media of the system 500, it is noted that in alternative examples, the event archive 506 and/or CMDB 512 can be stored on a remote, storage subsystem (or multiple remote storage subsystems).
By being able to automatically create correlation rules 504, domain expertise expected of IT administrators or other users can be reduced for the purpose of identifying root causes of events. By being able to automatically create correlation rules 504 that can assist in automatically determining causes of symptom events, improved efficiency and reduced cost in managing IT infrastructure can be accomplished.
Machine-readable instructions of the event correlator 502 are loaded for execution on the processor(s) 516. A processor can include a microprocessor, microcontroller, processor module or subsystem, programmable integrated circuit, programmable gate array, or another control or computing device.
Data and instructions are stored in respective storage devices, which are implemented as one or more computer-readable or machine-readable storage media. The storage media include different forms of memory including semiconductor memory devices such as dynamic or static random access memories (DRAMs or SRAMs), erasable and programmable read-only memories (EPROMs), electrically erasable and programmable read-only memories (EEPROMs) and flash memories; magnetic disks such as fixed, floppy and removable disks; other magnetic media including tape; optical media such as compact disks (CDs) or digital video disks (DVDs); or other types of storage devices. Note that the instructions discussed above can be provided on one computer-readable or machine-readable storage medium, or alternatively, can be provided on multiple computer-readable or machine-readable storage media distributed in a large system having possibly plural nodes. Such computer-readable or machine-readable storage medium or media is (are) considered to be part of an article (or article of manufacture). An article or article of manufacture can refer to any manufactured single component or multiple components. The storage medium or media can be located either in the machine running the machine-readable instructions, or located at a remote site from which machine-readable instructions can be downloaded over a network for execution.
In the foregoing description, numerous details are set forth to provide an understanding of the subject disclosed herein. However, implementations may be practiced without some or all of these details. Other implementations may include modifications and variations from the details discussed above. It is intended that the appended claims cover such modifications and variations.
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/US2011/031056 | 4/4/2011 | WO | 00 | 9/30/2013 |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO2012/138319 | 10/11/2012 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 5483637 | Winokur et al. | Jan 1996 | A |
| 6154849 | Xia | Nov 2000 | A |
| 6249755 | Yemini et al. | Jun 2001 | B1 |
| 6446136 | Pohlmann et al. | Sep 2002 | B1 |
| 7089250 | Doganata et al. | Aug 2006 | B2 |
| 7631222 | Hasan | Dec 2009 | B2 |
| 7730494 | Rosenbluth et al. | Jun 2010 | B1 |
| 7889666 | Pei | Feb 2011 | B1 |
| 8069374 | Panigrahy et al. | Nov 2011 | B2 |
| 8464279 | Gutjahr et al. | Jun 2013 | B2 |
| 8751417 | Watanabe | Jun 2014 | B2 |
| 8984337 | Sonoda | Mar 2015 | B2 |
| 9021304 | Tonouchi | Apr 2015 | B2 |
| 9229898 | Ramakrishnan | Jan 2016 | B2 |
| 20050015217 | Weidl et al. | Jan 2005 | A1 |
| 20050080806 | Doganata | Apr 2005 | A1 |
| 20070266142 | Nastacio | Nov 2007 | A1 |
| 20080103847 | Sayal | May 2008 | A1 |
| 20080195369 | Duyanovich et al. | Aug 2008 | A1 |
| 20090177692 | Chagoly | Jul 2009 | A1 |
| 20090183030 | Bethke et al. | Jul 2009 | A1 |
| 20100070981 | Hadar | Mar 2010 | A1 |
| 20100131315 | Gilbert | May 2010 | A1 |
| 20100223628 | Rosenbluth | Sep 2010 | A1 |
| 20110055138 | Khanduja | Mar 2011 | A1 |
| 20140006871 | Lakshmanan et al. | Jan 2014 | A1 |
| 20150033086 | Sasturkar et al. | Jan 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 1332867 | Jan 2002 | CN |
| 200821960 | May 2008 | TW |
| Entry |
|---|
| European Patent Office, Extended European Search Report for Appl. No. 11863207.4 dated Jun. 2, 2015 (7 pages). |
| Korean Intellectual Property Office, International Search Report and Written Opinion for PCT/US2011/031056 dated Nov. 18, 2011 (9 pages). |
| The International Bureau of WIPO, International Preliminary Report on Patentability for PCT/US2011/031056 dated Oct. 17, 2013 (6 pages). |
| Number | Date | Country | |
|---|---|---|---|
| 20140025998 A1 | Jan 2014 | US |