Method and apparatus for optimizing response time to events in queue
First Claim
1. A system for optimizing response time to events waiting to be routed, the system comprising:
- a processor; and
a memory coupled to the processor, wherein the memory has stored thereon instructions that, when executed by the processor, causes the processor to;
monitor a collection of a plurality of events waiting to be routed, for identifying events with an assigned priority below a threshold priority;
detect a criteria for evaluating disposal times of events in the collection, wherein the criteria is accumulation of at least a certain amount of events with the assigned priority in the collection, wherein the certain amount of events comprise a subset of the plurality of events in the collection;
conditioned upon detecting criteria, identify data corresponding to disposal times for the subset of events;
estimate a collective measure of the disposal times for the subset of events based on the data;
compare the collective measure of the disposal times against a threshold disposal time;
determine, based on the comparing, whether a disposal criteria is satisfied;
in response to determining that the disposal criteria is satisfied, modify the priority associated with each event in the subset of events from a first priority to a second priority; and
route each of the subset of events to a corresponding resource.
4 Assignments
0 Petitions
Accused Products
Abstract
A system for optimizing response time to events or representations thereof waiting in a queue has a first server having access to the queue; a software application running on the first server; and a second server accessible from the first server, the second server containing rules governing the optimization. In a preferred embodiment, the software application at least periodically accesses the queue and parses certain ones of events or tokens in the queue and compares the parsed results against rules accessed from the second server in order to determine a measure of disposal time for each parsed event wherein if the determined measure is sufficiently low for one or more of the parsed events, those one or more events are modified to a reflect a higher priority state than originally assigned enabling faster treatment of those events resulting in relief from those events to the queue system load.
187 Citations
9 Claims
-
1. A system for optimizing response time to events waiting to be routed, the system comprising:
-
a processor; and a memory coupled to the processor, wherein the memory has stored thereon instructions that, when executed by the processor, causes the processor to; monitor a collection of a plurality of events waiting to be routed, for identifying events with an assigned priority below a threshold priority; detect a criteria for evaluating disposal times of events in the collection, wherein the criteria is accumulation of at least a certain amount of events with the assigned priority in the collection, wherein the certain amount of events comprise a subset of the plurality of events in the collection; conditioned upon detecting criteria, identify data corresponding to disposal times for the subset of events; estimate a collective measure of the disposal times for the subset of events based on the data; compare the collective measure of the disposal times against a threshold disposal time; determine, based on the comparing, whether a disposal criteria is satisfied; in response to determining that the disposal criteria is satisfied, modify the priority associated with each event in the subset of events from a first priority to a second priority; and route each of the subset of events to a corresponding resource. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
Specification