Incident handling

Patent metadata

Field	Value
Publication number	US-9274877-B2
Application number	US-201114235393-A
Country	US
Kind code	B2
Filing date	Jul 31, 2011
Priority date	Jul 31, 2011
Publication date	Mar 1, 2016
Grant date	Mar 1, 2016

Abstract

A first future time occurs sooner than a second future time. The first future time indicates when the first and second future times are to be evaluated. The second future time provides a boundary between schedules occurring sooner and schedules occurring later. A schedule is generated and added to a database stored in a non-volatile storage. The schedule is for executing, in relation to an incident, an incident-handling action corresponding to a condition matching the incident. The schedule has an execution time at which to execute the incident-handling action in relation to the incident. Where the execution time is sooner than the second future time, the schedule is added to a queue stored in a volatile memory. Upon a current time equaling the execution time, the schedule is removed from the queue and correspondingly executing the incident-handling action in relation to the incident.

First claim

We claim:

1. A method comprising:
specifying first and second future times, the first future time occurring sooner than the second future time, the first future time indicating when the first and second future times are to be specified again, the second future time providing a boundary between schedules occurring sooner and schedules occurring later;
generating and adding a schedule to a database stored in a non-volatile storage, by a processor, the schedule for executing, in relation to an incident, an incident-handling action corresponding to a condition matching the incident, the schedule having an execution time at which to execute the incident-handling action in relation to the incident;
where the execution time is sooner than the second future time, adding the schedule to a queue stored in a volatile memory, by the processor;
upon a current time equaling the execution time, removing the schedule from the queue and correspondingly executing the incident-handling action in relation to the incident, by the processor; and
upon the current time equaling the first future time, specifying the first future time and the second future time again.

2. The method of claim 1 , further comprising:
where the execution time is later than the second specified time, not adding the schedule to the queue.

3. The method of claim 1 , further comprising:
upon the current time equaling the first future time,
where the schedule is not in the queue and where the execution time is sooner than the second future time as has been specified again, adding the schedule to the queue, by the processor.

4. The method of claim 3 , wherein a first time delta separates the first future time from the current time, and a second time delta separates the second future time from the current time,
and wherein specifying the first future time and the second future time again comprises specifying the first future time as the current time plus the first time delta, and specifying the second future time as the current time plus the second time delta.

5. The method of claim 4 , wherein the first time delta and the second time delta are static, such that the first time delta and the second time delta remain unchanged when the first future time and the second future time are specified again.

6. The method of claim 4 , wherein one or more of the first time delta and the second time delta are dynamic, such that the one or more of the first time delta and the second time delta change when the first future time and the second future time are specified again.

7. The method of claim 6 , wherein the one or more of the first time delta and the second time delta change based on one or more of:
a size of the queue;
a number of schedules in the queue.

8. The method of claim 1 , further comprising:
where the incident no longer occurs,
removing the schedule from the database; and,
removing the schedule from the queue where the schedule is in the queue.

9. The method of claim 1 , further comprising:
after executing the incident-handling action in relation to the incident, removing the schedule from the database.

10. The method of claim 1 , further comprising:
determining, by the processor, that the incident matches the condition.

11. The method of claim 1 , further comprising:
where the schedule is in the queue and where the execution time is later than the second future time as has been specified again, removing the schedule from the queue, by the processor.

12. A system comprising:
a processor;
a non-volatile storage device to store a database of schedules, each schedule for executing in relation to an incident, and at an execution time, an incident-handling action corresponding to a condition matching the incident;
a volatile memory device to store a queue of just the schedules of which the execution times are sooner than a second future time that occurs later than a first future time, the first future time indicating when the first and second future times are to be evaluated, the second future time providing a boundary between the schedules occurring sooner and the schedules occurring later; and,
a computer-readable data storage medium to store computer-readable code executable by the processor to implement a schedule manager to manage the schedules within the database and within the queue, based on a current time, the first and second future times, and the execution times of the schedules; and
wherein the computer-readable code is executable by the processor to, upon the current time equaling the first future time, specify the first future time and the second future time again.

13. The system of claim 12 , wherein the database is further of matching states of the incidents and the conditions,
and wherein the computer-readable data storage medium is further to store computer-readable code executable by the processor to implement a rule checker to manage matching states of the incidents and the conditions.

14. The system of claim 12 , wherein the computer-readable data storage medium is further to store computer-readable code executable by the processor to implement an action runner to execute the incident-handling actions of the schedules in the queue having execution times that match the current time.

15. The system of claim 14 , wherein the volatile memory device is further to store a cache through which the matching states of the database are accessed by the action runner.

16. The system of claim 12 , wherein the computer-readable code is executable by the processor to:
where a given one of the schedules is in the queue and has an execution time that is later than the second future time as has been specified again, remove the schedule from the queue.

17. The system of claim 12 , wherein the computer-readable code executable by the processor to specify the first future time and the second future time again comprises computer-readable code executable by the processor to:
specify the first future time as the current time plus a first time delta, and specify the second future time as the current time plus a second time delta
wherein the one or more of the first time delta and the second time delta are determined, when the first future time and the second future time are specified again, based on one or more of:
a size of the queue;
a number of schedules in the queue.

18. A non-transitory computer-readable data storage medium comprising computer-readable code executable by a processor to:
generate and add a schedule to a database stored in a non-volatile storage, the schedule for executing, in relation to an incident, an incident-handling action corresponding to a condition matching the incident, the schedule having an execution time at which to execute the incident-handling action in relation to the incident;
where the execution time is sooner than a second future time that occurs later than a first future time, add the schedule to a queue stored in a volatile memory, the first future time indicating when the first and second future times are to be evaluated, the second future time providing a boundary between schedules occurring sooner and schedules occurring later; and,
upon a current time equaling the execution time, remove the schedule from the queue and correspondingly execute the incident-handling action in relation to the incident; and
upon the current time equaling the first future time, specify the first future time and the second future time again.

19. The storage medium of claim 18 , wherein the computer-readable code is executable

Assignees

• Gutjahr Bernd
• Bosler Martin
• Schaefer Christian
• Hewlett Packard Entpr Dev Lp

Inventors

• Gutjahr Bernd
• Bosler Martin
• Schaefer Christian

Classifications

• H04L41/0622

  based on time · CPC title

• G06F9/4881

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

• H04L43/067

  using time frame reporting · CPC title

• G06F9/4887

  involving deadlines, e.g. rate based, periodic · CPC title

• G06F5/14

  for overflow or underflow handling, e.g. full or empty flags · CPC title