Event resolution as a dynamic service

Patent metadata

Field	Value
Publication number	US-10535002-B2
Application number	US-201615054904-A
Country	US
Kind code	B2
Filing date	Feb 26, 2016
Priority date	Feb 26, 2016
Publication date	Jan 14, 2020
Grant date	Jan 14, 2020

Abstract

An approach is provided for optimally routing events in an IT system to solvers which provide resolutions of the events. Event streams originating from the IT system are defined. Events are classified into the event streams. An optimization problem is solved that minimizes costs incurred for using respective solvers based on constraints which include success rates of the solvers. Based on the solved optimization problem, policies are defined that associate the event streams to the solvers in a many-to-one correspondence. In real time, the defined policies are applied to the event streams. Based on the applied policies and the classified events, the events are routed to respective solvers. An indication is received that the events are resolved by the respective solvers, which reduces downtime in the IT system.

First claim

What is claimed is:

1. A method of optimally routing events in an IT system to solvers which provide resolutions of the events, the method comprising the steps of:
a computer defining event streams originating from the IT system;
the computer classifying events into the event streams;
the computer solving an optimization problem that minimizes costs incurred for using respective solvers based on constraints which include success rates of the solvers;
based on the solved optimization problem, the computer defining policies that associate the event streams to the solvers in a many-to-one correspondence;
the computer, in real time, applying the defined policies to the event streams;
based on the applied policies and the classified events, the computer routing the events to respective solvers; and
the computer receiving an indication that the events are resolved by the respective solvers, which reduces downtime in the IT system,
wherein the step of solving the optimization problem includes the steps of:
the computer determining costs incurred for using the respective solvers;
the computer determining penalties incurred by a provider of the IT system in response to solvers not meeting service level objectives; and
the computer modeling an objective function based on the costs and the penalties.

2. The method of claim 1 , wherein the step of determining the costs includes the step of obtaining information about the costs from an agreement by which a solver agrees to bill based on a number of events served and a number of time units for which the solver was in use.

3. The method of claim 1 , wherein the step of determining the costs includes the step of obtaining information about the costs from an agreement by which a solver agrees to bill based on internal cost components that include a number of worker units that the solver employed to service an event stream and a quantum of management infrastructure that the solver expended to service an event stream.

4. The method of claim 1 , wherein the step of determining the penalties includes obtaining information about penalties incurred by a provider of the IT system in response to solvers missing respective service level objectives.

5. The method of claim 1 , wherein the step of solving the optimization problem includes the steps of:
generating a vector of unknown parameters for the objective function;
defining a domain for each of the unknown parameters;
generating a set of samples for the vector;
for the set of samples, computing a value of the objective function and determining whether constraints of the objective function are violated;
if the constraints are violated, discarding the sample as being infeasible, or if the constraints are not violated, keeping the sample as being feasible;
repeating the steps of generating the set of samples, computing the value, determining whether the constraints are violated, and discarding or keeping the sample; and
presenting the sets of samples that are feasible to a user; and
receiving a selection by the user of one of the sets of samples based on a Pareto analysis of the presented sets.

6. The method of claim 1 , further comprising the step of:
providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable program code in the computer, the program code being executed by a processor of the computer to implement the steps of defining the event streams, classifying, solving, defining the policies, applying, routing, and receiving.

7. The method of claim 1 , further comprising the step of:
providing software as a service in a cloud environment, the software being executed by a hardware processor in the cloud environment to implement the steps of defining the event streams, classifying, solving, defining the policies, applying, routing, and receiving.

8. A computer program product, comprising:
a computer-readable storage device; and
a computer-readable program code stored in the computer-readable, storage device, the computer-readable program code containing instructions that are executed by a central processing unit (CPU) of a computer system to implement a method of optimally routing events in an IT system to solvers which provide resolutions of the events, the method comprising the steps of:
the computer system defining event streams originating from the IT system;
the computer system classifying events into the event streams;
the computer system solving an optimization problem that minimizes costs incurred for using respective solvers based on constraints which include success rates of the solvers;
based on the solved optimization problem, the computer system defining policies that associate the event streams to the solvers in a many-to-one correspondence;
the computer system, in real time, applying the defined policies to the event streams;
based on the applied policies and the classified events, the computer system routing the events to respective solvers; and
the computer system receiving an indication that the events are resolved by the respective solvers, which reduces downtime in the IT system,
wherein the step of solving the optimization problem includes the steps of:
the computer system determining costs incurred for using the respective solvers;
the computer system determining penalties incurred by a provider of the IT system in response to solvers not meeting service level objectives; and
the computer system modeling an objective function based on the costs and the penalties.

9. The computer program product of claim 8 , wherein the step of determining the costs includes the step of obtaining information about the costs from an agreement by which a solver agrees to bill based on a number of events served and a number of time units for which the solver was in use.

10. The computer program product of claim 8 , wherein the step of determining the costs includes the step of obtaining information about the costs from an agreement by which a solver agrees to bill based on internal cost components that include a number of worker units that the solver employed to service an event stream and a quantum of management infrastructure that the solver expended to service an event stream.

11. The computer program product of claim 8 , wherein the step of determining the penalties includes obtaining information about penalties incurred by a provider of the IT system in response to solvers missing respective service level objectives.

12. The computer program product of claim 8 , wherein the step of solving the optimization problem includes the steps of:
generating a vector of unknown parameters for the objective function;
defining a domain for each of the unknown parameters;
generating a set of samples for the vector;
for the set of samples, computing a value of the objective function and determining whether constraints of the objective function are violated;
if the constraints are violated, discarding the sample as being infeasible, or if the constraints are not violated, keeping the sample as being feasible;
repeating the steps of generating the set of samples, computing the value, determining whether the constraints are violated, and discarding or keeping the sample; and
presenting the sets of samples that are feasible to a user; and
receiving a selection by the user of one of the sets of samples based on a Pareto analysis of the presented sets.

13. A computer system comprising:
a central processing unit (CPU);
a memory coupled to the CPU; and
a computer readable storage device coupled to the CPU, the storage device containing instructions that ar

Assignees

• IBM

Inventors

• Gupta Manish
• Venkateswaran Sreekrishnan

Classifications

• G06F9/542 Primary

  Event management; Broadcasting; Multicasting; Notifications · CPC title

• G06N5/01 Primary

  Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound · CPC title

• G06N5/003 Primary

  Physics · mapped topic