US 7,003,779 B2 · Hierarchical connected graph model for implementation of event management design

Abstract

An automated method and system for the implementation of a hierarchical event relationship network for correlation analysis in a distributed computing environment in which events are defined based on a connected graph model. Event handling information for each event type to be monitored is used to customize a plurality of rule templates for each type within an event source, where the event source is a hardware component, an application software component or an operating system platform. A plurality of event relationship network rules are verified to ensure they do not violate an event protocol. A hierarchical class definition and naming structure is generated from the plurality of event relationship network rules for each event source. Event management rules are then generated automatically for each event type from the event relationship network rules and the rule templates. The event management rules are loaded into a rule-based event manager. The performance of the rule-based event manager is then monitored.

Claims51

Dependent claims

A computer-implemented method for the automated generation of a class definition and naming structure from an event relationship network represented by a hierarchical connected graph to perform correlation analysis in a distributed computing environment, comprising the acts of:

automatically assigning events in a subnet to a superclass defined with the same name as the subnet;
assigning a path number to connected events in the same subnet;
determining if a branch point has been reached in the connected graph;
if a branch point has been reached, assigning a new path number to the branch, adding the assigned path number to events that are earlier in the sequence than the branch point, and appending a list of events and assigned path numbers to a path identification slot for each event;
and
if a branch point has not been reached, incrementing a sequence number that is assigned to each event and adding the event sequence numbers to a sequence identification list.

3 more elements

A computer readable medium containing a computer program product for the automated generation of a class definition and naming structure from an event relationship network represented by a hierarchical connected graph to perform correlation analysis in a distributed computing environment, the computer program product comprising:

program instructions that automatically assign events in a subnet to a superclass defined with the same name as the subnet;
program instructions that assign a path number to connected events in the same subnet;
program instructions that determine if a branch point has been reached in the connected graph;
program instructions that assign a new path number to the branch, add the assigned path number to events that are earlier in the sequence than the branch point, and append a list of events and assigned path numbers to a path identification slot for each event, if a branch point has been reached;
and
program instructions that increment a sequence number that is assigned to each event and add the event sequence numbers to a sequence identification list, if a branch point has not been reached.

3 more elements

A computer-implemented system for the automated generation of a class definition and naming structure from an event relationship network represented by a hierarchical connected graph to perform correlation analysis in a distributed computing environment, comprising:

a component that automatically assigns events in a subnet to a superclass defined with the same name as the subnet;
a component that assigns a path number to connected events in the same subnet;
a component that determines if a branch point has been reached in the connected graph;
a component that assigns a new path number to the branch, adds the assigned path number to events that are earlier in the sequence than the branch point, and appends a list of events and assigned path numbers to a path identification slot for each event, if a branch point has been reached;
and
a component that increments a sequence number that is assigned to each event and adds the event sequence numbers to a sequence identification list, if a branch point has not been reached.

3 more elements

Dependencies are inferred from the claim text.

Hierarchical connected graph model for implementation of event management design

Life of this patent

Hierarchical connected graph model for implementation of event management design

Life of this patent

Abstract

Claims51