SPEEDY EVENT PROCESSING

• US 20100043003A1
• Filed: 08/12/2008
• Published: 02/18/2010
• Est. Priority Date: 08/12/2008
• Status: Active Grant

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: Verizon Data Services LLC (Verizon Communications Inc.)
• Inventors: Mao, Ai-Sheng, Valdez, John P.
• Granted Patent: US 8,239,873 B2
• Time in Patent Office: Days
• US Class Current: 718/103
• CPC Class Codes: G06F 2209/543 Local
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications

Abstract

A method for event positioning includes categorizing events into event groups based on a priority level, buffering the events in each event group into a group event queue, and determining an optimized position for events within each queue based, at least in part, on a processing time and an expected response time for each event in the group event queue.

Claims

1. A method for event positioning, comprising:

categorizing events into event groups based on a priority level;

buffering the events in each event group into a group event queue; and

determining an optimized position for events within each queue based, at least in part, on a processing time and an expected response time for each event in the group event queue.

2. The method of claim 1, wherein determining an optimized position for events includes applying a set of heuristics to events in each group event queue.

3. The method of claim 1, further including determining whether the position of two events in the group event queue meet criteria for exchanging positions.

4. A method for positioning an event in an event queue, comprising:

calculating a time delay tolerance for an event; and

determining an indicator bit based on the value of the time delay tolerance.

5. The method of claim 4, wherein the time delay tolerance represents a differential between the event'"'"'s expected response time and its finishing time.

6. The method of claim 4, wherein calculating a time delay tolerance includes calculating a variable representing an accumulative event processing time.

7. The method of claim 6, wherein the event is an arriving event and the accumulative event processing time is the sum of the event processing times for each event in the event queue that proceeds the arriving event.

8. The method of claim 4, wherein the indicator bit represents an event'"'"'s ability to tolerate a time delay without missing its expected response time.

9. The method of claim 4, further comprising partitioning a group event queue to define a non-event-positioned list and an event-positioned list and wherein each of the non-event-positioned list and the event-positioned list include a plurality of event nodes.

10. The method of claim 9, further comprising determining whether an event node is exchangeable with an adjacent event node.

11. A method for positioning an event in an event queue, comprising:

partitioning a group event queue to define a non-event-positioned list and an event-positioned list and wherein each of the non-event-positioned list and the event-positioned list include a plurality of event nodes; and

applying a set of event positioning heuristics to an event at a first node in the non-event-positioned list.

12. The method of claim 11, wherein applying a set of event positioning heuristics includes;

calculating a time delay tolerance for the event at the first node in the non-event-positioned list; and

determining an indicator bit based on the value of the time delay tolerance for the event at the first node.

13. The method of claim 12, further comprising determining whether the event at the first node is exchangeable with an adjacent event node if the indicator bit for the event at the first node is greater than zero.

14. The method of claim 13, wherein determining whether the event at the first node is exchangeable with an adjacent event node is based upon meeting predetermined criteria.

15. A method, comprising:

partitioning a group event queue to define a non-event-positioned list and an event-positioned list and wherein each of the non-event-positioned list and the event-positioned list include a plurality of event nodes;

calculating a time delay tolerance for the event at the first node in the non-event-positioned list;

determining an indicator bit based on the value of the time delay tolerance for the event at the first node; and

determining whether the event at the first node is exchangeable with an adjacent event node in the event-positioned list if the indicator bit for the event at the first node is greater than zero.

16. The method of claim 15, wherein determining whether the event at the first node is exchangeable with an adjacent event node is based upon meeting predetermined criteria.

17. A system comprising a computing device that includes an application configured to:

partition a group event queue to define a non-event-positioned list and an event-positioned list and wherein each of the non-event-positioned list and the event-positioned list include a plurality of event nodes;

calculate a time delay tolerance for the event at the first node in the non-event-positioned list;

determine an indicator bit based on the value of the time delay tolerance for the event at the first node; and

determine whether the event at the first node is exchangeable with an adjacent event node in the event-positioned list if the indicator bit for the event at the first node is greater than zero.

18. A system, comprising:

a computer readable medium that includes an application configured to;

calculate a time delay tolerance for an event at a first node in a non-event-positioned list in an event queue;

determine an indicator bit based on the value of the time delay tolerance for the event at the first node; and

determine whether the event at the first node is exchangeable with an adjacent event node in an event-positioned list if the indicator bit for the event at the first node is greater than zero.

19. A computer-readable medium tangibly embodying computer-executable instructions for:

calculating a time delay tolerance for the event at the first node in the non-event-positioned list;

determining an indicator bit based on the value of the time delay tolerance for the event at the first node;

determining whether the event at the first node is exchangeable with an adjacent event node in the event-positioned list if the indicator bit for the event at the first node is greater than zero.