Method and apparatus for optimizing response time to events in queue
View Patent ↗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.
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.
2. The system of claim 1 wherein the first server is a work force management and planning server enhanced with addition of the software application.
3. The system of claim 1 wherein the queue is a virtual message queue for a communication center.
4. The system of claim 1 wherein the queue is a telephony queue.
5. The system of claim 1 wherein the software application includes at least one parsing engine for parsing events.
6. The system of claim 1 wherein the software application includes at least one additional interface to a historical data repository.
7. The system of claim 1 wherein the rules governing the optimization process include rules for generation of token events that represent real events.
8. The system of claim 1 wherein data associated with the parsed event includes event type, event status in queue, event routing information, and event origination information.
9. The system of claim 8 wherein data associated with the parsed event further includes event content or a portion thereof.
10. The system of claim 1 wherein data associated with the parsed event includes event type, event status in queue, event routing information, event origination information, and event purpose information.
11. The system of claim 10 wherein the data associated with the parsed event further includes event content or a portion thereof.
12. The system of claim 1 wherein an original priority status assignment of low below a certain threshold to an event or representation thereof causes the event to be parsed.
13. The system of claim 1 wherein the measure of disposal time determined is an estimate based on known procedure for handling the event.
14. The system of claim 1 wherein the measure of disposal time determined is an estimate based on historical averaging of previous measurements for a same originator of an event of a same type.
15. The system of claim 1 wherein events that are modified to reflect a higher priority state are immediately promoted from the queue to an appropriate final destination queue.
16. The system of claim 1 wherein events that are modified to reflect a higher priority state are immediately routed to their final destinations.
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.
18. The non-transitory computer readable media of claim 17 wherein the queue is a virtual message queue for a communication center.
19. The non-transitory computer readable media of claim 17 wherein the queue is a telephony queue.
20. The non-transitory computer readable media of claim 17 , wherein the instructions include parsing event type, event state, and event content.
21. The non-transitory computer readable media of claim 20 wherein the data parsed includes event routing information, and event origination information.
22. The software application of claim 20 wherein the data parsed includes event purpose information and event content or a portion thereof.
23. The non-transitory computer readable media of claim 17 , wherein the instructions further include interfacing to a historical data repository.
24. The non-transitory computer readable media of claim 17 , wherein a criteria for event selection is all events or representations thereof having a low priority assignment valued below a certain priority threshold.
25. The non-transitory computer readable media of claim 17 , wherein the measure of disposal time determined is an estimate based on known procedure for handling the event.
26. The non-transitory computer readable media of claim 17 , wherein the measure of disposal time determined is an estimate based on historical averaging of previous measurements for a same originator of an event of a same type.
27. The non-transitory computer readable media of claim 17 , wherein events modified to reflect a higher priority state are immediately promoted from the queue to an appropriate final destination queue.
28. The non-transitory computer readable media of claim 17 , wherein events that are modified to reflect a higher priority state are immediately routed to their final destinations.
29. The non-transitory computer readable media of claim 17 , wherein the pre-set rules contain rules sets that are different for different media types.
30. The non-transitory computer readable media of claim 17 , wherein some of the pre-set rules govern content to be included when generating token representation of real events.