Method and apparatus for optimizing response time to events in queue
First Claim
1. A system for optimizing response time to events or representations thereof waiting in a queue by predicting an estimated disposal time for certain ones of those events comprising:
- 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 optimization;
wherein the software application at least periodically accesses the queue and parses certain ones of events or tokens thereof contained therein at a time of access 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 and 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, or promoted directly out of queue, enabling faster treatment of those events resulting in relief from those events to the queue system load,wherein a measure of disposal time is taken collectively for a number of events of a same media type and summed as one disposal time for the sum of events or representations thereof considered, the sum compared to available resource load before priority state modification to determine if those resources will be unreasonable taxed.
9 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.
-
Citations
30 Claims
-
1. A system for optimizing response time to events or representations thereof waiting in a queue by predicting an estimated disposal time for certain ones of those events comprising:
-
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 optimization; wherein the software application at least periodically accesses the queue and parses certain ones of events or tokens thereof contained therein at a time of access 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 and 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, or promoted directly out of queue, enabling faster treatment of those events resulting in relief from those events to the queue system load, wherein a measure of disposal time is taken collectively for a number of events of a same media type and summed as one disposal time for the sum of events or representations thereof considered, the sum compared to available resource load before priority state modification to determine if those resources will be unreasonable taxed. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A non-transitory computer readable media embodying instructions for execution by a data processing apparatus, the instructions adapting the data processing apparatus for optimizing response time to events or representations thereof waiting in a queue by predicting an estimated disposal time for certain ones of those events, the instructions comprising:
-
determining event type and event state of events or representations thereof; parsing event or represented event data; weighing parsed results against pre-set rules; and changing event or represented event state; wherein, the instructions cause selected events or representations thereof to be modified to reflect a higher priority state and, in some cases. different routing rules, including direct promotion from queue, than those originally assigned to those events due to a determination made that those selected events have a sufficiently high probability of efficient disposal according to an estimated time of disposal for each event or representation thereof, wherein the instructions cause a measure of estimated time of disposal to be taken collectively for a number of events of a same media type and summed as one estimated disposal time for the sum of events or representations thereof considered, the sum being compared to available resource load before priority state modification to determine if those resources will be unreasonably taxed. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)
-
Specification