| Patent application number | Description | Published |
|---|
| 20080275751 | METHOD AND APPARATUS FOR ASSESSING THE STATUS OF WORK WAITING FOR SERVICE - The present invention provides a system and method for assessing the status of work waiting for service in a work queue or a work pool. Work items are placed in the work queue or work pool and have a service time goal. The work items in the work queue or work pool are scanned and a required queue position for each work item is calculated according to the amount of time remaining prior to the expiration of the service time goal and weighted advance time for servicing of work items in the work queue or pool. An array of counters has elements which correspond to required queue positions. Upon the calculation of the required queue position for a work item, the counter corresponding to the required queue position is incremented. When all of the work items are scanned, the array of counters is analyzed to predict a future state of the work queue or work pool. | 11-06-2008 |
| 20080275752 | METHOD AND APPARATUS FOR ASSESSING THE STATUS OF WORK WAITING FOR SERVICE - The present invention provides a system and method for assessing the status of work waiting for service in a work queue or a work pool. Work items are placed in the work queue or work pool and have a service time goal. The work items in the work queue or work pool are scanned and a required queue position for each work item is calculated according to the amount of time remaining prior to the expiration of the service time goal and weighted advance time for servicing of work items in the work queue or pool. An array of counters has elements which correspond to required queue positions. Upon the calculation of the required queue position for a work item, the counter corresponding to the required queue position is incremented. When all of the work items are scanned, the array of counters is analyzed to predict a future state of the work queue or work pool. | 11-06-2008 |
| 20080275766 | METHOD AND APPARATUS FOR ASSESSING THE STATUS OF WORK WAITING FOR SERVICE - The present invention provides a system and method for assessing the status of work waiting for service in a work queue or a work pool. Work items are placed in the work queue or work pool and have a service time goal. The work items in the work queue or work pool are scanned and a required queue position for each work item is calculated according to the amount of time remaining prior to the expiration of the service time goal and weighted advance time for servicing of work items in the work queue or pool. An array of counters has elements which correspond to required queue positions. Upon the calculation of the required queue position for a work item, the counter corresponding to the required queue position is incremented. When all of the work items are scanned, the array of counters is analyzed to predict a future state of the work queue or work pool. | 11-06-2008 |
| 20100278318 | System and Method for Detecting Emotions at Different Steps in a Communication - The system and method establish a communication with a first party. A first emotion is detected during a first step during the communication. Steps in the communication can include: establishing a call, waiting in a queue, talking with an agent, communicating with an IVR system, and the like. A second emotion is detected at a different step in the communication. Alternatively, the first and second emotions are detected in two different but related communications. The detection of the first and/or second emotion determines how to process the communication. Examples of processing a communication can include routing the communication differently, selecting a different script for an agent, selecting a different agent, and the like. In addition, the communication can also be processed differently based on other additional parameters. | 11-04-2010 |
| 20110044320 | MECHANISM FOR FAST EVALUATION OF POLICIES IN WORK ASSIGNMENT - A work item routing mechanism is provided that is capable of employing a state map which compresses routing decisions and results of comparisons into a single bit. Thus, comparisons and determinations made in connection with work item routing are made prior to the routing mechanism receiving a work item. Once a work item is received, the routing mechanism only has to refer to the bit map to see if it is allowed to route the work item to a particular processing resource and if that resource is the best among all candidate processing resources. All of the work item routing decisions can, therefore, be made very quickly thereby reducing processing delay and wait time. | 02-24-2011 |
| 20110047002 | MECHANISM FOR MULTISITE SERVICE STATE DESCRIPTION - A distributed contact center is described and systems, methods, and devices for sharing state information between the various parts of the contact center are provided. Skill state information is condensed into one or several bits such that a message describing the state of multiple skills can be generated and shared with other parts of the contact center. This provides the ability to convey a large amount of state information for a particular site in a multi-site system without consuming a large amount of bandwidth or utilizing a large amount of processing capabilities. | 02-24-2011 |
| 20110071879 | BIDDING WORK ASSIGNMENT ON CONFERENCE/SUBSCRIBE RTP CLEARING HOUSE - A distributed contact center and method of managing tasks within such a contact center is provided. The various sites of the distributed contact center are adapted to bid on contacts by transmitting bids to a work item distribution mechanism via RTP streams, thereby enabling the work item distribution mechanism to analyze the bids in real-time and route the contact accordingly. | 03-24-2011 |
| 20110255681 | BITMAPS FOR NEXT GENERATION CONTACT CENTER - A queueless contact center is described along with various methods and mechanisms for administering the same. The contact center proposed herein provides the ability to, among other things, achieve true one-to-one matching. Solutions are also provided for managing data structures utilized by the queueless contact center. Furthermore, mechanisms for generating traditional queue-based performance views and metrics for the queueless contact center are proposed to help facilitate a smooth transition from traditional queue-based contact centers to the next generation contact centers described herein. | 10-20-2011 |
| 20110255682 | HIGH PERFORMANCE QUEUELESS CONTACT CENTER - A queueless contact center is described along with various methods and mechanisms for administering the same. The contact center proposed herein provides the ability to, among other things, achieve true one-to-one matching. Solutions are also provided for managing data structures utilized by the queueless contact center. Furthermore, mechanisms for generating traditional queue-based performance views and metrics for the queueless contact center are proposed to help facilitate a smooth transition from traditional queue-based contact centers to the next generation contact centers described herein. | 10-20-2011 |
| 20110255683 | ONE-TO-ONE MATCHING IN A CONTACT CENTER - A queueless contact center is described along with various methods and mechanisms for administering the same. The contact center proposed herein provides the ability to, among other things, achieve true one-to-one matching. Solutions are also provided for managing data structures utilized by the queueless contact center. Furthermore, mechanisms for generating traditional queue-based performance views and metrics for the queueless contact center are proposed to help facilitate a smooth transition from traditional queue-based contact centers to the next generation contact centers described herein. | 10-20-2011 |
| 20110255684 | AUTOMATED MECHANISM FOR POPULATING AND MAINTAINING DATA STRUCTURES IN A QUEUELESS CONTACT CENTER - A queueless contact center is described along with various methods and mechanisms for administering the same. The contact center proposed herein provides the ability to, among other things, achieve true one-to-one matching. Solutions are also provided for managing data structures utilized by the queueless contact center. Furthermore, mechanisms for generating traditional queue-based performance views and metrics for the queueless contact center are proposed to help facilitate a smooth transition from traditional queue-based contact centers to the next generation contact centers described herein. | 10-20-2011 |
| 20110255685 | VIEW AND METRICS FOR A QUEUELESS CONTACT CENTER - A queueless contact center is described along with various methods and mechanisms for administering the same. The contact center proposed herein provides the ability to, among other things, achieve true one-to-one matching. Solutions are also provided for managing data structures utilized by the queueless contact center. Furthermore, mechanisms for generating traditional queue-based performance views and metrics for the queueless contact center are proposed to help facilitate a smooth transition from traditional queue-based contact centers to the next generation contact centers described herein. | 10-20-2011 |
