CA2479102A1 - Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal - Google Patents
Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal Download PDFInfo
- Publication number
- CA2479102A1 CA2479102A1 CA002479102A CA2479102A CA2479102A1 CA 2479102 A1 CA2479102 A1 CA 2479102A1 CA 002479102 A CA002479102 A CA 002479102A CA 2479102 A CA2479102 A CA 2479102A CA 2479102 A1 CA2479102 A1 CA 2479102A1
- Authority
- CA
- Canada
- Prior art keywords
- service
- work request
- probability
- wat
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1023—Server selection for load balancing based on a hash applied to IP addresses or costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/10015—Access to distributed or replicated servers, e.g. using brokers
Abstract
The present invention is directed to balancing resource loads. In particular, the present invention is directed to assigning work to service locations having the greatest probability of servicing the work within a target time. Because an average wait time is not necessarily equal to a probability of servicing work within a target time, the present invention is useful in meeting service target goals. Because the present invention operates by comparing the probability of a defined set of service locations to one another, absolute probabilities need not be calculated.
Instead, relative probabilities may be used in assigning work.
Instead, relative probabilities may be used in assigning work.
Description
METHOD AND APPARATUS FOR LOAD BALANCllVG WORK ON
A NETWORK OF SERVERS BASED ON THE PROBABILTTY OF
BEING SERVICED WITHIN A SERVICE TIME GOAL .
S FIELD OF THE INVENTION
The present invention is related to a method and apparatus for load balancing work. Tn particular, the present invention is directed to load balancing work based on a relative probability that a server will service work within a predetermined interval.
BACKGROUND OF THE INVENTION
Call centers are systems that enable a pool of agents to serve incoming and/or outgoing calls, with the calls being distributed and connected to whichever of the agents happen to be available at the time. When no agents are free and available to handle additional calls, additional incoming calls are typically placed in a holding queue to await an available agent.
1 S It is common practice to divide the pool of agents into a plurality of groups, commonly referred to as splits, and to assign different types of calls to different splits. For example, different splits may be designated to handle calls pertaining to different client companies, or calls pertaining to different products or services of the same client company. Alternatively, the agents in different splits may have different skills, and calls requiring different ones of these skills are then directed to different ones of these splits. Each split typically has its own incoming call queue.
Furthermore, some large companies find it effective to have a plurality of call centers, each for handling calls within a different geographical area, for example, Each call center, or each split within each call center, typically has its own incoming call queue.
in a multiple queue 2S environment, it can happen that one call center or split is heavily overloaded with calls and has a full queue of calls waiting for an available agent, while another call center or split may be only lightly overloaded and yet another call center or split may not be overloaded at all and actually may have idle agents. To alleviate such inefficiencies, some call centers have implemented a capability whereby, if the primary (preferred) split or call center for handling a particular call is heavily overloaded and its queue is overflowing with waiting calls, the call center evaluates the load of the other (backup) splits or call centers to determine if one of the other splits or call centers is less busy and consequently may be able to handle the overflow call and do so more promptly. The overflow call is then queued to the first such backup split or call center that is found, instead of being queued to the primary split or call center. Such arrangements are known by different names, one being "Look Ahead Interflow."
In order to balance work across a network of call centers, the decision as to where a call should be routed is typically made based on the estimated waiting time that a call will experience with respect to a particular switch. The objective is to find the switch within a network of switches where it is predicted that the call will be answered in the shortest period of time. In situations where an enterprise has contracted with its customers to service calls within a given period of time, sending calls to the switch with the shortest waiting time does not necessarily maximize the number of customers who are serviced within the contracting period.
In particular, although doing so will generally reduce the average waiting time of calls, this is not the same as maximizing the number of calls serviced within the contracted time.
SUMMARY OF THE INVENTION
I 5 The present invention is directed to solving these and other problems and disadvantages of the prior art. Generally, according to the present invention, work (e.g., a call) is routed to a server (e.g., a switch) based on the probability that the work will be serviced within a contracted time interval. In particular, the work may be routed to the server having the highest probability for servicing the work based an the relative probabilities of each server in the network to service the work within a target service time goal. In accordance with another embodiment of the present invention, work may be routed to the server identified as having a sufficient probability of servicing the work within a target service time goal. Accordingly, the present invention is capable of efficiently routing work, and does so without performing a complicated calculation of absolute probability. Instead, only the relative probabilities need to be determined.
In accordance with an embodiment of the present invention, in response to receiving a work request, the probability of servicing the work request within a target time is determined for each server in a network. The server having the greatest determined probability of servicing the work request within the target time, or having a sufficient determined probability of servicing the work request within the target time, is selected, and the work request is assigned to the selected server. In accordance with an embodiment of the present invention, the relative probability that each server will complete the work request within the target time is calculated, rather than an absolute probability, thereby reducing the computational overhead of a method or apparatus in accordance with the present invention.
In accordance with still another embodiment of the present invention, the probability of servicing the work request within a target time is determined for a server by calculating a number of opportunities to service the work request within the target time with respect to the server. If more than one server has a greatest number of opportunities to service the work request within the target time, or if more than one server has a sufficient number of probabilities to service the work request within the target time, vne of the servers may be selected by calculating an advance time metric. For instance, in accordance with an embodiment of the present invention, the server having the lowest expected wait time may be selected. In accordance with another embodiment of the present invention, the server having the lowest weighted advance time trend is selected.
In accordance with another embodiment of the present invention, a load balancing or work allocation apparatus is provided that includes a plurality of service locations. At least one service resource is associated with each of the service locations. In addition, a communication network interface is provided, operable to receive requests. A provided controller assigns the work request received at the communication network interface to the service location having the highest probability or to a service location having a sufficient probability of servicing the work request within a predetermined target time.
These and other advantages and features of the invention will become more apparent from the following description of an illustrative embodiment of the invention taken together with the drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
Fig. 1 is a block diagram of a communication arrangement incorporating a system in accordance with an embodiment of the present invention;
Fig. 2 is a block diagram depicting a switch in accordance with an embodiment of the present invention;
A NETWORK OF SERVERS BASED ON THE PROBABILTTY OF
BEING SERVICED WITHIN A SERVICE TIME GOAL .
S FIELD OF THE INVENTION
The present invention is related to a method and apparatus for load balancing work. Tn particular, the present invention is directed to load balancing work based on a relative probability that a server will service work within a predetermined interval.
BACKGROUND OF THE INVENTION
Call centers are systems that enable a pool of agents to serve incoming and/or outgoing calls, with the calls being distributed and connected to whichever of the agents happen to be available at the time. When no agents are free and available to handle additional calls, additional incoming calls are typically placed in a holding queue to await an available agent.
1 S It is common practice to divide the pool of agents into a plurality of groups, commonly referred to as splits, and to assign different types of calls to different splits. For example, different splits may be designated to handle calls pertaining to different client companies, or calls pertaining to different products or services of the same client company. Alternatively, the agents in different splits may have different skills, and calls requiring different ones of these skills are then directed to different ones of these splits. Each split typically has its own incoming call queue.
Furthermore, some large companies find it effective to have a plurality of call centers, each for handling calls within a different geographical area, for example, Each call center, or each split within each call center, typically has its own incoming call queue.
in a multiple queue 2S environment, it can happen that one call center or split is heavily overloaded with calls and has a full queue of calls waiting for an available agent, while another call center or split may be only lightly overloaded and yet another call center or split may not be overloaded at all and actually may have idle agents. To alleviate such inefficiencies, some call centers have implemented a capability whereby, if the primary (preferred) split or call center for handling a particular call is heavily overloaded and its queue is overflowing with waiting calls, the call center evaluates the load of the other (backup) splits or call centers to determine if one of the other splits or call centers is less busy and consequently may be able to handle the overflow call and do so more promptly. The overflow call is then queued to the first such backup split or call center that is found, instead of being queued to the primary split or call center. Such arrangements are known by different names, one being "Look Ahead Interflow."
In order to balance work across a network of call centers, the decision as to where a call should be routed is typically made based on the estimated waiting time that a call will experience with respect to a particular switch. The objective is to find the switch within a network of switches where it is predicted that the call will be answered in the shortest period of time. In situations where an enterprise has contracted with its customers to service calls within a given period of time, sending calls to the switch with the shortest waiting time does not necessarily maximize the number of customers who are serviced within the contracting period.
In particular, although doing so will generally reduce the average waiting time of calls, this is not the same as maximizing the number of calls serviced within the contracted time.
SUMMARY OF THE INVENTION
I 5 The present invention is directed to solving these and other problems and disadvantages of the prior art. Generally, according to the present invention, work (e.g., a call) is routed to a server (e.g., a switch) based on the probability that the work will be serviced within a contracted time interval. In particular, the work may be routed to the server having the highest probability for servicing the work based an the relative probabilities of each server in the network to service the work within a target service time goal. In accordance with another embodiment of the present invention, work may be routed to the server identified as having a sufficient probability of servicing the work within a target service time goal. Accordingly, the present invention is capable of efficiently routing work, and does so without performing a complicated calculation of absolute probability. Instead, only the relative probabilities need to be determined.
In accordance with an embodiment of the present invention, in response to receiving a work request, the probability of servicing the work request within a target time is determined for each server in a network. The server having the greatest determined probability of servicing the work request within the target time, or having a sufficient determined probability of servicing the work request within the target time, is selected, and the work request is assigned to the selected server. In accordance with an embodiment of the present invention, the relative probability that each server will complete the work request within the target time is calculated, rather than an absolute probability, thereby reducing the computational overhead of a method or apparatus in accordance with the present invention.
In accordance with still another embodiment of the present invention, the probability of servicing the work request within a target time is determined for a server by calculating a number of opportunities to service the work request within the target time with respect to the server. If more than one server has a greatest number of opportunities to service the work request within the target time, or if more than one server has a sufficient number of probabilities to service the work request within the target time, vne of the servers may be selected by calculating an advance time metric. For instance, in accordance with an embodiment of the present invention, the server having the lowest expected wait time may be selected. In accordance with another embodiment of the present invention, the server having the lowest weighted advance time trend is selected.
In accordance with another embodiment of the present invention, a load balancing or work allocation apparatus is provided that includes a plurality of service locations. At least one service resource is associated with each of the service locations. In addition, a communication network interface is provided, operable to receive requests. A provided controller assigns the work request received at the communication network interface to the service location having the highest probability or to a service location having a sufficient probability of servicing the work request within a predetermined target time.
These and other advantages and features of the invention will become more apparent from the following description of an illustrative embodiment of the invention taken together with the drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
Fig. 1 is a block diagram of a communication arrangement incorporating a system in accordance with an embodiment of the present invention;
Fig. 2 is a block diagram depicting a switch in accordance with an embodiment of the present invention;
Fig. 3 is a flow chart depicting the assignment of work based on probability in accordance with an embodiment of the present invention;
Fig. 4 is a flow chart depicting determining a probability in accordance with an embodiment of the present invention; and Fig. 5 is a flow chart depicting the calculation of an advance time metric in accordance with an embodiment of the present invention.
With reference now to Fig.1, a communication arrangement incorporating a system 100 in accordance with the present invention is illustrated. In general, the communication arrangement includes a device requesting service 104 interconnected to a communication network 108. The communication network 108 is in turn connected to a number of switches 112. Associated with each switch I I2 are one or more resources 116, depicted in Fig. 1 as agents. Collectively, a switch 112 and associated resources 116 comprise a service location 120.
I S In accordance with a further embodiment of the present invention, a service Location 120 may comprise a switch 112 and a subset of the associated resources 116 established or functioning as a split. For purposes of this discussion, the term "service location'° is understood to include a split. Accordingly, as can be appreciated by one of skill in the art, a system 100 in accordance with the present invention may be beneficially used to allocate requests for service among splits established with respect to resources I 16 associated with a single switch 1 I2. A system 100 in accordance with the present invention may also include a control 124.
The device requesting service 104 may comprise any device in connection with which a resource 116 is desired or required. Accordingly, a device requesting service 104 may include a telephone or other communication device associated with a user, or a computing or information device associated with a user or operating autonomously.
The communication network 108 may include a public switched telephone network (PSTN), a packet data network such as a local area network, an intranet; or the Internet, or any combination of communication networks.
The switches 112, as will be described in greater detail below, may include servers, including communication servers, such as private branch exchanges or call center servers, including but not limited to automatic call distribution systems. In general, the switches 112 operate to receive requests for service from a requesting device I04 that is delivered to the switch I 12 by the communication network 108. In addition, the switches 112 operate to allocate an appropriate resource 1 I 6 to service the request. In accordance with an embodiment of the present invention, a switch I 12 may function to allocate requests fox service to resources 11 & directly associated with the switch 112, or to resources I 16 assaciated with another switch 112. Accordingly, the functions of the optional control 124 may be incorporated into one or more of the switches 112.
The control 124 may be provided for allocating requests for service among switches 112, or among splits comprising a group of resources I 16 established in connection with one or more switches 112. Furthermore, requests for service may be placed in queues established with respect to each service location I20 or split included in a system 100. A
control I24 may function to calculate the probability that each switch and/or split I I2 that is a candidate for servicing a request will be successful at servicing such request within a target time, as will be described in greater detail below. Alternatively, the function of the control 124 may be performed by a switch I 1 Z incorporating such functionality. In general, the control I24 may comprise a server computer in communication with the switches I I2 either directly or through a network, such as the communication network I08.
With reference now to Fig. 2, a server, such as a switch 112 or a control I24, is illustrated. In general, the server 1 I2, 124 may comprise a general purpose computer server.
For example, the server 112, 124 may comprise a general purpose computer running a WINDOWS operating system. As yet another example, when implemented as a switch 112, the server may comprise a call center server, a telecommunications switch, or a private branch exchange. As shown in Fig. Z, a server I 12, 124 may include a processor 204, memory 208, 2S data storage 2I2, a first network interface 2I6, and optionally a second network interface 220.
The various components 204-220 may be interconnected by a communication bus 224.
The processor 204 may include any processor capable of performing instructions encoded in software. In accordance with another embodiment of the present invention, the processor 204 may comprise a controller or application specific integrated circuit (ASIC) having and capable of performing instructions encoded in logic circuits. The memory 208 may be used to store programs or data, including data comprising a queue or queues, in connection with the running of programs or instructions on the processor 204. The data storage 212 may generally include storage for programs and data. For example, the data storage 212 may store operating system code 224, and various applications, including a probability function application 228 and a work distribution application 232, capable of execution by the processor 204. The first network interface 216 may be provided to interconnect the server 112, 124 to other devices either directly or aver a computer or communication network, such as communication network 108. The server 112, 124 may include an additional network interface 220, for example where the server I 12, I24 functions as a call center switch 112 that serves to interconnect the switch I 12 to the communication network 108 and to service resources 1 I6.
As can be appreciated by one of skill in the art, the actual implementation of a server 112,124 may vary depending on the particular application. For example, a switch 112 that does not compute a relative probability as described herein would not require a probability function application 228. Similarly, a server comprising a control 124 would generally feature only a 1 S single network interface 216. In addition, a server 112, 124 with a processor 204 comprising a controller or other integrated device need not include memory 204 and/or data storage 212 that is separate from the processor 204.
With reference now to Fig. 3, a flow chart depicting the allocation of work to one of a plurality of service locations is illustrated. Initially, at step 300, a work request is received. In general, the work request may be received at a switch I 12, or at a control 124. At step 304, the service locations) 120 at which the probability of servicing the work associated with the received work request within a target time is greatest is determined.
According to another embodiment of the present invention,.the service locations) 120 at which the probability of servicing the work within the target time is sufficient is determined at step 304. A sufficient probability is, according to an embodiment of the present invention, a selected number of opportunities for the work to be served within the target time. For example, three opportunities to service work within the target time may be deemed to represent a "sufficient probability" for servicing the work. The probability that is determined is not required to be an absolute probability. Accordingly, as described in greater detail below, the determination of the service location 120 having the greatest probability for servicing the work within the target time, or the identification of a service location 120 having a sufficient probability of servicing the work within the target time, may be made from the relative probability that an eligible service location 120 will complete the work within the target time.
At step 308, a determination is made as to whether multiple service locations 120 are S determined to have the greatest probability or a sufficient probability of servicing the work within the target time. If only one service location 120 has the greatest probability or a sufficient probability of servicing the work within the target time, that one service location 120 is selected {step 312). If multiple service locations have been determined to have the greatest probability of servicing the work within the target time, (i.e, if the greatest probability is calculated with respect to multiple service locations), or if multiple service locations have a sufficient probability of servicing the work within the target time, the service location 120 having the most favorable advance time metric is selected from the multiple service locations I20 having the greatest or sufficient probability of servicing the work within the target time (step 316). At step 320, the work is assigned to the service location 120 selected at step 3I2 (if only one service location 120 has the greatest probability or a sufficient probability of servicing the work within the target time) or to the service location 120 selected at step 316 as having the most favorable advance time metric (if multiple service locations 120 were determined to have a greatest probability or a sufficient probability of servicing the work within the target time). The process of assigning a work request then ends {step 324), at least until a next service request is received or generated.
With reference now to Fig. 4, the determination of the probability that a service location 120 will be able to service work within a target time relative to other service locations 120 in accordance with an embodiment of the present invention is illustrated.
Initially, at step 400, the estimated wait time (EWT) for a selected service location 120 is calculated.
The estimated wait time may be calculated using various methods known to the art. For example, the estimated wait time may be calculated by determining an average rate of advance for a service location 120, and in particular for a queue established in connection with a service location 120, by multiplying the average rate of advance by the position of the next work request to be received, as described in U.S. Patent No. 5,506,898, the disclosure of which is incorporated herein by reference in its entirety.
Fig. 4 is a flow chart depicting determining a probability in accordance with an embodiment of the present invention; and Fig. 5 is a flow chart depicting the calculation of an advance time metric in accordance with an embodiment of the present invention.
With reference now to Fig.1, a communication arrangement incorporating a system 100 in accordance with the present invention is illustrated. In general, the communication arrangement includes a device requesting service 104 interconnected to a communication network 108. The communication network 108 is in turn connected to a number of switches 112. Associated with each switch I I2 are one or more resources 116, depicted in Fig. 1 as agents. Collectively, a switch 112 and associated resources 116 comprise a service location 120.
I S In accordance with a further embodiment of the present invention, a service Location 120 may comprise a switch 112 and a subset of the associated resources 116 established or functioning as a split. For purposes of this discussion, the term "service location'° is understood to include a split. Accordingly, as can be appreciated by one of skill in the art, a system 100 in accordance with the present invention may be beneficially used to allocate requests for service among splits established with respect to resources I 16 associated with a single switch 1 I2. A system 100 in accordance with the present invention may also include a control 124.
The device requesting service 104 may comprise any device in connection with which a resource 116 is desired or required. Accordingly, a device requesting service 104 may include a telephone or other communication device associated with a user, or a computing or information device associated with a user or operating autonomously.
The communication network 108 may include a public switched telephone network (PSTN), a packet data network such as a local area network, an intranet; or the Internet, or any combination of communication networks.
The switches 112, as will be described in greater detail below, may include servers, including communication servers, such as private branch exchanges or call center servers, including but not limited to automatic call distribution systems. In general, the switches 112 operate to receive requests for service from a requesting device I04 that is delivered to the switch I 12 by the communication network 108. In addition, the switches 112 operate to allocate an appropriate resource 1 I 6 to service the request. In accordance with an embodiment of the present invention, a switch I 12 may function to allocate requests fox service to resources 11 & directly associated with the switch 112, or to resources I 16 assaciated with another switch 112. Accordingly, the functions of the optional control 124 may be incorporated into one or more of the switches 112.
The control 124 may be provided for allocating requests for service among switches 112, or among splits comprising a group of resources I 16 established in connection with one or more switches 112. Furthermore, requests for service may be placed in queues established with respect to each service location I20 or split included in a system 100. A
control I24 may function to calculate the probability that each switch and/or split I I2 that is a candidate for servicing a request will be successful at servicing such request within a target time, as will be described in greater detail below. Alternatively, the function of the control 124 may be performed by a switch I 1 Z incorporating such functionality. In general, the control I24 may comprise a server computer in communication with the switches I I2 either directly or through a network, such as the communication network I08.
With reference now to Fig. 2, a server, such as a switch 112 or a control I24, is illustrated. In general, the server 1 I2, 124 may comprise a general purpose computer server.
For example, the server 112, 124 may comprise a general purpose computer running a WINDOWS operating system. As yet another example, when implemented as a switch 112, the server may comprise a call center server, a telecommunications switch, or a private branch exchange. As shown in Fig. Z, a server I 12, 124 may include a processor 204, memory 208, 2S data storage 2I2, a first network interface 2I6, and optionally a second network interface 220.
The various components 204-220 may be interconnected by a communication bus 224.
The processor 204 may include any processor capable of performing instructions encoded in software. In accordance with another embodiment of the present invention, the processor 204 may comprise a controller or application specific integrated circuit (ASIC) having and capable of performing instructions encoded in logic circuits. The memory 208 may be used to store programs or data, including data comprising a queue or queues, in connection with the running of programs or instructions on the processor 204. The data storage 212 may generally include storage for programs and data. For example, the data storage 212 may store operating system code 224, and various applications, including a probability function application 228 and a work distribution application 232, capable of execution by the processor 204. The first network interface 216 may be provided to interconnect the server 112, 124 to other devices either directly or aver a computer or communication network, such as communication network 108. The server 112, 124 may include an additional network interface 220, for example where the server I 12, I24 functions as a call center switch 112 that serves to interconnect the switch I 12 to the communication network 108 and to service resources 1 I6.
As can be appreciated by one of skill in the art, the actual implementation of a server 112,124 may vary depending on the particular application. For example, a switch 112 that does not compute a relative probability as described herein would not require a probability function application 228. Similarly, a server comprising a control 124 would generally feature only a 1 S single network interface 216. In addition, a server 112, 124 with a processor 204 comprising a controller or other integrated device need not include memory 204 and/or data storage 212 that is separate from the processor 204.
With reference now to Fig. 3, a flow chart depicting the allocation of work to one of a plurality of service locations is illustrated. Initially, at step 300, a work request is received. In general, the work request may be received at a switch I 12, or at a control 124. At step 304, the service locations) 120 at which the probability of servicing the work associated with the received work request within a target time is greatest is determined.
According to another embodiment of the present invention,.the service locations) 120 at which the probability of servicing the work within the target time is sufficient is determined at step 304. A sufficient probability is, according to an embodiment of the present invention, a selected number of opportunities for the work to be served within the target time. For example, three opportunities to service work within the target time may be deemed to represent a "sufficient probability" for servicing the work. The probability that is determined is not required to be an absolute probability. Accordingly, as described in greater detail below, the determination of the service location 120 having the greatest probability for servicing the work within the target time, or the identification of a service location 120 having a sufficient probability of servicing the work within the target time, may be made from the relative probability that an eligible service location 120 will complete the work within the target time.
At step 308, a determination is made as to whether multiple service locations 120 are S determined to have the greatest probability or a sufficient probability of servicing the work within the target time. If only one service location 120 has the greatest probability or a sufficient probability of servicing the work within the target time, that one service location 120 is selected {step 312). If multiple service locations have been determined to have the greatest probability of servicing the work within the target time, (i.e, if the greatest probability is calculated with respect to multiple service locations), or if multiple service locations have a sufficient probability of servicing the work within the target time, the service location 120 having the most favorable advance time metric is selected from the multiple service locations I20 having the greatest or sufficient probability of servicing the work within the target time (step 316). At step 320, the work is assigned to the service location 120 selected at step 3I2 (if only one service location 120 has the greatest probability or a sufficient probability of servicing the work within the target time) or to the service location 120 selected at step 316 as having the most favorable advance time metric (if multiple service locations 120 were determined to have a greatest probability or a sufficient probability of servicing the work within the target time). The process of assigning a work request then ends {step 324), at least until a next service request is received or generated.
With reference now to Fig. 4, the determination of the probability that a service location 120 will be able to service work within a target time relative to other service locations 120 in accordance with an embodiment of the present invention is illustrated.
Initially, at step 400, the estimated wait time (EWT) for a selected service location 120 is calculated.
The estimated wait time may be calculated using various methods known to the art. For example, the estimated wait time may be calculated by determining an average rate of advance for a service location 120, and in particular for a queue established in connection with a service location 120, by multiplying the average rate of advance by the position of the next work request to be received, as described in U.S. Patent No. 5,506,898, the disclosure of which is incorporated herein by reference in its entirety.
At step 404, a determination is made as to whether the estimated wait time is greater than the target service time that has been established. If the estimated wait time at the service location 120 exceeds the target service time, the number of opportunities for servicing a work request within the target time (#OPPS) is set to zero (step 408). If the estimated wait time is not greater than the target service time, the weighted advance time (WAT) fox the queue associated with the service location 120 is calculated (step 412). The weighted advance time is the measure of the average time that is required for a work request to advance one position in the queue.
Accordingly, the weighted advance time may be calculated as a continuously updated average advance time. As can be appreciated by one of ordinary skill in the art, the time period over which advance times are averaged for a queue can be varied.
At step 416, the number of opportunities for work to be serviced within the target time is calculated. In accordance with an embodiment of the present invention, the calculation of opportunities for work to be serviced within the target time is calculated using the algorithm:
#OPPS = ((Target time-EWT)IWAT)+I, where Target time is the target time for servicing the work. The number of opportunities for the queue associated with the service location 120 set or determined at step 408 or step 4I6 is then recorded (step 420).
After recording the calculated number of opportunities for the service location I Z0, a determination is made as to whether queues associated with additional service locations 124 are applicable to the work request (i.e. are eligible) (step 424). If additional service locations 120 are available, the next service location is gotten (step 428) and the system returns to step 400.
If additional service locations are not available, the service location or locations 120 having the greatest number of opportunities to service the work request, or the location or locations 120 having a sufficient probability of servicing the work request, are set equal to the location or locations 120 having the greatest probability (or sufficient probability) of servicing the work request within the target time (step 432). In accordance with an embodiment of the present invention, a service location 120 having a sufficient probability may be identified by comparing a calculated number of opportunities for that service location I20 to a preselected number of opportunities deemed to correspond to a sufficient probability. The process for determining the relative probabilities of service locations 120 then ends (step 436).
Accordingly, the weighted advance time may be calculated as a continuously updated average advance time. As can be appreciated by one of ordinary skill in the art, the time period over which advance times are averaged for a queue can be varied.
At step 416, the number of opportunities for work to be serviced within the target time is calculated. In accordance with an embodiment of the present invention, the calculation of opportunities for work to be serviced within the target time is calculated using the algorithm:
#OPPS = ((Target time-EWT)IWAT)+I, where Target time is the target time for servicing the work. The number of opportunities for the queue associated with the service location 120 set or determined at step 408 or step 4I6 is then recorded (step 420).
After recording the calculated number of opportunities for the service location I Z0, a determination is made as to whether queues associated with additional service locations 124 are applicable to the work request (i.e. are eligible) (step 424). If additional service locations 120 are available, the next service location is gotten (step 428) and the system returns to step 400.
If additional service locations are not available, the service location or locations 120 having the greatest number of opportunities to service the work request, or the location or locations 120 having a sufficient probability of servicing the work request, are set equal to the location or locations 120 having the greatest probability (or sufficient probability) of servicing the work request within the target time (step 432). In accordance with an embodiment of the present invention, a service location 120 having a sufficient probability may be identified by comparing a calculated number of opportunities for that service location I20 to a preselected number of opportunities deemed to correspond to a sufficient probability. The process for determining the relative probabilities of service locations 120 then ends (step 436).
The method generally set forth in connection with the flow chart shown in Fig.
4 is suitable for use in connection with step 304 of Fig. 3.
With reference now to Fig. 5, the calculation of an advance time metric in accordance with an embodiment of the present invention is illustrated. In particular, Fig. 5 illustrates a method for calculating an advance time metric comprising a weighted advance time trend, and can be used to select a single service location 120 from a number of service locations 120 in connection with step 316 of Fig. 3. Initially, at step 500, the weighted advance time for a service location 120 is calculated. In general, the calculation of the weighted advance time for a particular service location 120 will have been performed as part of determining the relative IO probability that the service location 120 will complete a work request within the target time.
Accordingly, the WAT may be received at step 500. At step 504, the WAT change is calculated.
The WAT change rnay be calculated as: WAT Change = (WATn - WAT" -,)I WAT" -,.
For example, if at time'n-I' WAT=10, and then at time'n' WAT=9, WAT Change = (9-10)/10 =
0.1. A negative number means that WAT is trending downwards, by a ratio of 0.1 in this case.
1 S That is, the WAT has become I O% smaller. At step 508, the WAT trend is calculated. The WAT trend is an exponential moving average of the WAT changes. The WAT trend may be calculated as WAT Trend= (x*WAT Trend"_,} + ((1-x)*WAT Change) where x is a constant such as 0.9. In other words, WAT Trend is an exponential moving average, which determines if WAT is trending downward or upwards and at what rate. If WAT is trending downwards, this 20 is a positive sign that conditions may be improving for this service location 120. All other things being equal, a service location 120 that is showing the best signs of improvement is preferred. Next, the calculated WAT Trend for the service location 120 is recorded (step S 12).
At step 516, a determination is made as to whether additional service locations 120 are available.
For example, a determination of whether an additional service location having a greatest or 25 sufficient probability of completing work within the target time is available may be made. If an additional service location I20 is available, the system gets the next service location 120 (step S20) and returns to step 500. If an additional service Location 120 is not available, the service location I20 having the lowest calculated WAT Trend is set equal to the service location 120 having the most favorable advance time metric (step S24). The process for determining an 30 advance time metric then ends (step S28).
4 is suitable for use in connection with step 304 of Fig. 3.
With reference now to Fig. 5, the calculation of an advance time metric in accordance with an embodiment of the present invention is illustrated. In particular, Fig. 5 illustrates a method for calculating an advance time metric comprising a weighted advance time trend, and can be used to select a single service location 120 from a number of service locations 120 in connection with step 316 of Fig. 3. Initially, at step 500, the weighted advance time for a service location 120 is calculated. In general, the calculation of the weighted advance time for a particular service location 120 will have been performed as part of determining the relative IO probability that the service location 120 will complete a work request within the target time.
Accordingly, the WAT may be received at step 500. At step 504, the WAT change is calculated.
The WAT change rnay be calculated as: WAT Change = (WATn - WAT" -,)I WAT" -,.
For example, if at time'n-I' WAT=10, and then at time'n' WAT=9, WAT Change = (9-10)/10 =
0.1. A negative number means that WAT is trending downwards, by a ratio of 0.1 in this case.
1 S That is, the WAT has become I O% smaller. At step 508, the WAT trend is calculated. The WAT trend is an exponential moving average of the WAT changes. The WAT trend may be calculated as WAT Trend= (x*WAT Trend"_,} + ((1-x)*WAT Change) where x is a constant such as 0.9. In other words, WAT Trend is an exponential moving average, which determines if WAT is trending downward or upwards and at what rate. If WAT is trending downwards, this 20 is a positive sign that conditions may be improving for this service location 120. All other things being equal, a service location 120 that is showing the best signs of improvement is preferred. Next, the calculated WAT Trend for the service location 120 is recorded (step S 12).
At step 516, a determination is made as to whether additional service locations 120 are available.
For example, a determination of whether an additional service location having a greatest or 25 sufficient probability of completing work within the target time is available may be made. If an additional service location I20 is available, the system gets the next service location 120 (step S20) and returns to step 500. If an additional service Location 120 is not available, the service location I20 having the lowest calculated WAT Trend is set equal to the service location 120 having the most favorable advance time metric (step S24). The process for determining an 30 advance time metric then ends (step S28).
In accordance with another embodiment of the present invention, the advance time metric used to select one of a number of service locations 120 having a greatest probability, or a sufficient probability, for servicing the work within the target service time at step 316 of Fag.
3 is the estimated wait time associated with each service location. In particular, the work is assigned to the service Location 120 included among the service locations 120 determined to have the greatest or a sufficient probability with the lowest estimated wait time. According to such an embodiment, at step 316 of Fig. 3, the service location I20 having the lowest expected wait time is selected from the service locations 120 having the greatest or a sufficient probability of servicing the work within the target time.
I 0 As can be appreciated from the foregoing description, multiple service locations 120 may be determined to have a greatest probability of servicing work within a target time period if more than one service location 120 is determined to have the highest calculated probability.
Thus, in connection with embodiments of the present invention in which relative probability is calculated as a number of opportunities to complete work within a target time period, multiple service locations 120 have the highest probability if they have the same highest number of opportunities. For example, if a first service location is determined to have three opportunities;
a second service location 120 is also determined to have three opportunities, and a third and final service location 120 is determined to have two opportunities, the first and second service locations 120 each have the same greatest probability of servicing the work within the target time:
As can also be appreciated from the foregoing description, multiple service locations 120 may be determined to have a cuff dent probability of servicing work within a target time if the calculated number of opportunities exceeds a number preselected as being sufficient. For example, if three opportunities to service work within a target time is selected as representing 2S a sufficient probability that the work will be serviced within the target time, and a first service location I20 is determined to have four opportunities, a second service location 120 is determined to have three opportunities, and a third and final service location 120 is determined to have two opportunities, the first and second service locations 120 both have a sufficient probability of servicing the work within the target time.
The foregoing discussion of the invention has been presented for purposes of illustration and description. Further, the description is not intended to limit the invention to the form disclosed herein. Consequently, variations and modifications commensurate with the above teachings, within the skill and knowledge of the relevant art, are within the scope of the present S invention. The embodiments described hereinabove are further intended to explain the best mode presently known ofpracticing the invention and to enable others skilled in the art to utilize the invention in such or in other embodiments and with various modifications required by their particular application or use of the invention. It is intended that the appended claims be construed to include the alternative embodiments to the extent permitted by the prior art.
3 is the estimated wait time associated with each service location. In particular, the work is assigned to the service Location 120 included among the service locations 120 determined to have the greatest or a sufficient probability with the lowest estimated wait time. According to such an embodiment, at step 316 of Fig. 3, the service location I20 having the lowest expected wait time is selected from the service locations 120 having the greatest or a sufficient probability of servicing the work within the target time.
I 0 As can be appreciated from the foregoing description, multiple service locations 120 may be determined to have a greatest probability of servicing work within a target time period if more than one service location 120 is determined to have the highest calculated probability.
Thus, in connection with embodiments of the present invention in which relative probability is calculated as a number of opportunities to complete work within a target time period, multiple service locations 120 have the highest probability if they have the same highest number of opportunities. For example, if a first service location is determined to have three opportunities;
a second service location 120 is also determined to have three opportunities, and a third and final service location 120 is determined to have two opportunities, the first and second service locations 120 each have the same greatest probability of servicing the work within the target time:
As can also be appreciated from the foregoing description, multiple service locations 120 may be determined to have a cuff dent probability of servicing work within a target time if the calculated number of opportunities exceeds a number preselected as being sufficient. For example, if three opportunities to service work within a target time is selected as representing 2S a sufficient probability that the work will be serviced within the target time, and a first service location I20 is determined to have four opportunities, a second service location 120 is determined to have three opportunities, and a third and final service location 120 is determined to have two opportunities, the first and second service locations 120 both have a sufficient probability of servicing the work within the target time.
The foregoing discussion of the invention has been presented for purposes of illustration and description. Further, the description is not intended to limit the invention to the form disclosed herein. Consequently, variations and modifications commensurate with the above teachings, within the skill and knowledge of the relevant art, are within the scope of the present S invention. The embodiments described hereinabove are further intended to explain the best mode presently known ofpracticing the invention and to enable others skilled in the art to utilize the invention in such or in other embodiments and with various modifications required by their particular application or use of the invention. It is intended that the appended claims be construed to include the alternative embodiments to the extent permitted by the prior art.
Claims (34)
1. A method for balancing resource loads, comprising:
receiving a work request;
determining for each of a plurality of service locations a probability of servicing said work request within a target time;
selecting at least a first service location having at least one of a greatest determined probability of servicing said work request within said target time and a sufficient determined probability of servicing said work request within said target time; and assigning said work request to said selected service location.
receiving a work request;
determining for each of a plurality of service locations a probability of servicing said work request within a target time;
selecting at least a first service location having at least one of a greatest determined probability of servicing said work request within said target time and a sufficient determined probability of servicing said work request within said target time; and assigning said work request to said selected service location.
2. The method of Claim 1, wherein said step of selecting at least a first service location comprises selecting at least a first service location having a sufficient determined probability of servicing said work request within said target time.
3. The method of Claim 1, wherein said step of selecting at least a first service location comprises selecting at least a first service location having a greatest determined probability of servicing said work request within said target time.
4. The method of Claim 1, wherein said step of determining for each of a plurality of service locations a probability of servicing said work request within a target time comprises determining a relative probability of servicing said work request within a target time.
5. The method of Claim 1, wherein said probability of servicing said work request within a target time is determined for a service location by calculating a number of opportunities to service said work request within said target time by said service location.
6. The method of Claim 5, wherein selecting at least a first service location comprises selecting at least a first service location having at least a selected minimum number of opportunities to service said work request within said target time.
7. The method of Claim 5, wherein said step of selecting at least a first service location comprises selecting at least a first service location having a greatest number of opportunities to service said work request within said target time.
8. The method of Claim 5, wherein said number of opportunities (#OPPS) is calculated as #OPPS=((Target time-EWT)/WAT)+1, where EWT is the estimated wait time for a work request assigned to said service location, and where WAT is the weighted advance time for a work request assigned to said service location.
9. The method of Claim 5, further comprising, in response to more than one service location having a greatest calculated number of opportunities to service said work request within said target time, calculating an advance time metric.
10. The method of Claim 9, wherein said advance time metric comprises an expected wait time, wherein said step of selecting comprises selecting a location having a lowest expected wait time.
11. The method of Claim 9, wherein said advance time metric comprises a weighted advance time trend, wherein said step of selecting comprises selecting a location having a lowest weighted advance time trend.
12. The method of Claim 11, wherein said weighted advance time trend (WAT_Trend) is calculated as WAT_Trend n = (x*WAT_Trend n-1,) + ((1-x)*WAT_Change), where x is a constant, and where the WAT_Change is calculated as WAT_Change=(WAT n-WAT n-1)/WAT n-1.
13. The method of Claim 1, wherein each of said service locations is associated with a queue capable of containing a plurality of work requests.
14. The method of Claim 1, wherein said service location comprise at least one split.
15. The method of Claim 1, further comprising:
selecting a target time for completing a work request.
selecting a target time for completing a work request.
16. A load-balancing apparatus, comprising:
means for receiving a work request;
means for calculating a probability that a service location is capable of servicing said work request within a target time;
means for selecting a service location having at least one of a highest probability of servicing said work request within said target time and a sufficient probability of servicing said work request within said target time; and means for allocating said work request to said selected service location.
means for receiving a work request;
means for calculating a probability that a service location is capable of servicing said work request within a target time;
means for selecting a service location having at least one of a highest probability of servicing said work request within said target time and a sufficient probability of servicing said work request within said target time; and means for allocating said work request to said selected service location.
17. The apparatus of Claim 16, wherein said service location is associated with a queue and comprises at least one associated resource.
18. The apparatus of Claim 16, wherein said service location comprises a split.
19. The apparatus of Claim 16, further comprising means for calculating an advance time metric.
20. A work allocation apparatus, comprising:
a plurality of service locations;
a plurality of service resources, wherein at least a one of said service resources is associated with each of said service locations;
a communication network interface, operable to receive work requests; and a controller, wherein a work request received at said communication network interface is assigned to a service location having at least one of a highest probability of servicing said work request within a predetermined target time and a sufficient probability of servicing said work request within a predetermined target time.
a plurality of service locations;
a plurality of service resources, wherein at least a one of said service resources is associated with each of said service locations;
a communication network interface, operable to receive work requests; and a controller, wherein a work request received at said communication network interface is assigned to a service location having at least one of a highest probability of servicing said work request within a predetermined target time and a sufficient probability of servicing said work request within a predetermined target time.
21. The apparatus of Claim 20, wherein said service resources comprise service agents.
22. The apparatus of Claim 20, wherein said service resources are organized into splits.
23. The apparatus of Claim 20, wherein said work request is associated with a request for assistance.
24. The apparatus of Claim 20, wherein said communication network interface is interconnected to at least one of an Internet protocol network and a public switched telephone network.
25. The apparatus of Claim 20, wherein said service locations each comprise a server.
26. A computational component for performing a method, the method comprising:
receiving a work request;
calculating for each of a plurality of service locations a probability that said work request will receive service within a target time period;
selecting at least one a one of said plurality of service locations having at least one of a greatest probability of servicing said work request within said target time period and a sufficient probability of servicing said work request within said target time period; and assigning said work request to one of said selected service locations.
receiving a work request;
calculating for each of a plurality of service locations a probability that said work request will receive service within a target time period;
selecting at least one a one of said plurality of service locations having at least one of a greatest probability of servicing said work request within said target time period and a sufficient probability of servicing said work request within said target time period; and assigning said work request to one of said selected service locations.
27. The method of Claim 26, wherein said step of calculating a probability comprises calculating a relative probability.
28. The method of Claim 29, wherein said calculated probability comprises a calculated number of opportunities that a service location will have to service said work request within said target time period.
29. The method of Claim 28, wherein said number of opportunities (#OPP) is given by: #OPP=((Target time-EWT)/WAT)+1, where EWT is an expected wait time for said service location, and where WAT is a weighted advance time for said service location.
30. The method of Claim 26, further comprising:
in response to a number of service locations having an equal calculated probability, calculating an advance time metric for each of said number of service locations.
in response to a number of service locations having an equal calculated probability, calculating an advance time metric for each of said number of service locations.
31. The method of Claim 30, wherein said calculating an advance time metric comprises:
calculating a weighted advance time;
calculating a weighted advance time change;
calculating a weighted advance time trend; and wherein said step of selecting a one of said plurality of service locations comprises selecting a service location with a lowest calculated weighted advance time trend.
calculating a weighted advance time;
calculating a weighted advance time change;
calculating a weighted advance time trend; and wherein said step of selecting a one of said plurality of service locations comprises selecting a service location with a lowest calculated weighted advance time trend.
32. The method of Claim 31, wherein said weighted advance time change (WAT_Change) is given by WAT_Change=(WAT n-WAT n-1)/WAT n-1, where WAT n is the weighted advance time most recently calculated, and where WAT n-1 is a previously calculated weighted advance time, wherein said weighted advance time trend (WAT_Trend) is given by WAT_Trend n=(x*WAT_Trend n-1) + ((1-x)*WAT_Change), where x is a constant.
33. The method of Claim 30, wherein said calculating an advance time metric comprises calculating an estimated waiting time.
34. The method of Claim 26, further comprising:
selecting a target time for servicing a work request.
selecting a target time for servicing a work request.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/673,118 US7770175B2 (en) | 2003-09-26 | 2003-09-26 | Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal |
US10/673,118 | 2003-09-26 |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2479102A1 true CA2479102A1 (en) | 2005-03-26 |
Family
ID=34194883
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002479102A Abandoned CA2479102A1 (en) | 2003-09-26 | 2004-08-25 | Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal |
Country Status (5)
Country | Link |
---|---|
US (1) | US7770175B2 (en) |
EP (1) | EP1519535B1 (en) |
JP (1) | JP4379805B2 (en) |
CA (1) | CA2479102A1 (en) |
DE (1) | DE602004009732T2 (en) |
Families Citing this family (47)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7415417B2 (en) * | 2002-03-15 | 2008-08-19 | Avaya Technology Corp. | Presence awareness agent |
US8094804B2 (en) | 2003-09-26 | 2012-01-10 | Avaya Inc. | Method and apparatus for assessing the status of work waiting for service |
US20050071212A1 (en) * | 2003-09-26 | 2005-03-31 | Flockhart Andrew D. | Method and apparatus for business time computation in a resource allocation system |
US7770175B2 (en) | 2003-09-26 | 2010-08-03 | Avaya Inc. | Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal |
US8000989B1 (en) | 2004-03-31 | 2011-08-16 | Avaya Inc. | Using true value in routing work items to resources |
US7953859B1 (en) * | 2004-03-31 | 2011-05-31 | Avaya Inc. | Data model of participation in multi-channel and multi-party contacts |
US7734032B1 (en) | 2004-03-31 | 2010-06-08 | Avaya Inc. | Contact center and method for tracking and acting on one and done customer contacts |
GB2412980A (en) * | 2004-04-07 | 2005-10-12 | Hewlett Packard Development Co | A method of distributing load amongst two or more computer system resources |
US7620159B2 (en) * | 2004-05-12 | 2009-11-17 | AT&T Intellectual I, L.P. | System, method and software for transitioning between speech-enabled applications using action-object matrices |
US8122201B1 (en) | 2004-09-21 | 2012-02-21 | Emc Corporation | Backup work request processing by accessing a work request of a data record stored in global memory |
US7529724B1 (en) * | 2004-09-21 | 2009-05-05 | Emc Corporation | Servicing work requests between units of a storage device |
US8234141B1 (en) | 2004-09-27 | 2012-07-31 | Avaya Inc. | Dynamic work assignment strategies based on multiple aspects of agent proficiency |
US7949123B1 (en) * | 2004-09-28 | 2011-05-24 | Avaya Inc. | Wait time predictor for long shelf-life work |
US7809127B2 (en) | 2005-05-26 | 2010-10-05 | Avaya Inc. | Method for discovering problem agent behaviors |
US7853953B2 (en) * | 2005-05-27 | 2010-12-14 | International Business Machines Corporation | Methods and apparatus for selective workload off-loading across multiple data centers |
US7779042B1 (en) | 2005-08-08 | 2010-08-17 | Avaya Inc. | Deferred control of surrogate key generation in a distributed processing architecture |
US7881450B1 (en) | 2005-09-15 | 2011-02-01 | Avaya Inc. | Answer on hold notification |
US7822587B1 (en) | 2005-10-03 | 2010-10-26 | Avaya Inc. | Hybrid database architecture for both maintaining and relaxing type 2 data entity behavior |
US7752230B2 (en) * | 2005-10-06 | 2010-07-06 | Avaya Inc. | Data extensibility using external database tables |
US20070143460A1 (en) * | 2005-12-19 | 2007-06-21 | International Business Machines Corporation | Load-balancing metrics for adaptive dispatching of long asynchronous network requests |
US8238541B1 (en) | 2006-01-31 | 2012-08-07 | Avaya Inc. | Intent based skill-set classification for accurate, automatic determination of agent skills |
US8737173B2 (en) * | 2006-02-24 | 2014-05-27 | Avaya Inc. | Date and time dimensions for contact center reporting in arbitrary international time zones |
US8046281B1 (en) | 2006-07-13 | 2011-10-25 | United Services Automobile Association (Usaa) | System and method for automating initial claim assignment |
US7936867B1 (en) | 2006-08-15 | 2011-05-03 | Avaya Inc. | Multi-service request within a contact center |
US8391463B1 (en) | 2006-09-01 | 2013-03-05 | Avaya Inc. | Method and apparatus for identifying related contacts |
US8811597B1 (en) | 2006-09-07 | 2014-08-19 | Avaya Inc. | Contact center performance prediction |
US8938063B1 (en) | 2006-09-07 | 2015-01-20 | Avaya Inc. | Contact center service monitoring and correcting |
US8767944B1 (en) | 2007-01-03 | 2014-07-01 | Avaya Inc. | Mechanism for status and control communication over SIP using CODEC tunneling |
WO2009012087A2 (en) * | 2007-07-13 | 2009-01-22 | Plumchoice, Inc. | Systems and methods for distributing remote technical support via a centralized service |
US8804941B2 (en) | 2007-07-13 | 2014-08-12 | Plumchoice, Inc. | Systems and methods for hybrid delivery of remote and local technical support via a centralized service |
US8504534B1 (en) | 2007-09-26 | 2013-08-06 | Avaya Inc. | Database structures and administration techniques for generalized localization of database items |
US8127032B2 (en) * | 2007-10-18 | 2012-02-28 | International Business Machines Corporation | Performance sampling in distributed systems |
US8856182B2 (en) | 2008-01-25 | 2014-10-07 | Avaya Inc. | Report database dependency tracing through business intelligence metadata |
US8116237B2 (en) | 2008-09-26 | 2012-02-14 | Avaya Inc. | Clearing house for publish/subscribe of status data from distributed telecommunications systems |
US8964958B2 (en) | 2009-05-20 | 2015-02-24 | Avaya Inc. | Grid-based contact center |
US20110044320A1 (en) * | 2009-08-21 | 2011-02-24 | Avaya Inc. | Mechanism for fast evaluation of policies in work assignment |
US8644491B2 (en) * | 2009-08-21 | 2014-02-04 | Avaya Inc. | Mechanism for multisite service state description |
US8385533B2 (en) | 2009-09-21 | 2013-02-26 | Avaya Inc. | Bidding work assignment on conference/subscribe RTP clearing house |
US8565386B2 (en) * | 2009-09-29 | 2013-10-22 | Avaya Inc. | Automatic configuration of soft phones that are usable in conjunction with special-purpose endpoints |
US9468755B2 (en) * | 2009-09-30 | 2016-10-18 | Respicardia, Inc. | Medical lead with preformed bias |
US9516069B2 (en) * | 2009-11-17 | 2016-12-06 | Avaya Inc. | Packet headers as a trigger for automatic activation of special-purpose softphone applications |
US9128771B1 (en) * | 2009-12-08 | 2015-09-08 | Broadcom Corporation | System, method, and computer program product to distribute workload |
US8306212B2 (en) * | 2010-02-19 | 2012-11-06 | Avaya Inc. | Time-based work assignments in automated contact distribution |
US8903080B2 (en) * | 2011-06-17 | 2014-12-02 | Avaya Inc. | Goal-based estimated wait time |
US20130003797A1 (en) * | 2011-06-30 | 2013-01-03 | Industrial Technology Research Institute | Universal modem system and the manufacturing method thereof |
US8675860B2 (en) | 2012-02-16 | 2014-03-18 | Avaya Inc. | Training optimizer for contact center agents |
TWI698797B (en) * | 2017-09-08 | 2020-07-11 | 高睿辰 | Real-time interpreting system, server system, real-time interpreting device, methods and non-transitory computer readable recording medium |
Family Cites Families (243)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4163124A (en) | 1978-07-24 | 1979-07-31 | Rolm Corporation | Finite storage-time queue |
US4389400A (en) | 1982-03-25 | 1983-06-21 | Chevron Research Company | 2,2-Bis(haloalkenyl)-1-substituted-1-cyanoethylene fungicides |
US4567323A (en) * | 1983-07-12 | 1986-01-28 | At&T Bell Laboratories | Method and apparatus for providing a plurality of special services |
US4737983A (en) * | 1985-10-02 | 1988-04-12 | American Telephone And Telegraph Company Communications, Inc. | Automatic call distributor telephone service |
US5644727A (en) * | 1987-04-15 | 1997-07-01 | Proprietary Financial Products, Inc. | System for the operation and management of one or more financial accounts through the use of a digital communication and computation system for exchange, investment and borrowing |
US4797911A (en) * | 1987-06-16 | 1989-01-10 | Inventions, Inc. | Customer account online servicing system |
US4894857A (en) * | 1987-06-16 | 1990-01-16 | Inuentions Inc. | Method and apparatus for customer account servicing |
US6044205A (en) * | 1996-02-29 | 2000-03-28 | Intermind Corporation | Communications system for transferring information between memories according to processes transferred with the information |
US5001710A (en) * | 1989-10-24 | 1991-03-19 | At&T Bell Laboratories | Customer programmable automated integrated voice/data technique for communication systems |
CA2027799A1 (en) * | 1989-11-03 | 1991-05-04 | David A. Miller | Method and apparatus for independently resetting processors and cache controllers in multiple processor systems |
US5274700A (en) | 1989-11-27 | 1993-12-28 | Unifi Communications Corporation | Methods of automatically rerouting an incoming telephone call placed over a network |
US5155761A (en) | 1990-01-26 | 1992-10-13 | Intervoice, Inc. | Automatic call back system and method of operation |
US5101425A (en) * | 1990-08-07 | 1992-03-31 | Digital Systems International, Inc. | Operations monitoring system |
EP0670094A1 (en) * | 1990-11-20 | 1995-09-06 | Teloquent Communications Corporation | Telephone call handling system |
US5291550A (en) * | 1990-12-26 | 1994-03-01 | At&T Bell Laboratories | Dynamic network call distributor |
US5206903A (en) * | 1990-12-26 | 1993-04-27 | At&T Bell Laboratories | Automatic call distribution based on matching required skills with agents skills |
US5164983A (en) | 1991-01-28 | 1992-11-17 | American Telephone & Telegraph Company | Telemarketing complex performance management system |
US5097528A (en) | 1991-02-25 | 1992-03-17 | International Business Machines Corporation | System for integrating telephony data with data processing systems |
US5278898A (en) * | 1991-05-30 | 1994-01-11 | Davox Corporation | System for managing a hold queue |
US5210789A (en) * | 1991-06-28 | 1993-05-11 | International Telecharge, Inc. | Interactive telephone operator terminal |
US5749079A (en) * | 1992-03-04 | 1998-05-05 | Singapore Computer Systems Limited | End user query facility including a query connectivity driver |
US5642515A (en) | 1992-04-17 | 1997-06-24 | International Business Machines Corporation | Network server for local and remote resources |
US5504894A (en) * | 1992-04-30 | 1996-04-02 | International Business Machines Corporation | Workload manager for achieving transaction class response time goals in a multiprocessing system |
WO1994000945A1 (en) | 1992-06-25 | 1994-01-06 | Teledata Solutions, Inc. | Call distributor |
US6173052B1 (en) | 1992-06-25 | 2001-01-09 | Apropros Technology | Blending communications in a call center |
US5444774A (en) | 1992-06-26 | 1995-08-22 | At&T Corp. | Interactive queuing sytem for call centers |
US5309513A (en) * | 1992-07-02 | 1994-05-03 | Rockwell International Corporation | Telephone system with ubiquitous agents |
US5684964A (en) | 1992-07-30 | 1997-11-04 | Teknekron Infoswitch Corporation | Method and system for monitoring and controlling the performance of an organization |
EP0587290B1 (en) * | 1992-07-30 | 2000-01-26 | Teknekron Infoswitch Corporation | Method and system for monitoring and/or controlling the performance of an organization |
US5469504A (en) | 1992-10-14 | 1995-11-21 | Blaha; David L. | Automatic call distribution with intersubnetwork customer information transfer system and method |
US5335268A (en) | 1992-10-22 | 1994-08-02 | Mci Communications Corporation | Intelligent routing of special service telephone traffic |
CA2102868C (en) | 1992-11-11 | 1999-10-26 | Joseph E. Bloom | Device for programming script sets in a telephone system |
GB2273025B (en) | 1992-11-12 | 1997-03-26 | Rockwell International Corp | Automatic call distributor with a programmable data window display system and method |
US5355269A (en) | 1992-11-16 | 1994-10-11 | Allsop, Inc. | Cleaning apparatus for a cassette player |
CA2103204C (en) | 1992-11-17 | 2002-11-12 | Daniel F. Baker | Call distributor with automatic preannouncement system and method |
JPH06232982A (en) * | 1993-02-02 | 1994-08-19 | Fujitsu Ltd | Distribution control system for incoming call |
US5937051A (en) | 1993-07-08 | 1999-08-10 | Teknekron Infoswitch Corporation | Method and system for transferring calls and call-related data between a plurality of call centers |
US5499386A (en) | 1993-07-09 | 1996-03-12 | Telefonaktiebolaget L M Ericsson | Best server selection in layered cellular radio system |
US5469503A (en) | 1993-07-27 | 1995-11-21 | Aspect Telecommunications Corporation | Method for resynchronizing secondary database and primary database with preservation of functionality of an automatic call distribution system |
US5594726A (en) * | 1993-09-17 | 1997-01-14 | Scientific-Atlanta, Inc. | Frequency agile broadband communications system |
AU693462B2 (en) | 1993-09-22 | 1998-07-02 | E-Talk Corporation | Method and system for automatically monitoring the performance quality of call center service representatives |
US5390243A (en) * | 1993-11-01 | 1995-02-14 | At&T Corp. | Telemarketing complex with automatic threshold levels |
US5436965A (en) | 1993-11-16 | 1995-07-25 | Automated Systems And Programming, Inc. | Method and system for optimization of telephone contact campaigns |
US5963911A (en) | 1994-03-25 | 1999-10-05 | British Telecommunications Public Limited Company | Resource allocation |
US5473773A (en) | 1994-04-04 | 1995-12-05 | International Business Machines Corporation | Apparatus and method for managing a data processing system workload according to two or more distinct processing goals |
US5537542A (en) | 1994-04-04 | 1996-07-16 | International Business Machines Corporation | Apparatus and method for managing a server workload according to client performance goals in a client/server data processing system |
US5537470A (en) | 1994-04-06 | 1996-07-16 | At&T Corp. | Method and apparatus for handling in-bound telemarketing calls |
US5519773A (en) | 1994-06-07 | 1996-05-21 | Siemens Colm Communications Inc. | Call sharing for inbound and outbound call center agents |
US5506898A (en) * | 1994-07-12 | 1996-04-09 | At&T Corp. | Expected wait-time indication arrangement |
US5592378A (en) * | 1994-08-19 | 1997-01-07 | Andersen Consulting Llp | Computerized order entry system and method |
US5682460A (en) | 1994-08-29 | 1997-10-28 | Motorola, Inc. | Method for selecting transmission preferences |
US5530744A (en) | 1994-09-20 | 1996-06-25 | At&T Corp. | Method and system for dynamic customized call routing |
US5611076A (en) * | 1994-09-21 | 1997-03-11 | Micro Data Base Systems, Inc. | Multi-model database management system engine for databases having complex data models |
US5594791A (en) | 1994-10-05 | 1997-01-14 | Inventions, Inc. | Method and apparatus for providing result-oriented customer service |
US5752027A (en) * | 1994-11-30 | 1998-05-12 | Dun & Bradstreet Software Services, Inc. | Apparatus and process for creating and accessing a database centric object |
US5546452A (en) | 1995-03-02 | 1996-08-13 | Geotel Communications Corp. | Communications system using a central controller to control at least one network and agent system |
ATE330416T1 (en) | 1995-04-24 | 2006-07-15 | Ibm | METHOD AND APPARATUS FOR SKILL-BASED ROUTING IN A CALL CENTER |
US5748468A (en) * | 1995-05-04 | 1998-05-05 | Microsoft Corporation | Prioritized co-processor resource manager and method |
US5606361A (en) * | 1995-05-10 | 1997-02-25 | Davidsohn; John | Videophone interactive mailbox facility system and method of processing information |
US5603029A (en) * | 1995-06-07 | 1997-02-11 | International Business Machines Corporation | System of assigning work requests based on classifying into an eligible class where the criteria is goal oriented and capacity information is available |
US5751707A (en) * | 1995-06-19 | 1998-05-12 | Bell Atlantic Network Services, Inc. | AIN interaction through wireless digital video network |
US5627884A (en) | 1995-06-26 | 1997-05-06 | Williams; Mark J. | Method for returning inbound calls |
US5790677A (en) | 1995-06-29 | 1998-08-04 | Microsoft Corporation | System and method for secure electronic commerce transactions |
JPH11510004A (en) * | 1995-07-19 | 1999-08-31 | フジツウ ネットワーク コミュニケーションズ,インコーポレイテッド | Point-to-multipoint transmission using subqueues |
US5684872A (en) | 1995-07-21 | 1997-11-04 | Lucent Technologies Inc. | Prediction of a caller's motivation as a basis for selecting treatment of an incoming call |
CA2181781C (en) * | 1995-07-26 | 2000-02-29 | Seiji Iwafune | Television system for providing interactive television programs and server system for constructing the television system |
US5884032A (en) * | 1995-09-25 | 1999-03-16 | The New Brunswick Telephone Company, Limited | System for coordinating communications via customer contact channel changing system using call centre for setting up the call between customer and an available help agent |
US5742675A (en) * | 1995-09-26 | 1998-04-21 | Telefonaktiebolaget Lm Ericsson | Method and apparatus for automatically distributing calls to available logged-in call handling agents |
US6430282B1 (en) | 1995-09-29 | 2002-08-06 | Nortel Networks Limited | Methods and apparatus for originating voice calls |
US5703943A (en) | 1995-10-16 | 1997-12-30 | Lucent Technologies, Inc. | Completion of calls to a preferred agent in an automatic call distributor |
US5754841A (en) * | 1995-10-20 | 1998-05-19 | Ncr Corporation | Method and apparatus for parallel execution of user-defined functions in an object-relational database management system |
US5794250A (en) | 1995-10-20 | 1998-08-11 | Ncr Corporation | Method and apparatus for extending existing database management system for new data types |
US5689698A (en) | 1995-10-20 | 1997-11-18 | Ncr Corporation | Method and apparatus for managing shared data using a data surrogate and obtaining cost parameters from a data dictionary by evaluating a parse tree object |
US5930786A (en) | 1995-10-20 | 1999-07-27 | Ncr Corporation | Method and apparatus for providing shared data to a requesting client |
US6175564B1 (en) * | 1995-10-25 | 2001-01-16 | Genesys Telecommunications Laboratories, Inc | Apparatus and methods for managing multiple internet protocol capable call centers |
US5915012A (en) | 1997-01-14 | 1999-06-22 | Genesys, Telecommunications Laboratories, Inc. | System and method for operating a plurality of call centers |
US6625139B2 (en) | 1995-10-25 | 2003-09-23 | Genesys Telecommunications Laboratories, Inc. | Apparatus and methods for coordinating internet protocol telephone and data communications |
US5926538A (en) | 1997-02-11 | 1999-07-20 | Genesys Telecommunications Labs, Inc | Method for routing calls to call centers based on statistical modeling of call behavior |
US6021428A (en) | 1997-09-15 | 2000-02-01 | Genesys Telecommunications Laboratories, Inc. | Apparatus and method in improving e-mail routing in an internet protocol network telephony call-in-center |
US5754639A (en) * | 1995-11-03 | 1998-05-19 | Lucent Technologies | Method and apparatus for queuing a call to the best split |
US5740238A (en) * | 1995-11-03 | 1998-04-14 | Lucent Technologies Inc. | Method and apparatus for queuing a call to the best backup split |
US6560707B2 (en) | 1995-11-06 | 2003-05-06 | Xerox Corporation | Multimedia coordination system |
US5802282A (en) | 1995-12-28 | 1998-09-01 | Intel Corporation | Recovering missing data during background data transfer in multipoint conferencing |
US5754776A (en) * | 1995-12-28 | 1998-05-19 | Intel Corporation | Re-prioritizing background data transfers in multipoint conferencing |
US5757904A (en) * | 1996-02-05 | 1998-05-26 | Lucent Technologies Inc. | Context-sensitive presentation of information to call-center agents |
US5973756A (en) | 1996-02-06 | 1999-10-26 | Fca Corporation | IR Transmitter with integral magnetic-stripe ATM type credit card reader & method therefor |
US5838968A (en) | 1996-03-01 | 1998-11-17 | Chromatic Research, Inc. | System and method for dynamic resource management across tasks in real-time operating systems |
US5901214A (en) * | 1996-06-10 | 1999-05-04 | Murex Securities, Ltd. | One number intelligent call processing system |
US5915010A (en) * | 1996-06-10 | 1999-06-22 | Teknekron Infoswitch | System, method and user interface for data announced call transfer |
US6064730A (en) * | 1996-06-18 | 2000-05-16 | Lucent Technologies Inc. | Customer-self routing call center |
US5721770A (en) | 1996-07-02 | 1998-02-24 | Lucent Technologies Inc. | Agent vectoring programmably conditionally assigning agents to various tasks including tasks other than handling of waiting calls |
US6052723A (en) * | 1996-07-25 | 2000-04-18 | Stockmaster.Com, Inc. | Method for aggregate control on an electronic network |
US6385646B1 (en) | 1996-08-23 | 2002-05-07 | At&T Corp. | Method and system for establishing voice communications in an internet environment |
US6240471B1 (en) * | 1996-09-10 | 2001-05-29 | The United States Of America As Represented By The Secretary Of The Air Force | Data transfer interfacing |
US5903877A (en) * | 1996-09-30 | 1999-05-11 | Lucent Technologies Inc. | Transaction center for processing customer transaction requests from alternative media sources |
US5897622A (en) * | 1996-10-16 | 1999-04-27 | Microsoft Corporation | Electronic shopping and merchandising system |
US5796393A (en) | 1996-11-08 | 1998-08-18 | Compuserve Incorporated | System for intergrating an on-line service community with a foreign service |
GB9700798D0 (en) | 1997-01-16 | 1997-03-05 | Int Computers Ltd | Digital system simulation |
US6055308A (en) * | 1997-01-21 | 2000-04-25 | Genesys Telecommunications Laboratories, Inc. | Method and system for determining and using multiple object states in a computer telephony integration system |
US5828747A (en) | 1997-01-28 | 1998-10-27 | Lucent Technologies Inc. | Call distribution based on agent occupancy |
US5903641A (en) | 1997-01-28 | 1999-05-11 | Lucent Technologies Inc. | Automatic dynamic changing of agents' call-handling assignments |
US6044144A (en) * | 1997-02-07 | 2000-03-28 | Mci Communications Corp. | Network call parking manager |
US5946387A (en) | 1997-02-10 | 1999-08-31 | Genesys Telecommunications Laboratories, Inc, | Agent-level network call routing |
US6185292B1 (en) * | 1997-02-10 | 2001-02-06 | Genesys Telecommunications Laboratories, Inc. | Skill-based real-time call routing in telephony systems |
US5940496A (en) | 1997-02-10 | 1999-08-17 | Gewesys Telecommunications Laboratories, Inc. | Apparatus and methods enhancing call routing within and between call-centers |
US20010040887A1 (en) | 1997-10-09 | 2001-11-15 | Yuri Shtivelman | Apparatus and methods enhancing call routing to and within call-centers |
US5982873A (en) | 1997-03-07 | 1999-11-09 | Lucent Technologies Inc. | Waiting-call selection based on objectives |
US5905793A (en) * | 1997-03-07 | 1999-05-18 | Lucent Technologies Inc. | Waiting-call selection based on anticipated wait times |
US6134318A (en) | 1997-03-19 | 2000-10-17 | At&T Corp | System and method for telemarketing through a hypertext network |
US5948065A (en) | 1997-03-28 | 1999-09-07 | International Business Machines Corporation | System for managing processor resources in a multisystem environment in order to provide smooth real-time data streams while enabling other types of applications to be processed concurrently |
US5974462A (en) | 1997-03-28 | 1999-10-26 | International Business Machines Corporation | Method and apparatus for controlling the number of servers in a client/server system |
US5960073A (en) | 1997-04-03 | 1999-09-28 | Genesys Telecommunications Laboratories , Inc. | Method and apparatus for providing an interactive home agent with access to call center functionality and resources |
US5996013A (en) | 1997-04-30 | 1999-11-30 | International Business Machines Corporation | Method and apparatus for resource allocation with guarantees |
US6049547A (en) * | 1997-05-15 | 2000-04-11 | Lucent Technologies Inc. | Lookahead interflow of traffic among a plurality of serving sites of one customer |
US5901215A (en) * | 1997-05-20 | 1999-05-04 | Rockwell Semiconductor Systems, Inc. | Apparatus and method for identifying records of overflowed ACD calls |
US6263359B1 (en) | 1997-05-22 | 2001-07-17 | International Business Machines Corporation | Computer resource proportional utilization and response time scheduling |
US6259969B1 (en) | 1997-06-04 | 2001-07-10 | Nativeminds, Inc. | System and method for automatically verifying the performance of a virtual robot |
US5974135A (en) | 1997-06-11 | 1999-10-26 | Harrah's Operating Company, Inc. | Teleservices computer system, method, and manager application for integrated presentation of concurrent interactions with multiple terminal emulation sessions |
US5937402A (en) | 1997-06-19 | 1999-08-10 | Ontos, Inc. | System for enabling access to a relational database from an object oriented program |
US5941983A (en) | 1997-06-24 | 1999-08-24 | Hewlett-Packard Company | Out-of-order execution using encoded dependencies between instructions in queues to determine stall values that control issurance of instructions from the queues |
US5987117A (en) | 1997-07-07 | 1999-11-16 | Mitel Corporation | Method of dynamic load sharing between systems with automatic telephone call distributors |
US6044355A (en) * | 1997-07-09 | 2000-03-28 | Iex Corporation | Skills-based scheduling for telephone call centers |
US6023681A (en) | 1997-08-11 | 2000-02-08 | At&T Corp. | Method and apparatus for predicting queuing delays |
US6052685A (en) | 1997-08-13 | 2000-04-18 | Mosaix, Inc. | Integration of legacy database management systems with ODBC-compliant application programs |
US6038293A (en) * | 1997-09-03 | 2000-03-14 | Mci Communications Corporation | Method and system for efficiently transferring telephone calls |
US6000832A (en) | 1997-09-24 | 1999-12-14 | Microsoft Corporation | Electronic online commerce card with customer generated transaction proxy number for online transactions |
US6490350B2 (en) | 1997-09-30 | 2002-12-03 | Mci Communications Corporation | Monitoring system for telephony resources in a call center |
US6084954A (en) | 1997-09-30 | 2000-07-04 | Lucent Technologies Inc. | System and method for correlating incoming and outgoing telephone calls using predictive logic |
US6363411B1 (en) | 1998-08-05 | 2002-03-26 | Mci Worldcom, Inc. | Intelligent network |
US6229819B1 (en) * | 1997-10-21 | 2001-05-08 | Mci Communications Corporation | Advanced intelligent network gateway |
US5999963A (en) | 1997-11-07 | 1999-12-07 | Lucent Technologies, Inc. | Move-to-rear list scheduling |
US6088441A (en) | 1997-12-17 | 2000-07-11 | Lucent Technologies Inc. | Arrangement for equalizing levels of service among skills |
US6704409B1 (en) * | 1997-12-31 | 2004-03-09 | Aspect Communications Corporation | Method and apparatus for processing real-time transactions and non-real-time transactions |
US6115462A (en) | 1998-01-09 | 2000-09-05 | Gte Laboratories Incorporated | Method and apparatus for efficient call routing |
US6192122B1 (en) * | 1998-02-12 | 2001-02-20 | Avaya Technology Corp. | Call center agent selection that optimizes call wait times |
US6426950B1 (en) | 1998-02-13 | 2002-07-30 | Nortel Networks Limited | Method of resource management at computer controlled telephony hardware |
US6801520B2 (en) | 1998-02-17 | 2004-10-05 | Genesys Telecommunications Laboratories, Inc. | Queue prioritization based on competitive user input |
US6449358B1 (en) | 1998-02-17 | 2002-09-10 | Genesys Telecommunications Laboratories, Inc. | Method for predicting and managing call load by determining the optimum frequency of outbound call generation during an out-bound calling campaign from a call center |
US5943416A (en) | 1998-02-17 | 1999-08-24 | Genesys Telecommunications Laboratories, Inc. | Automated survey control routine in a call center environment |
US6226377B1 (en) * | 1998-03-06 | 2001-05-01 | Avaya Technology Corp. | Prioritized transaction server allocation |
US6230183B1 (en) * | 1998-03-11 | 2001-05-08 | International Business Machines Corporation | Method and apparatus for controlling the number of servers in a multisystem cluster |
US6278777B1 (en) | 1998-03-12 | 2001-08-21 | Ser Solutions, Inc. | System for managing agent assignments background of the invention |
US6154769A (en) | 1998-03-27 | 2000-11-28 | Hewlett-Packard Company | Scheduling server requests to decrease response time and increase server throughput |
US6173053B1 (en) * | 1998-04-09 | 2001-01-09 | Avaya Technology Corp. | Optimizing call-center performance by using predictive data to distribute calls among agents |
US6650748B1 (en) | 1998-04-13 | 2003-11-18 | Avaya Technology Corp. | Multiple call handling in a call center |
US6449356B1 (en) | 1998-05-26 | 2002-09-10 | Rockwell Semiconductor Systems, Inc. | Method of multi-media transaction processing |
US6292550B1 (en) | 1998-06-01 | 2001-09-18 | Avaya Technology Corp. | Dynamic call vectoring |
US6233332B1 (en) | 1998-06-03 | 2001-05-15 | Avaya Technology Corp. | System for context based media independent communications processing |
US6526397B2 (en) | 1998-06-19 | 2003-02-25 | Nortel Networks Limited | Resource management facilitation |
US6011844A (en) * | 1998-06-19 | 2000-01-04 | Callnet Communications | Point-of-presence call center management system |
US6389400B1 (en) * | 1998-08-20 | 2002-05-14 | Sbc Technology Resources, Inc. | System and methods for intelligent routing of customer requests using customer and agent models |
US6535601B1 (en) * | 1998-08-27 | 2003-03-18 | Avaya Technology Corp. | Skill-value queuing in a call center |
US6272544B1 (en) | 1998-09-08 | 2001-08-07 | Avaya Technology Corp | Dynamically assigning priorities for the allocation of server resources to completing classes of work based upon achievement of server level goals |
US6937993B1 (en) | 1998-09-16 | 2005-08-30 | Mci, Inc. | System and method for processing and tracking telecommunications service orders |
US6178441B1 (en) * | 1998-09-21 | 2001-01-23 | International Business Machines Corporation | Method and system in a computer network for the reliable and consistent ordering of client requests |
US6295353B1 (en) | 1998-10-07 | 2001-09-25 | Avaya Technology Corp. | Arrangement for efficiently updating status information of a network call-routing system |
US6449646B1 (en) | 1998-10-13 | 2002-09-10 | Aspect Communications Corporation | Method and apparatus for allocating mixed transaction type messages to resources via an integrated queuing mechanism |
US6064731A (en) * | 1998-10-29 | 2000-05-16 | Lucent Technologies Inc. | Arrangement for improving retention of call center's customers |
US7068775B1 (en) | 1998-12-02 | 2006-06-27 | Concerto Software, Inc. | System and method for managing a hold queue based on customer information retrieved from a customer database |
US6275812B1 (en) | 1998-12-08 | 2001-08-14 | Lucent Technologies, Inc. | Intelligent system for dynamic resource management |
US6356632B1 (en) * | 1998-12-31 | 2002-03-12 | Avaya Technology Corp. | Call selection and agent selection in a call center based on agent staffing schedule |
US7406098B2 (en) | 1999-01-13 | 2008-07-29 | Qualcomm Incorporated | Resource allocation in a communication system supporting application flows having quality of service requirements |
US6434230B1 (en) | 1999-02-02 | 2002-08-13 | Avaya Technology Corp. | Rules-based queuing of calls to call-handling resources |
US6560649B1 (en) | 1999-02-10 | 2003-05-06 | Avaya Technology Corp. | Hierarchical service level remediation for competing classes based upon achievement of service level goals |
US7200219B1 (en) * | 1999-02-10 | 2007-04-03 | Avaya Technology Corp. | Dynamically allocating server resources to competing classes of work based upon achievement of service goals |
US6584191B1 (en) | 1999-08-27 | 2003-06-24 | Aspect Communications Corporation | Staffing-based percentage-allocation routing using real-time data |
US6366668B1 (en) * | 1999-03-11 | 2002-04-02 | Avaya Technology Corp. | Method of routing calls in an automatic call distribution network |
US6424709B1 (en) | 1999-03-22 | 2002-07-23 | Rockwell Electronic Commerce Corp. | Skill-based call routing |
US7133520B1 (en) | 1999-04-27 | 2006-11-07 | Rockwell Electronic Commerce Technologies, Llc | Dynamic skill-based call routing |
US6487290B1 (en) * | 1999-04-28 | 2002-11-26 | Periphonics Corporation | Call routing based on local status evaluation |
US6560329B1 (en) | 1999-04-29 | 2003-05-06 | Teloquent Communications Corporation | Automated call routing system |
US6687257B1 (en) * | 1999-08-12 | 2004-02-03 | Rockwell Automation Technologies, Inc. | Distributed real-time operating system providing dynamic guaranteed mixed priority scheduling for communications and processing |
US6151571A (en) | 1999-08-31 | 2000-11-21 | Andersen Consulting | System, method and article of manufacture for detecting emotion in voice signals through analysis of a plurality of voice signal parameters |
US6480826B2 (en) * | 1999-08-31 | 2002-11-12 | Accenture Llp | System and method for a telephonic emotion detection that provides operator feedback |
US6697457B2 (en) * | 1999-08-31 | 2004-02-24 | Accenture Llp | Voice messaging system that organizes voice messages based on detected emotion |
US6463415B2 (en) | 1999-08-31 | 2002-10-08 | Accenture Llp | 69voice authentication system and method for regulating border crossing |
US6427137B2 (en) * | 1999-08-31 | 2002-07-30 | Accenture Llp | System, method and article of manufacture for a voice analysis system that detects nervousness for preventing fraud |
US6275806B1 (en) | 1999-08-31 | 2001-08-14 | Andersen Consulting, Llp | System method and article of manufacture for detecting emotion in voice signals by utilizing statistics for voice signal parameters |
US7222075B2 (en) | 1999-08-31 | 2007-05-22 | Accenture Llp | Detecting emotions using voice signal analysis |
US6353810B1 (en) * | 1999-08-31 | 2002-03-05 | Accenture Llp | System, method and article of manufacture for an emotion detection system improving emotion recognition |
US6389028B1 (en) * | 1999-09-24 | 2002-05-14 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for providing estimated response-wait-time displays for data network-based inquiries to a communication center |
US6463346B1 (en) | 1999-10-08 | 2002-10-08 | Avaya Technology Corp. | Workflow-scheduling optimization driven by target completion time |
US20020010608A1 (en) * | 1999-10-08 | 2002-01-24 | Scott Faber | System for provding services in real-time overthe internet |
US6389132B1 (en) * | 1999-10-13 | 2002-05-14 | Avaya Technology Corp. | Multi-tasking, web-based call center |
US7035808B1 (en) * | 1999-10-20 | 2006-04-25 | Avaya Technology Corp. | Arrangement for resource and work-item selection |
US6587831B1 (en) | 1999-10-21 | 2003-07-01 | Workforce Logistics Inc. | System and method for online scheduling and shift management |
US6748414B1 (en) * | 1999-11-15 | 2004-06-08 | International Business Machines Corporation | Method and apparatus for the load balancing of non-identical servers in a network environment |
US6535600B1 (en) * | 1999-12-06 | 2003-03-18 | Avaya Technology Corp. | System for automatically routing calls to call center agents in an agent surplus condition based on service levels |
US6614903B1 (en) | 1999-12-15 | 2003-09-02 | Avaya Technology Corp. | Methods and apparatus for service state-based processing of communications in a call center |
US6563920B1 (en) | 1999-12-15 | 2003-05-13 | Avaya Technology Corp. | Methods and apparatus for processing of communications in a call center based on variable rest period determinations |
US6718330B1 (en) * | 1999-12-16 | 2004-04-06 | Ncr Corporation | Predictive internet automatic work distributor (Pre-IAWD) and proactive internet automatic work distributor (Pro-IAWD) |
US6636598B1 (en) | 2000-01-24 | 2003-10-21 | Avaya Technology Corp. | Automated transaction distribution system and method implementing transaction distribution to unavailable agents |
US6970829B1 (en) | 2000-02-14 | 2005-11-29 | Iex Corporation | Method and system for skills-based planning and scheduling in a workforce contact center environment |
US20020029213A1 (en) * | 2000-02-17 | 2002-03-07 | Roumen Borissov | Method and system for resource allocation |
US6714643B1 (en) * | 2000-02-24 | 2004-03-30 | Siemens Information & Communication Networks, Inc. | System and method for implementing wait time estimation in automatic call distribution queues |
US6956941B1 (en) * | 2000-04-12 | 2005-10-18 | Austin Logistics Incorporated | Method and system for scheduling inbound inquiries |
US6754333B1 (en) | 2000-04-27 | 2004-06-22 | Avaya Technology Corp. | Wait time prediction arrangement for non-real-time customer contacts |
US7047192B2 (en) | 2000-06-28 | 2006-05-16 | Poirier Darrell A | Simultaneous multi-user real-time speech recognition system |
US7103173B2 (en) * | 2001-07-09 | 2006-09-05 | Austin Logistics Incorporated | System and method for preemptive goals based routing of contact records |
US7929562B2 (en) | 2000-11-08 | 2011-04-19 | Genesis Telecommunications Laboratories, Inc. | Method and apparatus for optimizing response time to events in queue |
US6822945B2 (en) | 2000-11-08 | 2004-11-23 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for anticipating and planning communication-center resources based on evaluation of events waiting in a communication center master queue |
US6766014B2 (en) | 2001-01-09 | 2004-07-20 | Avaya Technology Corp. | Customer service by batch |
US6546087B2 (en) * | 2001-02-16 | 2003-04-08 | Siemens Information & Communication Networks, Inc. | Method and system for enabling queue camp-on for skills-based routing |
US6970554B1 (en) | 2001-03-05 | 2005-11-29 | Verizon Corporate Services Group Inc. | System and method for observing calls to a call center |
EP1246097A1 (en) | 2001-03-29 | 2002-10-02 | BRITISH TELECOMMUNICATIONS public limited company | Work allocation system |
JP2002297900A (en) | 2001-03-30 | 2002-10-11 | Ibm Japan Ltd | Control system for reception by businesses, user side terminal device, reception side terminal device, management server queue monitoring device, method of allocating reception side terminals, and storage medium |
US8601492B2 (en) | 2001-03-31 | 2013-12-03 | Siebel Systems, Inc. | User interface for multi-channel communication |
US7478051B2 (en) * | 2001-04-02 | 2009-01-13 | Illah Nourbakhsh | Method and apparatus for long-range planning |
US7346532B2 (en) * | 2001-05-10 | 2008-03-18 | Hitachi, Ltd. | Workflow system |
GB2391984A (en) * | 2001-05-17 | 2004-02-18 | Bay Bridge Decision Technologi | System and method for generating forecasts and analysis of contact center behaviour for planning purposes |
US6766013B2 (en) | 2001-06-05 | 2004-07-20 | Avaya Technology Corp. | Timely shut-down of a real-time work center |
US8416943B2 (en) | 2001-07-31 | 2013-04-09 | Aspect Software, Inc. | System and method for distributing customer contacts |
US7072966B1 (en) | 2001-08-14 | 2006-07-04 | Etalk Corporation | Skills-based routing of a communication session |
US6856680B2 (en) | 2001-09-24 | 2005-02-15 | Rockwell Electronic Commerce Technologies, Llc | Contact center autopilot algorithms |
US6772202B2 (en) | 2001-11-28 | 2004-08-03 | Gamespy Industries, Inc. | Queuing system, method and computer program product for network data transfer |
US6947543B2 (en) | 2002-01-03 | 2005-09-20 | Avaya Technology Corp. | Computer-telephony integration that uses features of an automatic call distribution system |
US7013344B2 (en) * | 2002-01-09 | 2006-03-14 | International Business Machines Corporation | Massively computational parallizable optimization management system and method |
WO2003067497A1 (en) | 2002-02-04 | 2003-08-14 | Cataphora, Inc | A method and apparatus to visually present discussions for data mining purposes |
US20030169870A1 (en) | 2002-03-05 | 2003-09-11 | Michael Stanford | Automatic call distribution |
US7023979B1 (en) * | 2002-03-07 | 2006-04-04 | Wai Wu | Telephony control system with intelligent call routing |
US7372952B1 (en) | 2002-03-07 | 2008-05-13 | Wai Wu | Telephony control system with intelligent call routing |
US7035927B2 (en) | 2002-03-12 | 2006-04-25 | Avaya Technology Corp. | Intelligent inbound/outbound communications blending |
US7127058B2 (en) | 2002-03-27 | 2006-10-24 | Nortel Networks Limited | Managing communications in a call center |
US6968509B1 (en) | 2002-06-05 | 2005-11-22 | Microsoft Corporation | Recording of user-driven events within a computer application |
US20040010437A1 (en) * | 2002-06-29 | 2004-01-15 | Kiran Ali Sukru | Method and system for scheduling and sharing a pool of resources across multiple distributed forecasted workloads |
AU2003263957A1 (en) | 2002-08-16 | 2004-03-03 | Nuasis Corporation | Contact center architecture |
US7272223B2 (en) | 2002-10-23 | 2007-09-18 | Nortel Networks Limited | Multi-media contact center |
US7142666B1 (en) | 2002-10-31 | 2006-11-28 | International Business Machines Corporation | Method and apparatus for selectively disabling a communication device |
US7418094B2 (en) | 2003-01-06 | 2008-08-26 | Genesys Telecommunications Laboratories, Inc. | Method and apparatus for multimedia interaction routing according to agent capacity sets |
US7472159B2 (en) | 2003-05-15 | 2008-12-30 | International Business Machines Corporation | System and method for adaptive admission control and resource management for service time guarantees |
WO2004107119A2 (en) * | 2003-05-27 | 2004-12-09 | Planmatics, Inc. | System and method for preference scheduling of staffing resources |
US7372857B1 (en) | 2003-05-28 | 2008-05-13 | Cisco Technology, Inc. | Methods and apparatus for scheduling tasks |
US7050566B2 (en) | 2003-06-13 | 2006-05-23 | Assurant, Inc. | Call processing system |
US20050013428A1 (en) * | 2003-07-17 | 2005-01-20 | Walters James Frederick | Contact center optimization program |
US7158628B2 (en) * | 2003-08-20 | 2007-01-02 | Knowlagent, Inc. | Method and system for selecting a preferred contact center agent based on agent proficiency and performance and contact center state |
US7770175B2 (en) | 2003-09-26 | 2010-08-03 | Avaya Inc. | Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal |
US8094804B2 (en) | 2003-09-26 | 2012-01-10 | Avaya Inc. | Method and apparatus for assessing the status of work waiting for service |
US20050129212A1 (en) | 2003-12-12 | 2005-06-16 | Parker Jane S. | Workforce planning system incorporating historic call-center related data |
US7551602B2 (en) | 2003-12-19 | 2009-06-23 | At&T Intellectual Property I, L.P. | Resource assignment in a distributed environment |
US7539297B2 (en) | 2003-12-19 | 2009-05-26 | At&T Intellectual Property I, L.P. | Generation of automated recommended parameter changes based on force management system (FMS) data analysis |
US20050135601A1 (en) | 2003-12-19 | 2005-06-23 | Whitman Raymond Jr. | Force management automatic call distribution and resource allocation control system |
US8738412B2 (en) * | 2004-07-13 | 2014-05-27 | Avaya Inc. | Method and apparatus for supporting individualized selection rules for resource allocation |
US7668303B2 (en) | 2004-08-31 | 2010-02-23 | Aspect Software, Inc. | Call tracking using SIP presence mechanism |
-
2003
- 2003-09-26 US US10/673,118 patent/US7770175B2/en active Active
-
2004
- 2004-08-25 CA CA002479102A patent/CA2479102A1/en not_active Abandoned
- 2004-09-03 DE DE602004009732T patent/DE602004009732T2/en active Active
- 2004-09-03 EP EP04255373A patent/EP1519535B1/en not_active Expired - Fee Related
- 2004-09-27 JP JP2004278927A patent/JP4379805B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
JP2005108231A (en) | 2005-04-21 |
US20050071844A1 (en) | 2005-03-31 |
EP1519535A1 (en) | 2005-03-30 |
DE602004009732T2 (en) | 2008-03-06 |
EP1519535B1 (en) | 2007-10-31 |
US7770175B2 (en) | 2010-08-03 |
DE602004009732D1 (en) | 2007-12-13 |
JP4379805B2 (en) | 2009-12-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7770175B2 (en) | Method and apparatus for load balancing work on a network of servers based on the probability of being serviced within a service time goal | |
JP4445121B2 (en) | A system that automatically routes calls to call center agents based on agent occupancy in surplus agent situations | |
CA2326613C (en) | System for automatically predicting call center agent work time in a multi-skilled agent environment | |
KR100931413B1 (en) | System for automatically routing calls to call center agents in an agent surplus condition based on delay probabilities | |
EP1107559B1 (en) | System for automatically routing calls to call center agents in an agent surplus condition based on service levels | |
AU785106B2 (en) | Multi-site responsibility-based routing | |
JP3350435B2 (en) | Item selection method | |
JP3607435B2 (en) | Call distribution system and call distribution method | |
US5740238A (en) | Method and apparatus for queuing a call to the best backup split | |
JP2001217939A (en) | Method and system for processing communication in call center based on decision of variable pause period | |
JPH11317814A (en) | Configuration for uniforming inter-skill service level | |
WO2012106225A1 (en) | Methods and apparatus for managing interaction processing | |
US6973176B1 (en) | Method and apparatus for rotating auto reserve agents |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued |