CA2233452C - Customer queuing arrangement - Google Patents
Customer queuing arrangement Download PDFInfo
- Publication number
- CA2233452C CA2233452C CA002233452A CA2233452A CA2233452C CA 2233452 C CA2233452 C CA 2233452C CA 002233452 A CA002233452 A CA 002233452A CA 2233452 A CA2233452 A CA 2233452A CA 2233452 C CA2233452 C CA 2233452C
- Authority
- CA
- Canada
- Prior art keywords
- time
- call
- queue
- server
- customer
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/523—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing with call distribution or queueing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/487—Arrangements for providing information services, e.g. recorded voice services or time announcements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/523—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing with call distribution or queueing
- H04M3/5238—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing with call distribution or queueing with waiting time or load prediction arrangements
Abstract
In a customer queuing system of the kind in which telephone calls are received on one port (2) of a switching system (1) for handling by servers attached to output ports (3) of the switching system, a queuing system (8) estimates the waiting time which may be expected at each customer arriving at an input port (2) and utilises a voice announcement system (5) to inform callers during the queue of the estimated waiting period prior to connection to one of the servers.
Description
CA 022334~2 1998-03-27 GUSTQMFR nUFUlNG ARRANGF VIFI~IT
The present invention relates to a customer queuing arrangement and more particularly to such an arrangement for use in providing telecommunicationsservices.
Many organisations such as mail order companies, banks, repair companies, information providers and emergency service providers have many more telephone access lines than they have operators available to handle calls.
This is a more efficient way of handling telephone access requirements since 10 operators are not idle while awaiting the next incoming call as would be the case if the number of operators and number of lines were equal. Further, at peak times, customers calling the service do not have to re-dial when lines are particularlybusy.
It has become customary for an automated answering system to pick up 15 calls after a short period of ringing in order to re-assure the customer that they are connected to an appropriate service centre. Usually a message is transmitted suGh as "Please hold the line. You are held in a queue. One of our operators will answer your call as soon as possible." Music or other entertainment may be provided subsequent to the message or ring tone re-instated. After a period, often around20 one minute, the message is repeated or another message is transmitted.
Some companies, notably in the United States of America, have introduced a "telephone radio show" in which customers joining a tele-sales queue are entertained by a disc jockey or comedian who periodically advises on the length of the queue and indicates the overall waiting time based on the duration of 25 the wait experienced by the most recently answered caller.
Such systems are helpful in avoiding lost calls to the destination but can lead to customer frustration if the wait is lengthy and the same message is repeated. This may result in lost business if the customer hangs up before beingpassed to an operator and subsequently calls again thus rejoining the queue.
The present invention seeks to overcome some of the above problems by providing a call queuing system in which the information provided is more specifically tailored to each customer's position in the queue.
CA 022334~2 1998-03-27 According to one aspect of the present invention there is provided in a customer queuing arrangement a method of estimating an approximate time for which a customer in a queue may be required to wait for a server comprising the steps of determining the position of each customer in the queue, determining for5 each of a plurality of active servers an average time to handle a customer, determining from the start time at which each active server last connected with a current customer the anticipated time at which such server will become availableto obtain a series of times of anticipated availability of active servers and nominally allocating each customer in the queue to one of the series of times 10 whereby the approximate waiting time for each customer may be determined.
A preferred method of the invention comprises estlmating an approximate time for which a designated customer in a queue of customers may be required to wait for a server comprising the steps of determining the number of customers tN) in the queue to be served before the designated customer, calculating the average 15 handling time for each of a plurality of servers to handle a customer connection to provide a mean service time (S), and multiplying the number of customers N by the mean service time S and dividing by the number of active servers (n) to obtain await time (W).
Preferably the calculated wait time W also includes an estimate of the 20 period at which the next server will become avaiiable. A further improvement of the calculated wait time may be obtained by comparing previously calculated waittimes with actual wait times to derive a weighting factor adjustment for use in subsequent calculations of wait times.
Additionally, where customers may fall into differing categories a 25 respective mean service time may be determined for each of such categories and used in the calculation of wait time.
According to a second aspect of the invention there is provided a-call queuing system comprising switch means having a plurality of input ports for connection to incoming telephone lines, a plurality of primary output ports for 30 connection to telephone handling servers, control means responsive to calls on the input ports to selectively effect connections through the switch means to one the output ports, the control means also being arranged to determine which, if any, of the output ports is not currently connected to an input port and to effect -CA 022334~2 1998-03-27 W O 97tl5136 PCT/GB96/02~20 connections sequentially to the output ports, the switch means further having atleast one secondary output port to which calls arriving at the input ports are switched if none of the primary output ports are available, said secondary output port(s) being connected to an announcement system arranged to transmit a 5 message to calling customers (unanswered customers), characterised in that thecontrol means allocates each unanswered customer to the next position in a queue, calculates an approximate time for which the customer may be expected to wait prior to connection to a telephone handling server and causes voice announcement means to transmit the calculated time to the customer.
Preferably service data defines the average service time for each of a multiplicity of previously connected calls and server data defines the number ofservers currently available such that the calculation of the approximate wait time takes into account the position of the connected customer in the queue, the number of servers available and the average service time.
Service data may be stored in respect of each of a plurality of different servers such that the calculated times may reflect variations in the speed of call handling by each operator.
The system may be arranged to store data defining the time of arrival of each call, the calculated wait time at the time of arrival and the actual time of 20 connection of the call whereby a weighting factor based on the difference between the calculated and actual wait times may be applied to subsequently connected calls .
Where groups of input ports are allocated to different telephone numbers each of which may indicate a particular customer service requirement the 25 calculation may include differing service times for each category of customer and/or for each telephone handling server.
A feature of the invention utilises historic records of caller activity to estimate potential waiting times taking into account expected stimuli or other predetermined factors.
Expected stimuli may include broadcast or published advertising, holiday or festival dates and the like.
Predetermined factors may include operator shift changes or breaks, an increase or decrease in the number of operators available and time-dependent CA 022334~2 1998-03-27 features such as optional extra discounts or other special offerings, and closure or opening of other server centres.
A call queuing arrangement in accordance with the invention using the method of the invention will now be described by way of example only with 5 reference to the accompanying drawings of which:
Figure 1 is a schematic diagram of the call queuing arrangement;
Figure 2 is a schematic diagram of the data tables used by the arrangement in Figure 1;
Figures 3a and b form a flow chart showing the handling of an incoming 10 call by the processors of Figure 1;
Figure 4 shows the calculate waiting time macro function of Figure 3b;
Figure 5 shows the calculate performance adjustment macro of Figure 3b;
Figure 6 shows the calculate handling time macro of Figure 3; and Figure 7 shows a block schematic diagram of an adaptation of the PSTN
15 incorporating the customer queuing arrangement.
- Referring first to Figure 1 the arrangement essentially comprises a switch 1 having a multiplicity of input ports 2 for connection to incoming telephony traffic, for example for connection to the Public Switched Telephone Network (PSTN). A group of output ports 3 are arranged for connection to a number of 20 telephony servers for example telephone operators. A further port 4 is connected to a voice announcement system 5 and one or more ports 6 are connected to an entertainment facility, for example music on hold 7.
The connection through the switching system 1 is under the control of a store programmed controlled processor 8 which has access to a data store 9 the 25 contents of which will be described hereinafter.
The switching system 1 is arranged to selectively connect individual ports 2 to output ports 3, 4 and 6 under the control of the processor 8. Whenever a call is incoming to the system on the input ports 2, provided there is a server 3 free the system processor 8 will cause the connection of the respective port 2 to the30 respective free port 3. First referring also to Figures 2 and 3, when an incoming call is received on any one of the incoming ports 2, the system processor at step 100 determines whether pointers (not shown) indicating the head of the queue andend of queue respectively in a queue table (table 1) of the data storage system 9, CA 022334~2 1998-03-27 are equal. If it is determined that the head and end of queue are equal the indication is that the queue for handiing is currently empty. Thus the queuing system processor 8 interrogates the output ports 3 at step 11 0 to determine whether any of the servers which are currently active (as indicated in data table 2 5 of the data storage system 9) are free and if so obtains the server identity 115 of such a free server. The switching system is now arranged to connect the incoming call on the input port 2 to an appropriate port 3 at step 120. The callthrough the system is now under the control of the operator on the output port 3and/or the caller on the input port 2 in the normal manner for handling of telephone 10 calls through a telephony switch.
Having connected the caller to a server the system now identifies the category of incoming call (type) on the basis of the port 2 to which the call was first connected. Considering this identification further, it may be assumed thateach of the ports 2 is allocated to one,of a plurality of PSTN telephone numbers.
15 Several ports may be associated with the same telephone number. However, the te~ephone number may indicate whether the call is to an order line for example or to a customer enquiry line. Alternatively, where a bureau is handling calls for several principles the telephone numbe;may indicate the principle type of call. In a further development, the queuing system processor may use incoming line 20 identification as provided by some system operators to facilitate the categorisation of calls.
Having determined the call type at step 125 the server stores the information to a particular server as shown in table 2. Thus referring to table 2 also, each server attached to the port 3 is allocated an entry in the table. Thus the 25 destination port number for each server is represented in the ieft hand column and at step 130 the "real time" at which a call directed to the server is held in column 2 "LAST START". The type of call as identified at step 125 is also stored.
Referring back to Figure 3 at step 135 the typical handling time of a call of a designated type is obtained from data table 4 and by use of the actual start time 30 and the handling time an expected clear tirne can be entered into column 5 at step 140. In respect of any particular call step 145 "wait for end of call" now applies.
Returning now to the first step of handling an incoming call when at step 100 the head of queue is not equal to the end of queue thus indicating that one or CA 022334~2 1998-03-27 more callers is awaiting handling then the processor 8 performs a number of storage instructions in respect of the next position in queue.
Thus using the address in table 1 specified by the end of queue pointer prior to updating the pointer (step not shown) the system stores the location of the 5 cailer at one of the locations 1-n in terms of the input port 2 on which the call has arrived. In other columns the "real time" at which the call arrived together with the call type as hereinbefore described with reference to step 125 are stored. Acalculate wait time macro function 155 is now run in the processor 8 as hereinafter described and the estimated wait time and the time at which the 10 estimated wait was sent to the caller on input 2 is stored at step 160 respectively in the notice and estimate columns of the data table 1. As indicated at step 165in respective of a particular call the processor now waits for a free server. Moving on to Figure 3b, if during the wait for a free server the processor 8 receives an interrupt this may be indicative of one of a number of events. One such event as15 determined at step 175 is that a server on one of the ports 3 becomes active as free. If this is the case, at step 180 the processor 8 determines the head of queue from the head of queue pointer and at step 185 updates a further data table, table 3. The method of updating the data table is to remove from table 3 the oldest indication of estimated wait and actual wait and replace it with the estimated wait 20 from table 1 in respect of the caller now to be connected and the actual waitendured by that caller on the basis of the time of arrival of the call and the connection time. This data enables a performance adjustment to be carried out bea macro function (hereinafter described) step 190. The identified caller following updating the head of queue pointer (step not shown) is now connected at step 11525 as hereinbefore described.
If at step 175 the system determines that there is no server free the interrupt may have arisen because a periodic timer, or real time indicator, shows that the period since notice was last given to the caller as indicated in table 1 has exceeded a predetermined period also. If this should occur the calculate wait time 30 macro function runs at step 195.
Other events which may cause an event interrupt may include additional servers coming on line or a change of server pattern or shift.
CA 022334~2 1998-03-27 Once a call is in progress i.e. there is connection between an input port 2 and a server output 3 the processor 8 awaits an indication that the call has terminated and once the call is terminated proceeds at step 200 to determine from the start time as indicated in table 2 and the current time the actual time taken to 5 handle the specific call.
This information is stored in a further data table, table 4, in respect of the specific type of call as indicated in table 2 erasing the oldest data in respect of that particular call type. For the avoidance of doubt it is here noted that table 4 may be repeated for each server if variations in individual servers handling capacity 10 are required to be taken into account. It is also noted that where only one type of call or a single input type is identifiable then only a "single column" data table is required for each server or system.
Having stored the handling time the processor 8 may calculate the handling time at step 205. If the server remains active as indicated at step 21015 then at step 215 a "server free" interrupt is provided to cause the next queuing call to move into step 170. Assuming that the server has decided not to handle further calls as determined at step 210 then table 2 is updated at step 215 by clearing the active indicator and until such time as the server again becomes active further action to connect input port 2 to output port 3 for the respective server will 20 not occur.
Considering the calculate wait time macro function as used in steps 115 and 195 of Figure 3 with reference to Figure 4 the current customer location in table 1 is marked (step 300) and using the head of queue pointer at step 305 thenumber of customers ahead of the current customer location in queue and their call 25 type is determined from table 1 and accumulated at step 310. For each type ofcall (referred to as TX) the average serving time (S av) is obtained from data table 4 and multiplied by the respective number of customers ahead in the queue NX.
To obtain the expected service time (Sx) for each of the types.
Using table 2 the number of active servers on the ports 3 is determined at 30 step 320 to provide a figure (n). Also from table 2 the expected clear time of the next server anticipated to clear can be obtained thereby obtaining a clear time (tc) from which at step 330 an anticipated wait time W can be calculated as the sum of all of the expected service times Sx divided by the number of active servers (n) CA 022334~2 1998-03-27 minus the expected clear time period (tc). In order to make the calculations slightly more accurate a performance adjustment factor P may also be applied to the calculated wait time W.
Having calculated the wait time W the processor 8 causes the input port 2 on which the current customer is connected to be connected to the output port 4 to the voice announcement system 5 and at the same time passes the figure derived from W (that is the estimated wait time for the current caller) to be passed to the system 5. Thus the voice announcement system when connected to the caller may carry an announcement such as "you are currently held in a queue and 10 it is expected that an operator will answer your call in "W" minutes/seconds".
In dependence upon the point at which the calculate wait time macro was entered then the processor 8 returns either to await any further event interrupt or to storing the estimated wait time at step 160.
As has been previous noted as each call is cleared at step 145 the time 15 taken to handle the call is substituted for the oldest time to handle held in table 4 for the respective call type. This enables calculation by the macro 205 of the average handling time for the last "n" calls of specific type. Thus referring toFigure 6, the macro totals all the handling times for the last N calls of the particular type (if more than one) at step 350. By dividing this at step 355 by the number of 20 calls involved the average handling time of S av can be stored in table 4 in respect of the particular call type. As has been previously indicated this figure is used in the calculation of wait time. Because the handling time is constantly being updated by replacing the oldest piece of data by the latest piece of data then variations of performance over a period of time can be taken into account by thesystem so that the wait figure received by a caller on the input port 2 fairly accurately reflects current performance of the servers on the output port 3. As previously noted there may be a number of tables carrying server performance in respect of the call types. In general an average of each call type across all servers is calculated for use as S av in the calculation of wait times. However, in respect 30 of expected clear time stored in table 2 it may applicable to have an S av calculation in respect of each of the servers.
Turning now to Figure 5, to seek to make the best possible calculation of the wait time estimate (W) table 3 is used and each time a caller is connected to a CA 022334~2 1998-03-27 server on the output 3 at step 190 performance adjustment as shown in Figure 5 is carried out. Thus for each of the last "N" connections the estimated wait period is summed at step 400 and the actual wait period is calculated for the same N
connections at step 405. The difference between the two calculations (~E-~W) is a measure of the actual performance of the estimating system and at step 410 a determination as to whether the system is over or under estimating the actual wait time is carried out. In dependence upon this performance factor P as used in thecalculate wait time macro can be arrived at. Thus in one case at step 415 Pis set at less than 1 that is to say the wait time to be broadcast requires to be shorter 10 where in the other case at step 420 a factor greater than 1 is obtained.
Although a step to limit variations in the value of P has not been shown it will be appreciated that P may be bounded such that if ~E-~W at step 410 approaches zero no amendment of the current performance factor P is carried out.The value of "f" shown in steps 415 and 420 may be system dependent 15 and is determined by the operator on installation or subsequently.
It is noted that once a customer has received a call answer by virtue of connection to the voice announcement system 5 on clearance from the voice announcement the input port 2 may be connected to an output port 6 which provides some form of entertainment for example music on hold.
While as hereinbefore described the system is for a stand alone use with a multiplicity of exchange lines incoming to a limited number of operators, it will be appreciated that the system can be applied to a much larger network, for examplethe public switched network as shown in Figure 7. Thus referring now to Figure 7the control system 28 may be incorporated as a platform on an intelligent network 25 of the kind comprising a multiplicity of fully interconnected digital switching units here represented by digital main switching units 29 and 30. Each of the digital main switching units is connected to a number of local switches 31 by trunks 32 for providing service to lines to customer premises 33, 34, and 35. A network management system 40 controls the connection of the network. Interconnections between the MSUs may be as a result of data signalling using a specific data channel of time division multiplex linking through the digital network. This will usually use protocols such as that described in respect of C 7 signalling.
CA 022334~2 1998-03-27 Now for example if an organisation has a number of iines 35 to its operators then calls from the PSTN customers for example those connected to lines 33 and 34 may be connected across the network only when one of the lines 35 becomes free and active. In this case, when a digital unit receives data from5 the local switch 31 indicating that a customer on one of the lines 33 has dialled a number for one of the lines 35 then the queuing control system platform 28 may be notified. If the control system 28 has received an indication by way of the DMSU 32 data channels that a free line in the server group is available then thenetwork may be notified accordingly and the call switched though from the local 10 switch 31 through the DMSUs to the local switch on which lines 35 exist and no further action, other than possibly to monitor for clearance as hereinbefore described for the purpose of calculating handling times will be required by the platform 28. However, if none of the lines 35 is currently free then the caller on line 33 may be locally connected to a voice announcement system 37 with the 15 network control system providing periodic switching e.g. music on hold and voice announcement, with the expected wait being calculated and forwarded across the data side of the network. In this way the capacity of the public switched network is not used unless the call can be connected to the server group on one of the lines 35. Once one of the lines 35 becomes free the call queuing platform 28 may 20 cause the system to set up the connection from the line 33 through the network to line 35 in a known manner. While a specific method of calculation of the estimated wait time has been described herein, another method of determining an expected wait time is to create a table of expected clear times in respect of each server which may be present (referring again to Figure 1) on the output ports 3.25 Thus table 2 carries an expected clear time based on the last start time and the type of call. Thus a table of types can be used to allocate each caller in the queue of table 1 on a nominal basis and by an iterative process determine the expectedconnect time for all subsequent callers in the queue.
The expected connect time may then be provided to the voice 30 announcement system in the same manner as for "W".
While not specifically described herein, it will be noted that the system then responds specifically to variations in call dropout rate (that is callers who release from input ports prior to connection to a operator).
CA 022334~2 1998-03-27 Further, the system may be pre-programmed by the operator with timings at which servers may join or leave the network server pool, for example and other factors such as seasonal variations may be taken into account.
In a further development, the system may be arranged to calculate the 5 expected waiting time W using more than one of the methods described previously so that utilising the performance adjustment P and comparing the estimated waiting time wlth the latest waiting time for each method of calculation, the most accurate current estimation method may be used.
Further factors which may be taken into account in the calculation of P or 10 in considering the weighting factor may be based upon historic records of calling patterns, weighting factors and performance accuracy for a corresponding period,for example at the same time of day on the same day of the preceding week or month or year.
The system may also be responsive to operator input of anticipated 15 advertising times, mail shots of press advertisements to determine the expected response and to modify performance adjustment accordingly.
Other factors, including anticipated shift changes, closure of other server centres and the like may also be taken into account.
The system may also be used to predict server requirements by utilising 20 historic records in combination with the waiting calculation methods so that by determining a simulated calling pattern the number of servers required to bound the estimated wait period may be estimated. Such information may be used by a service provider to vary the operation relationship pattern of the servers in use.
The system may be used to provide information to the operator for 25 example by setting a threshold for a maximum permissible wait time such that if in the first calculation of wait time as indicated at 155 of Figure 3a the anticipated wait time exceeds the predetermined threshold a supervisor position is notified.Further, the calculate wait time macro of Figure 4 may be amended such that after the calculation of the wait (w) at step 330 the value of w is compared 30 with a number of thresholds and, in dePendence upon the length of wait the message to be provided by the voice announcement is varied.
Thus the expected wait exceeds or is close to a near maximum threshold the announcement may advise the customer to disconnect and call at a later period CA 022334~2 1998-03-27 W O 97/1~136 PCT/GB96/02520 without insisting that the customer does so. Thus, connection may be to a particular voice announcement at step 335 of Figure 4 which provides a message such as "you are currently held in a queue and it is expected that our operator will take approximately 15 minutes to answer your call. You may wish to clear and 5 call back later when our lines will be less busy".
Where the wait is shorter for a wait of between one and two minutes then the announcement may be "please hold the line you are held in queue, one of our operators will answer your call within approximately w seconds".
The present invention relates to a customer queuing arrangement and more particularly to such an arrangement for use in providing telecommunicationsservices.
Many organisations such as mail order companies, banks, repair companies, information providers and emergency service providers have many more telephone access lines than they have operators available to handle calls.
This is a more efficient way of handling telephone access requirements since 10 operators are not idle while awaiting the next incoming call as would be the case if the number of operators and number of lines were equal. Further, at peak times, customers calling the service do not have to re-dial when lines are particularlybusy.
It has become customary for an automated answering system to pick up 15 calls after a short period of ringing in order to re-assure the customer that they are connected to an appropriate service centre. Usually a message is transmitted suGh as "Please hold the line. You are held in a queue. One of our operators will answer your call as soon as possible." Music or other entertainment may be provided subsequent to the message or ring tone re-instated. After a period, often around20 one minute, the message is repeated or another message is transmitted.
Some companies, notably in the United States of America, have introduced a "telephone radio show" in which customers joining a tele-sales queue are entertained by a disc jockey or comedian who periodically advises on the length of the queue and indicates the overall waiting time based on the duration of 25 the wait experienced by the most recently answered caller.
Such systems are helpful in avoiding lost calls to the destination but can lead to customer frustration if the wait is lengthy and the same message is repeated. This may result in lost business if the customer hangs up before beingpassed to an operator and subsequently calls again thus rejoining the queue.
The present invention seeks to overcome some of the above problems by providing a call queuing system in which the information provided is more specifically tailored to each customer's position in the queue.
CA 022334~2 1998-03-27 According to one aspect of the present invention there is provided in a customer queuing arrangement a method of estimating an approximate time for which a customer in a queue may be required to wait for a server comprising the steps of determining the position of each customer in the queue, determining for5 each of a plurality of active servers an average time to handle a customer, determining from the start time at which each active server last connected with a current customer the anticipated time at which such server will become availableto obtain a series of times of anticipated availability of active servers and nominally allocating each customer in the queue to one of the series of times 10 whereby the approximate waiting time for each customer may be determined.
A preferred method of the invention comprises estlmating an approximate time for which a designated customer in a queue of customers may be required to wait for a server comprising the steps of determining the number of customers tN) in the queue to be served before the designated customer, calculating the average 15 handling time for each of a plurality of servers to handle a customer connection to provide a mean service time (S), and multiplying the number of customers N by the mean service time S and dividing by the number of active servers (n) to obtain await time (W).
Preferably the calculated wait time W also includes an estimate of the 20 period at which the next server will become avaiiable. A further improvement of the calculated wait time may be obtained by comparing previously calculated waittimes with actual wait times to derive a weighting factor adjustment for use in subsequent calculations of wait times.
Additionally, where customers may fall into differing categories a 25 respective mean service time may be determined for each of such categories and used in the calculation of wait time.
According to a second aspect of the invention there is provided a-call queuing system comprising switch means having a plurality of input ports for connection to incoming telephone lines, a plurality of primary output ports for 30 connection to telephone handling servers, control means responsive to calls on the input ports to selectively effect connections through the switch means to one the output ports, the control means also being arranged to determine which, if any, of the output ports is not currently connected to an input port and to effect -CA 022334~2 1998-03-27 W O 97tl5136 PCT/GB96/02~20 connections sequentially to the output ports, the switch means further having atleast one secondary output port to which calls arriving at the input ports are switched if none of the primary output ports are available, said secondary output port(s) being connected to an announcement system arranged to transmit a 5 message to calling customers (unanswered customers), characterised in that thecontrol means allocates each unanswered customer to the next position in a queue, calculates an approximate time for which the customer may be expected to wait prior to connection to a telephone handling server and causes voice announcement means to transmit the calculated time to the customer.
Preferably service data defines the average service time for each of a multiplicity of previously connected calls and server data defines the number ofservers currently available such that the calculation of the approximate wait time takes into account the position of the connected customer in the queue, the number of servers available and the average service time.
Service data may be stored in respect of each of a plurality of different servers such that the calculated times may reflect variations in the speed of call handling by each operator.
The system may be arranged to store data defining the time of arrival of each call, the calculated wait time at the time of arrival and the actual time of 20 connection of the call whereby a weighting factor based on the difference between the calculated and actual wait times may be applied to subsequently connected calls .
Where groups of input ports are allocated to different telephone numbers each of which may indicate a particular customer service requirement the 25 calculation may include differing service times for each category of customer and/or for each telephone handling server.
A feature of the invention utilises historic records of caller activity to estimate potential waiting times taking into account expected stimuli or other predetermined factors.
Expected stimuli may include broadcast or published advertising, holiday or festival dates and the like.
Predetermined factors may include operator shift changes or breaks, an increase or decrease in the number of operators available and time-dependent CA 022334~2 1998-03-27 features such as optional extra discounts or other special offerings, and closure or opening of other server centres.
A call queuing arrangement in accordance with the invention using the method of the invention will now be described by way of example only with 5 reference to the accompanying drawings of which:
Figure 1 is a schematic diagram of the call queuing arrangement;
Figure 2 is a schematic diagram of the data tables used by the arrangement in Figure 1;
Figures 3a and b form a flow chart showing the handling of an incoming 10 call by the processors of Figure 1;
Figure 4 shows the calculate waiting time macro function of Figure 3b;
Figure 5 shows the calculate performance adjustment macro of Figure 3b;
Figure 6 shows the calculate handling time macro of Figure 3; and Figure 7 shows a block schematic diagram of an adaptation of the PSTN
15 incorporating the customer queuing arrangement.
- Referring first to Figure 1 the arrangement essentially comprises a switch 1 having a multiplicity of input ports 2 for connection to incoming telephony traffic, for example for connection to the Public Switched Telephone Network (PSTN). A group of output ports 3 are arranged for connection to a number of 20 telephony servers for example telephone operators. A further port 4 is connected to a voice announcement system 5 and one or more ports 6 are connected to an entertainment facility, for example music on hold 7.
The connection through the switching system 1 is under the control of a store programmed controlled processor 8 which has access to a data store 9 the 25 contents of which will be described hereinafter.
The switching system 1 is arranged to selectively connect individual ports 2 to output ports 3, 4 and 6 under the control of the processor 8. Whenever a call is incoming to the system on the input ports 2, provided there is a server 3 free the system processor 8 will cause the connection of the respective port 2 to the30 respective free port 3. First referring also to Figures 2 and 3, when an incoming call is received on any one of the incoming ports 2, the system processor at step 100 determines whether pointers (not shown) indicating the head of the queue andend of queue respectively in a queue table (table 1) of the data storage system 9, CA 022334~2 1998-03-27 are equal. If it is determined that the head and end of queue are equal the indication is that the queue for handiing is currently empty. Thus the queuing system processor 8 interrogates the output ports 3 at step 11 0 to determine whether any of the servers which are currently active (as indicated in data table 2 5 of the data storage system 9) are free and if so obtains the server identity 115 of such a free server. The switching system is now arranged to connect the incoming call on the input port 2 to an appropriate port 3 at step 120. The callthrough the system is now under the control of the operator on the output port 3and/or the caller on the input port 2 in the normal manner for handling of telephone 10 calls through a telephony switch.
Having connected the caller to a server the system now identifies the category of incoming call (type) on the basis of the port 2 to which the call was first connected. Considering this identification further, it may be assumed thateach of the ports 2 is allocated to one,of a plurality of PSTN telephone numbers.
15 Several ports may be associated with the same telephone number. However, the te~ephone number may indicate whether the call is to an order line for example or to a customer enquiry line. Alternatively, where a bureau is handling calls for several principles the telephone numbe;may indicate the principle type of call. In a further development, the queuing system processor may use incoming line 20 identification as provided by some system operators to facilitate the categorisation of calls.
Having determined the call type at step 125 the server stores the information to a particular server as shown in table 2. Thus referring to table 2 also, each server attached to the port 3 is allocated an entry in the table. Thus the 25 destination port number for each server is represented in the ieft hand column and at step 130 the "real time" at which a call directed to the server is held in column 2 "LAST START". The type of call as identified at step 125 is also stored.
Referring back to Figure 3 at step 135 the typical handling time of a call of a designated type is obtained from data table 4 and by use of the actual start time 30 and the handling time an expected clear tirne can be entered into column 5 at step 140. In respect of any particular call step 145 "wait for end of call" now applies.
Returning now to the first step of handling an incoming call when at step 100 the head of queue is not equal to the end of queue thus indicating that one or CA 022334~2 1998-03-27 more callers is awaiting handling then the processor 8 performs a number of storage instructions in respect of the next position in queue.
Thus using the address in table 1 specified by the end of queue pointer prior to updating the pointer (step not shown) the system stores the location of the 5 cailer at one of the locations 1-n in terms of the input port 2 on which the call has arrived. In other columns the "real time" at which the call arrived together with the call type as hereinbefore described with reference to step 125 are stored. Acalculate wait time macro function 155 is now run in the processor 8 as hereinafter described and the estimated wait time and the time at which the 10 estimated wait was sent to the caller on input 2 is stored at step 160 respectively in the notice and estimate columns of the data table 1. As indicated at step 165in respective of a particular call the processor now waits for a free server. Moving on to Figure 3b, if during the wait for a free server the processor 8 receives an interrupt this may be indicative of one of a number of events. One such event as15 determined at step 175 is that a server on one of the ports 3 becomes active as free. If this is the case, at step 180 the processor 8 determines the head of queue from the head of queue pointer and at step 185 updates a further data table, table 3. The method of updating the data table is to remove from table 3 the oldest indication of estimated wait and actual wait and replace it with the estimated wait 20 from table 1 in respect of the caller now to be connected and the actual waitendured by that caller on the basis of the time of arrival of the call and the connection time. This data enables a performance adjustment to be carried out bea macro function (hereinafter described) step 190. The identified caller following updating the head of queue pointer (step not shown) is now connected at step 11525 as hereinbefore described.
If at step 175 the system determines that there is no server free the interrupt may have arisen because a periodic timer, or real time indicator, shows that the period since notice was last given to the caller as indicated in table 1 has exceeded a predetermined period also. If this should occur the calculate wait time 30 macro function runs at step 195.
Other events which may cause an event interrupt may include additional servers coming on line or a change of server pattern or shift.
CA 022334~2 1998-03-27 Once a call is in progress i.e. there is connection between an input port 2 and a server output 3 the processor 8 awaits an indication that the call has terminated and once the call is terminated proceeds at step 200 to determine from the start time as indicated in table 2 and the current time the actual time taken to 5 handle the specific call.
This information is stored in a further data table, table 4, in respect of the specific type of call as indicated in table 2 erasing the oldest data in respect of that particular call type. For the avoidance of doubt it is here noted that table 4 may be repeated for each server if variations in individual servers handling capacity 10 are required to be taken into account. It is also noted that where only one type of call or a single input type is identifiable then only a "single column" data table is required for each server or system.
Having stored the handling time the processor 8 may calculate the handling time at step 205. If the server remains active as indicated at step 21015 then at step 215 a "server free" interrupt is provided to cause the next queuing call to move into step 170. Assuming that the server has decided not to handle further calls as determined at step 210 then table 2 is updated at step 215 by clearing the active indicator and until such time as the server again becomes active further action to connect input port 2 to output port 3 for the respective server will 20 not occur.
Considering the calculate wait time macro function as used in steps 115 and 195 of Figure 3 with reference to Figure 4 the current customer location in table 1 is marked (step 300) and using the head of queue pointer at step 305 thenumber of customers ahead of the current customer location in queue and their call 25 type is determined from table 1 and accumulated at step 310. For each type ofcall (referred to as TX) the average serving time (S av) is obtained from data table 4 and multiplied by the respective number of customers ahead in the queue NX.
To obtain the expected service time (Sx) for each of the types.
Using table 2 the number of active servers on the ports 3 is determined at 30 step 320 to provide a figure (n). Also from table 2 the expected clear time of the next server anticipated to clear can be obtained thereby obtaining a clear time (tc) from which at step 330 an anticipated wait time W can be calculated as the sum of all of the expected service times Sx divided by the number of active servers (n) CA 022334~2 1998-03-27 minus the expected clear time period (tc). In order to make the calculations slightly more accurate a performance adjustment factor P may also be applied to the calculated wait time W.
Having calculated the wait time W the processor 8 causes the input port 2 on which the current customer is connected to be connected to the output port 4 to the voice announcement system 5 and at the same time passes the figure derived from W (that is the estimated wait time for the current caller) to be passed to the system 5. Thus the voice announcement system when connected to the caller may carry an announcement such as "you are currently held in a queue and 10 it is expected that an operator will answer your call in "W" minutes/seconds".
In dependence upon the point at which the calculate wait time macro was entered then the processor 8 returns either to await any further event interrupt or to storing the estimated wait time at step 160.
As has been previous noted as each call is cleared at step 145 the time 15 taken to handle the call is substituted for the oldest time to handle held in table 4 for the respective call type. This enables calculation by the macro 205 of the average handling time for the last "n" calls of specific type. Thus referring toFigure 6, the macro totals all the handling times for the last N calls of the particular type (if more than one) at step 350. By dividing this at step 355 by the number of 20 calls involved the average handling time of S av can be stored in table 4 in respect of the particular call type. As has been previously indicated this figure is used in the calculation of wait time. Because the handling time is constantly being updated by replacing the oldest piece of data by the latest piece of data then variations of performance over a period of time can be taken into account by thesystem so that the wait figure received by a caller on the input port 2 fairly accurately reflects current performance of the servers on the output port 3. As previously noted there may be a number of tables carrying server performance in respect of the call types. In general an average of each call type across all servers is calculated for use as S av in the calculation of wait times. However, in respect 30 of expected clear time stored in table 2 it may applicable to have an S av calculation in respect of each of the servers.
Turning now to Figure 5, to seek to make the best possible calculation of the wait time estimate (W) table 3 is used and each time a caller is connected to a CA 022334~2 1998-03-27 server on the output 3 at step 190 performance adjustment as shown in Figure 5 is carried out. Thus for each of the last "N" connections the estimated wait period is summed at step 400 and the actual wait period is calculated for the same N
connections at step 405. The difference between the two calculations (~E-~W) is a measure of the actual performance of the estimating system and at step 410 a determination as to whether the system is over or under estimating the actual wait time is carried out. In dependence upon this performance factor P as used in thecalculate wait time macro can be arrived at. Thus in one case at step 415 Pis set at less than 1 that is to say the wait time to be broadcast requires to be shorter 10 where in the other case at step 420 a factor greater than 1 is obtained.
Although a step to limit variations in the value of P has not been shown it will be appreciated that P may be bounded such that if ~E-~W at step 410 approaches zero no amendment of the current performance factor P is carried out.The value of "f" shown in steps 415 and 420 may be system dependent 15 and is determined by the operator on installation or subsequently.
It is noted that once a customer has received a call answer by virtue of connection to the voice announcement system 5 on clearance from the voice announcement the input port 2 may be connected to an output port 6 which provides some form of entertainment for example music on hold.
While as hereinbefore described the system is for a stand alone use with a multiplicity of exchange lines incoming to a limited number of operators, it will be appreciated that the system can be applied to a much larger network, for examplethe public switched network as shown in Figure 7. Thus referring now to Figure 7the control system 28 may be incorporated as a platform on an intelligent network 25 of the kind comprising a multiplicity of fully interconnected digital switching units here represented by digital main switching units 29 and 30. Each of the digital main switching units is connected to a number of local switches 31 by trunks 32 for providing service to lines to customer premises 33, 34, and 35. A network management system 40 controls the connection of the network. Interconnections between the MSUs may be as a result of data signalling using a specific data channel of time division multiplex linking through the digital network. This will usually use protocols such as that described in respect of C 7 signalling.
CA 022334~2 1998-03-27 Now for example if an organisation has a number of iines 35 to its operators then calls from the PSTN customers for example those connected to lines 33 and 34 may be connected across the network only when one of the lines 35 becomes free and active. In this case, when a digital unit receives data from5 the local switch 31 indicating that a customer on one of the lines 33 has dialled a number for one of the lines 35 then the queuing control system platform 28 may be notified. If the control system 28 has received an indication by way of the DMSU 32 data channels that a free line in the server group is available then thenetwork may be notified accordingly and the call switched though from the local 10 switch 31 through the DMSUs to the local switch on which lines 35 exist and no further action, other than possibly to monitor for clearance as hereinbefore described for the purpose of calculating handling times will be required by the platform 28. However, if none of the lines 35 is currently free then the caller on line 33 may be locally connected to a voice announcement system 37 with the 15 network control system providing periodic switching e.g. music on hold and voice announcement, with the expected wait being calculated and forwarded across the data side of the network. In this way the capacity of the public switched network is not used unless the call can be connected to the server group on one of the lines 35. Once one of the lines 35 becomes free the call queuing platform 28 may 20 cause the system to set up the connection from the line 33 through the network to line 35 in a known manner. While a specific method of calculation of the estimated wait time has been described herein, another method of determining an expected wait time is to create a table of expected clear times in respect of each server which may be present (referring again to Figure 1) on the output ports 3.25 Thus table 2 carries an expected clear time based on the last start time and the type of call. Thus a table of types can be used to allocate each caller in the queue of table 1 on a nominal basis and by an iterative process determine the expectedconnect time for all subsequent callers in the queue.
The expected connect time may then be provided to the voice 30 announcement system in the same manner as for "W".
While not specifically described herein, it will be noted that the system then responds specifically to variations in call dropout rate (that is callers who release from input ports prior to connection to a operator).
CA 022334~2 1998-03-27 Further, the system may be pre-programmed by the operator with timings at which servers may join or leave the network server pool, for example and other factors such as seasonal variations may be taken into account.
In a further development, the system may be arranged to calculate the 5 expected waiting time W using more than one of the methods described previously so that utilising the performance adjustment P and comparing the estimated waiting time wlth the latest waiting time for each method of calculation, the most accurate current estimation method may be used.
Further factors which may be taken into account in the calculation of P or 10 in considering the weighting factor may be based upon historic records of calling patterns, weighting factors and performance accuracy for a corresponding period,for example at the same time of day on the same day of the preceding week or month or year.
The system may also be responsive to operator input of anticipated 15 advertising times, mail shots of press advertisements to determine the expected response and to modify performance adjustment accordingly.
Other factors, including anticipated shift changes, closure of other server centres and the like may also be taken into account.
The system may also be used to predict server requirements by utilising 20 historic records in combination with the waiting calculation methods so that by determining a simulated calling pattern the number of servers required to bound the estimated wait period may be estimated. Such information may be used by a service provider to vary the operation relationship pattern of the servers in use.
The system may be used to provide information to the operator for 25 example by setting a threshold for a maximum permissible wait time such that if in the first calculation of wait time as indicated at 155 of Figure 3a the anticipated wait time exceeds the predetermined threshold a supervisor position is notified.Further, the calculate wait time macro of Figure 4 may be amended such that after the calculation of the wait (w) at step 330 the value of w is compared 30 with a number of thresholds and, in dePendence upon the length of wait the message to be provided by the voice announcement is varied.
Thus the expected wait exceeds or is close to a near maximum threshold the announcement may advise the customer to disconnect and call at a later period CA 022334~2 1998-03-27 W O 97/1~136 PCT/GB96/02520 without insisting that the customer does so. Thus, connection may be to a particular voice announcement at step 335 of Figure 4 which provides a message such as "you are currently held in a queue and it is expected that our operator will take approximately 15 minutes to answer your call. You may wish to clear and 5 call back later when our lines will be less busy".
Where the wait is shorter for a wait of between one and two minutes then the announcement may be "please hold the line you are held in queue, one of our operators will answer your call within approximately w seconds".
Claims (21)
1. A call queuing system comprising:
switch means having a plurality of input ports for connection to incoming telephone lines and a plurality of primary output ports for connection to telephone handling servers;
control means responsive to calls on the input ports to selectively effect connections through the switch means to one of the output ports;
the control means also being arranged to determine which, if any, of the output ports is not currently connected to an input port and to effect connections sequentially to the output ports, the switch means further having at least one secondary output port to which calls arriving at the input ports are switched if none of the primary output ports are available, said secondary output port(s) being connected to an announcement system arranged to transmit a message to calling but unanswered customers;
the control means calculating each unanswered customer to the next position in a queue, calculating an approximate time for which the customer may be expected to wait prior to connection to a telephone handling server and causing voice announcement means to transmit the calculated time to the customer;
the control means calculating an approximate time from service data defining the average service time for each of a multiplicity of previously connected calls, server data defining the number of servers currently in operation and the number of customers in the queue ahead of the customer currently connected to the voice announcement means;
wherein each time a call is connected to the voice announcement means, the control means causes data defining the calculated waiting time to be stored together with the actual time of connection and upon connection of such call to a telephone handling server determines the difference, between the calculated waiting time and the actual waiting time such that a weighting factor maybe applied in subsequent call waiting time calculations.
switch means having a plurality of input ports for connection to incoming telephone lines and a plurality of primary output ports for connection to telephone handling servers;
control means responsive to calls on the input ports to selectively effect connections through the switch means to one of the output ports;
the control means also being arranged to determine which, if any, of the output ports is not currently connected to an input port and to effect connections sequentially to the output ports, the switch means further having at least one secondary output port to which calls arriving at the input ports are switched if none of the primary output ports are available, said secondary output port(s) being connected to an announcement system arranged to transmit a message to calling but unanswered customers;
the control means calculating each unanswered customer to the next position in a queue, calculating an approximate time for which the customer may be expected to wait prior to connection to a telephone handling server and causing voice announcement means to transmit the calculated time to the customer;
the control means calculating an approximate time from service data defining the average service time for each of a multiplicity of previously connected calls, server data defining the number of servers currently in operation and the number of customers in the queue ahead of the customer currently connected to the voice announcement means;
wherein each time a call is connected to the voice announcement means, the control means causes data defining the calculated waiting time to be stored together with the actual time of connection and upon connection of such call to a telephone handling server determines the difference, between the calculated waiting time and the actual waiting time such that a weighting factor maybe applied in subsequent call waiting time calculations.
2. The call queuing system as claimed in claim 1, wherein said service data defines the average service time for each of a plurality of different servers connected to said secondary output pons and said server data further defining actual servers currently in operation.
3. The call queuing system as claimed in claims 1 or 2, wherein each input port is allocated to one of a plurality of telephone numbers, said telephone numbers being indicative of a respective service category selected by calling customers, the service data for each category being stored such that in calculating the waiting time for a designated customer, the control means determines the number of queuing customers ahead of a designated customer in each category together with the service data for the respective category, and the number of active servers, to determine the calculated waiting time.
4. The call queuing system as in any one of claims 1 to 3, wherein said control means causes each customer in said queue to be connected in turn to one of said secondary output ports and on each such connection of said customer, said control means recalculates the respective waiting time to be announced, said customers being reconnected to said secondary output port on occurrence of at least one of the following events:
expiry of a predetermined period of time since connection of said calling customer to said secondary output port;
one or more preceding customers in said queue being connected to a primary output port;
one or more primary output ports being activated;
one or more primary parts being deactivated; and one or more customers leaving said queue by disconnection.
expiry of a predetermined period of time since connection of said calling customer to said secondary output port;
one or more preceding customers in said queue being connected to a primary output port;
one or more primary output ports being activated;
one or more primary parts being deactivated; and one or more customers leaving said queue by disconnection.
5. A call queuing system, comprising:
a switch, said switch including a plurality of input ports for connection to incoming telephone lines and a plurality of output pons for connection to telephone servers;
a controller responsive to calls on said input ports, said controller selectively effecting connections between said input ports and said output ports through said switch, said controller further being arranged to determine which of said output ports is not connected to an input port and to effect connections sequentially to said output ports;
said switch further comprising at least one secondary output port to which calls arriving as said input ports sue switched if no primary output ports are available;
an announcement system connected to said secondary output port, said announcement system being arranged to transmit a message to calls that are switched to said secondary output port;
said controller allocating each call connected to said secondary port to a position in a queue and calculating an estimated waiting time for which each call in said queue may be expected to wait prior to connection to a server, and causing said announcement system to transmit the respective estimated waiting time to each call in the queue;
wherein said estimated waiting times are based on an average service time for each of a plurality of previously connected calls, server data defining the number of servers in operation, the number of calls in the queue ahead of the calls currently connected to the announcement system and an anticipated time at which an active server will become available to service a call.
a switch, said switch including a plurality of input ports for connection to incoming telephone lines and a plurality of output pons for connection to telephone servers;
a controller responsive to calls on said input ports, said controller selectively effecting connections between said input ports and said output ports through said switch, said controller further being arranged to determine which of said output ports is not connected to an input port and to effect connections sequentially to said output ports;
said switch further comprising at least one secondary output port to which calls arriving as said input ports sue switched if no primary output ports are available;
an announcement system connected to said secondary output port, said announcement system being arranged to transmit a message to calls that are switched to said secondary output port;
said controller allocating each call connected to said secondary port to a position in a queue and calculating an estimated waiting time for which each call in said queue may be expected to wait prior to connection to a server, and causing said announcement system to transmit the respective estimated waiting time to each call in the queue;
wherein said estimated waiting times are based on an average service time for each of a plurality of previously connected calls, server data defining the number of servers in operation, the number of calls in the queue ahead of the calls currently connected to the announcement system and an anticipated time at which an active server will become available to service a call.
6. The call queuing system of claim 5, wherein said server data further comprises:
an average service time for each of a plurality of servers currently in operation.
an average service time for each of a plurality of servers currently in operation.
7. The call queuing system of claim 6, wherein said controller compares an actual waiting time for a given call to the estimated waiting time for said given call to determine a weighting factor that may be applied to subsequent estimated waiting times.
8. The call queuing system of claim 7, wherein said weighting factor is a difference between a sum of all previous actual waiting times and a sum of all previous estimated waiting times.
9. The call queuing system of claim 5, wherein each input port is allocated to one of a plurality of telephone numbers, said telephone numbers being indicative of a category of service selected by a caller, service data for each category being stored, said service data including an average service time for each of a plurality of previously connected calls in each category, and the controller calculating estimated waiting time for each caller in each category based on the service data for each respective category, the number of active servers, the number of callers ahead of the call currently connected to the announcement system in a given category and an anticipated time at which an active server in the given category will become available to service a call.
10. The call queuing system of claim 5, wherein said controller determines a list of anticipated times at which each server will become free based on stored data defining a time at which each server was last connected to a call and service data defining an average length of time taken by each server to handle a connected call, the controller further correlating the position of each call in the queue with the list of anticipated times to determine the estimated waiting time.
11. The call queuing system of claim 5, wherein said controller causes each caller to wham a previous announcement has been made to be reconnected with said announcement system and re-estimates the waiting time for callers in the queue upon the occurrence of a predetermined event, said predetermined event being at least one of the group comprising: expiration of a predetermined time period since connection of a call to the announcement system, connection of one or more preceding callers in the queue to a server, and a change in the number of active servers.
12. A method estimating waiting time for a caller in a queue of callers waiting for service from a server in a peal of servers, said method comprising the steps of:
determining a position of each caller in a queue of callers;
determining an average time for a server to serve a caller;
determining, for each active server, an anticipated time at which each said active server will become available to serve a caller; and estimating the waiting time for each caller in the queue based on the position of each caller in the queue, the average time for a server to serve a caller, the number of active servers, and the anticipated time at which each active server will become available.
determining a position of each caller in a queue of callers;
determining an average time for a server to serve a caller;
determining, for each active server, an anticipated time at which each said active server will become available to serve a caller; and estimating the waiting time for each caller in the queue based on the position of each caller in the queue, the average time for a server to serve a caller, the number of active servers, and the anticipated time at which each active server will become available.
13. The method according to claim 12, wherein the step of determining an anticipated time at which each active server will become available is based on a start time at which each active server was last connected to a caller.
14. The method according to claim 12 or claim 13, wherein the anticipated time at which each active server will become available is based on historical data of each active server.
15. The method according to any one of claims 12 to 14, comprising:
determining a category of service for each caller in the queue of callers; and determining an average time for a server to serve a caller based on the category of service for said caller.
determining a category of service for each caller in the queue of callers; and determining an average time for a server to serve a caller based on the category of service for said caller.
16. The method acording to any one of claims 12 to 15, further comprising the steps of:
determining a weighting factor based on a difference between the estimated waiting time and an actual waiting time; and applying said waiting factor to subsequent estimated waiting times.
determining a weighting factor based on a difference between the estimated waiting time and an actual waiting time; and applying said waiting factor to subsequent estimated waiting times.
17. The method according to claim 16, wherein the step of determining a weighting factor includes dynamically adjusting the weighting factor based on a difference between a sum of previous estimated waiting times and a sum of previous actual waiting times.
18. The method accoding to any one of claims 12 to 17, further comprising the step of:
connecting the callers in the queue for whom waiting times have been estimated io a voice announcement system, said voice announcement system announcing the estimated waiting times to said callers.
connecting the callers in the queue for whom waiting times have been estimated io a voice announcement system, said voice announcement system announcing the estimated waiting times to said callers.
19. The method according to any one of claims 12 to 18, further comprising the step of:
reconnecting callers in the queue to the voice announcement system; and re-estimating the waiting time for callers in the queue upon the occurrence of a predetermined event, said predetermined event being at least one of the group of events comprising: expiration of at predetermined period of time since connection of a caller to the voice announcement system, connection of one or more preceding callers in the queue to a server, and a change in the number of active servers.
reconnecting callers in the queue to the voice announcement system; and re-estimating the waiting time for callers in the queue upon the occurrence of a predetermined event, said predetermined event being at least one of the group of events comprising: expiration of at predetermined period of time since connection of a caller to the voice announcement system, connection of one or more preceding callers in the queue to a server, and a change in the number of active servers.
20. A method of estimating an approximate time for which a designated customer in a queue of customers connected through a telephone system may be required to wait for connection to a server comprising the steps of:
determining the number of customers in the queue ahead of the designated customer;
calculating an average handling time for each of a plurality of servers to handle a customer connection to provide a mean service time;
multiplying the number of customers by the mean service time and dividing by the number of active servers; and determining a weighting factor from an originally estimated waiting time and an actual waiting time of at least one previously handled customer call; and applying said weighting factor to each estimate of approximate waiting time.
determining the number of customers in the queue ahead of the designated customer;
calculating an average handling time for each of a plurality of servers to handle a customer connection to provide a mean service time;
multiplying the number of customers by the mean service time and dividing by the number of active servers; and determining a weighting factor from an originally estimated waiting time and an actual waiting time of at least one previously handled customer call; and applying said weighting factor to each estimate of approximate waiting time.
21. The method according to claim 20, wherein an approximate time period until one of said servers is expected to clear a preceding call is added to the waiting time prior to announcement of said waiting time to a customer.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP95307386 | 1995-10-17 | ||
| EP95307386.3 | 1995-10-17 | ||
| PCT/GB1996/002520 WO1997015136A1 (en) | 1995-10-17 | 1996-10-14 | Customer queuing arrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2233452A1 CA2233452A1 (en) | 1997-04-24 |
| CA2233452C true CA2233452C (en) | 2002-04-02 |
Family
ID=8221369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002233452A Expired - Fee Related CA2233452C (en) | 1995-10-17 | 1996-10-14 | Customer queuing arrangement |
Country Status (11)
| Country | Link |
|---|---|
| US (1) | US5867572A (en) |
| EP (1) | EP0856220B1 (en) |
| JP (1) | JPH11514515A (en) |
| KR (1) | KR19990064287A (en) |
| CN (1) | CN1200215A (en) |
| AU (1) | AU7310596A (en) |
| CA (1) | CA2233452C (en) |
| DE (1) | DE69632142T2 (en) |
| NO (1) | NO981725L (en) |
| NZ (1) | NZ320374A (en) |
| WO (1) | WO1997015136A1 (en) |
Families Citing this family (69)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3548352B2 (en) * | 1996-10-25 | 2004-07-28 | キヤノン株式会社 | Remote camera control system, apparatus and method |
| US5982873A (en) * | 1997-03-07 | 1999-11-09 | Lucent Technologies Inc. | Waiting-call selection based on objectives |
| US6940962B1 (en) * | 1997-06-11 | 2005-09-06 | Estech Systems, Inc. | Dial on-hold |
| US6023681A (en) * | 1997-08-11 | 2000-02-08 | At&T Corp. | Method and apparatus for predicting queuing delays |
| US6330326B1 (en) * | 1998-03-27 | 2001-12-11 | At&T Corp. | Dynamic staffing of service centers to provide substantially zero-delay service |
| JP2000293387A (en) * | 1999-04-05 | 2000-10-20 | Nec Corp | Event notification system |
| US6724877B1 (en) * | 1999-06-11 | 2004-04-20 | Siemens Information And Communication Networks, Inc. | User specified hold recall treatment |
| US6694009B1 (en) * | 1999-06-15 | 2004-02-17 | Avaya Technology Corp. | Estimation of a work item's wait-time from the present stages of processing of preceding work items |
| US6829583B1 (en) * | 1999-12-20 | 2004-12-07 | International Business Machines Corporation | Method and apparatus to determine mean time to service |
| 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 |
| US8482488B2 (en) * | 2004-12-22 | 2013-07-09 | Oakley, Inc. | Data input management system for wearable electronically enabled interface |
| US20120105740A1 (en) | 2000-06-02 | 2012-05-03 | Oakley, Inc. | Eyewear with detachable adjustable electronics module |
| JP4092388B2 (en) * | 2000-11-10 | 2008-05-28 | 富士通株式会社 | Service providing method using network and service providing system using the same |
| 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 |
| US7013009B2 (en) | 2001-06-21 | 2006-03-14 | Oakley, Inc. | Eyeglasses with wireless communication features |
| US7110525B1 (en) | 2001-06-25 | 2006-09-19 | Toby Heller | Agent training sensitive call routing system |
| JP2003108838A (en) * | 2001-09-27 | 2003-04-11 | Fujitsu Ltd | Method for providing queue eliminating information, and method for reservation |
| US7130411B2 (en) * | 2001-12-03 | 2006-10-31 | International Business Machines Corporation | Hold queue position publication |
| US6959081B2 (en) * | 2001-12-03 | 2005-10-25 | International Business Machines Corporation | Expert hold queue management |
| US20030108159A1 (en) * | 2001-12-12 | 2003-06-12 | International Business Machines Corporation | Destination device based callee identification |
| US7003466B2 (en) * | 2001-12-12 | 2006-02-21 | International Business Machines Corporation | Destination device initiated caller identification |
| US9088645B2 (en) * | 2001-12-12 | 2015-07-21 | International Business Machines Corporation | Intermediary device initiated caller identification |
| US7167551B2 (en) * | 2001-12-12 | 2007-01-23 | International Business Machines Corporation | Intermediary device based callee identification |
| US7139390B2 (en) * | 2001-12-12 | 2006-11-21 | International Business Machines Corporation | Promoting use of experts to callers waiting in a hold queue |
| US7245716B2 (en) | 2001-12-12 | 2007-07-17 | International Business Machines Corporation | Controlling hold queue position adjustment |
| US7215759B2 (en) * | 2001-12-12 | 2007-05-08 | International Business Machines Corporation | Hold queue wait estimations |
| US7068767B2 (en) * | 2001-12-14 | 2006-06-27 | Sbc Holdings Properties, L.P. | Method and system for providing enhanced caller identification information including screening invalid calling party numbers |
| US6977998B2 (en) * | 2001-12-17 | 2005-12-20 | International Business Machines Corporation | Destination device billing according to call recipient |
| US7443970B2 (en) * | 2001-12-17 | 2008-10-28 | International Business Machines Corporation | Logging calls according to call context |
| US6956935B2 (en) * | 2001-12-17 | 2005-10-18 | International Business Machines Corporation | Origin device billing according to caller |
| US7372952B1 (en) | 2002-03-07 | 2008-05-13 | Wai Wu | Telephony control system with intelligent call routing |
| US7095841B2 (en) | 2002-03-29 | 2006-08-22 | Avaya Technology Corp. | Queued task/queued resource state forecaster |
| US9818136B1 (en) | 2003-02-05 | 2017-11-14 | Steven M. Hoffberg | System and method for determining contingent relevance |
| US7676034B1 (en) | 2003-03-07 | 2010-03-09 | Wai Wu | Method and system for matching entities in an auction |
| US8724796B2 (en) | 2003-09-30 | 2014-05-13 | Avaya Inc. | Estimation of expected value for remaining work time for contact center agents |
| DE10360276A1 (en) * | 2003-12-20 | 2005-07-28 | Deutsche Telekom Ag | Switching network node in public communications network has at least one subscriber circuit associated with device for placing at least one incoming connection in queue and for processing connections in queue |
| US8229101B1 (en) * | 2004-09-30 | 2012-07-24 | Virtual Hold Technology, Llc | Punctuality call center metric |
| NO325319B1 (en) * | 2004-12-10 | 2008-03-31 | Telenor Asa | Method and system for serving clients requesting a service from a service provider |
| US8874477B2 (en) | 2005-10-04 | 2014-10-28 | Steven Mark Hoffberg | Multifactorial optimization system and method |
| US20070121873A1 (en) * | 2005-11-18 | 2007-05-31 | Medlin Jennifer P | Methods, systems, and products for managing communications |
| US20070127652A1 (en) * | 2005-12-01 | 2007-06-07 | Divine Abha S | Method and system for processing calls |
| US7773731B2 (en) * | 2005-12-14 | 2010-08-10 | At&T Intellectual Property I, L. P. | Methods, systems, and products for dynamically-changing IVR architectures |
| US7577664B2 (en) * | 2005-12-16 | 2009-08-18 | At&T Intellectual Property I, L.P. | Methods, systems, and products for searching interactive menu prompting system architectures |
| US20070206747A1 (en) * | 2006-03-01 | 2007-09-06 | Carol Gruchala | System and method for performing call screening |
| US7961856B2 (en) * | 2006-03-17 | 2011-06-14 | At&T Intellectual Property I, L. P. | Methods, systems, and products for processing responses in prompting systems |
| US8050392B2 (en) * | 2006-03-17 | 2011-11-01 | At&T Intellectual Property I, L.P. | Methods systems, and products for processing responses in prompting systems |
| US8300798B1 (en) | 2006-04-03 | 2012-10-30 | Wai Wu | Intelligent communication routing system and method |
| WO2008076774A2 (en) | 2006-12-14 | 2008-06-26 | Oakley, Inc. | Wearable high resolution audio visual interface |
| CN100584055C (en) * | 2007-01-26 | 2010-01-20 | 华为技术有限公司 | Method and system for transmitting position information for queuing system |
| US20080246592A1 (en) * | 2007-04-03 | 2008-10-09 | Adam Waalkes | System and method for managing customer queuing |
| US7927413B2 (en) | 2007-04-17 | 2011-04-19 | Astec, Inc. | Method and apparatus for making asphalt concrete using foamed asphalt cement |
| US20090074166A1 (en) * | 2007-09-14 | 2009-03-19 | Virtual Hold Technology, Llc. | Expected wait time system with dynamic array |
| EP2278782B1 (en) * | 2008-05-05 | 2016-10-19 | Alcatel Lucent | A method and equipment for providing information to the user terminal in the call waiting queue |
| CN102148905B (en) * | 2010-02-10 | 2014-06-11 | 华为技术有限公司 | Method and device for queuing calls |
| CN102479400A (en) * | 2010-11-24 | 2012-05-30 | 王军 | Dining queuing system |
| US10579947B2 (en) * | 2011-07-08 | 2020-03-03 | Avaya Inc. | System and method for scheduling based on service completion objectives |
| EP2973533A4 (en) | 2013-03-15 | 2016-11-30 | Oakley Inc | Electronic ornamentation for eyewear |
| CN205691887U (en) | 2013-06-12 | 2016-11-16 | 奥克利有限公司 | Modular communication system and glasses communication system |
| US9172810B2 (en) * | 2013-06-27 | 2015-10-27 | Avaya Inc. | System and method for calculating context-aware estimated wait time for customers |
| CN105450879B (en) * | 2014-08-14 | 2018-08-31 | 阿里巴巴集团控股有限公司 | The method and apparatus that user of incoming call is handled |
| AU2015343339A1 (en) | 2014-11-03 | 2017-06-15 | Genentech, Inc. | Methods and biomarkers for predicting efficacy and evaluation of an OX40 agonist treatment |
| CN108566346A (en) * | 2018-03-14 | 2018-09-21 | 阿里巴巴集团控股有限公司 | The processing method and processing device of network request |
| CN108577709B (en) * | 2018-05-07 | 2020-08-11 | 北京小米移动软件有限公司 | Intelligent mop working method and device and storage medium |
| CN109688282B (en) * | 2019-03-01 | 2021-05-18 | 中国联合网络通信集团有限公司 | Call processing method, device, server and storage medium |
| CN111696533B (en) * | 2020-06-28 | 2023-02-21 | 中国银行股份有限公司 | Network point robot self-adjusting method and device |
| DE102020005262A1 (en) * | 2020-08-27 | 2022-03-03 | Joynext Gmbh | Method and driver assistance system for predicting the availability of a charging station for a vehicle |
| CN113096295B (en) * | 2021-04-06 | 2022-10-18 | 中国工商银行股份有限公司 | Numbering method, numbering device, electronic equipment and computer readable storage medium |
| TWI778679B (en) * | 2021-06-22 | 2022-09-21 | 臺北醫學科技股份有限公司 | Method for queuing and the related electronic device |
| TWI798158B (en) * | 2021-06-22 | 2023-04-01 | 臺北醫學科技股份有限公司 | Method for queuing and the related electronic device |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4788715A (en) * | 1986-10-16 | 1988-11-29 | American Telephone And Telegraph Company At&T Bell Laboratories | Announcing waiting times in queuing systems |
| US5020095A (en) * | 1988-11-16 | 1991-05-28 | Dytel Corporation | Interactive call distribution processor |
| US5025468A (en) * | 1989-05-04 | 1991-06-18 | Harris Corporation | Computerized system for incoming calls |
| JP2901077B2 (en) * | 1989-07-19 | 1999-06-02 | 株式会社東芝 | Telephone system |
| US5309505A (en) * | 1991-05-20 | 1994-05-03 | Inventions, Inc. | Automated voice system for improving agent efficiency and improving service to parties on hold |
| JPH06232982A (en) * | 1993-02-02 | 1994-08-19 | Fujitsu Ltd | Distribution control system for incoming call |
| US5600710A (en) * | 1994-07-08 | 1997-02-04 | Bellsouth Corporation | Method for providing a recorded message to a telephone caller when called number is busy |
| US5506898A (en) * | 1994-07-12 | 1996-04-09 | At&T Corp. | Expected wait-time indication arrangement |
-
1996
- 1996-02-20 US US08/603,104 patent/US5867572A/en not_active Expired - Lifetime
- 1996-10-14 DE DE69632142T patent/DE69632142T2/en not_active Expired - Lifetime
- 1996-10-14 AU AU73105/96A patent/AU7310596A/en not_active Abandoned
- 1996-10-14 KR KR1019980702781A patent/KR19990064287A/en not_active Application Discontinuation
- 1996-10-14 CA CA002233452A patent/CA2233452C/en not_active Expired - Fee Related
- 1996-10-14 NZ NZ320374A patent/NZ320374A/en unknown
- 1996-10-14 JP JP9515598A patent/JPH11514515A/en active Pending
- 1996-10-14 CN CN96197667A patent/CN1200215A/en active Pending
- 1996-10-14 WO PCT/GB1996/002520 patent/WO1997015136A1/en active IP Right Grant
- 1996-10-14 EP EP96934997A patent/EP0856220B1/en not_active Expired - Lifetime
-
1998
- 1998-04-16 NO NO981725A patent/NO981725L/en not_active Application Discontinuation
Also Published As
| Publication number | Publication date |
|---|---|
| CN1200215A (en) | 1998-11-25 |
| AU7310596A (en) | 1997-05-07 |
| NZ320374A (en) | 2000-04-28 |
| EP0856220B1 (en) | 2004-04-07 |
| EP0856220A1 (en) | 1998-08-05 |
| CA2233452A1 (en) | 1997-04-24 |
| WO1997015136A1 (en) | 1997-04-24 |
| NO981725D0 (en) | 1998-04-16 |
| JPH11514515A (en) | 1999-12-07 |
| KR19990064287A (en) | 1999-07-26 |
| DE69632142T2 (en) | 2005-03-03 |
| US5867572A (en) | 1999-02-02 |
| DE69632142D1 (en) | 2004-05-13 |
| NO981725L (en) | 1998-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2233452C (en) | Customer queuing arrangement | |
| US5467391A (en) | Integrated intelligent call blending | |
| US5506898A (en) | Expected wait-time indication arrangement | |
| US5946388A (en) | Method and apparatus for priority queuing of telephone calls | |
| US6263065B1 (en) | Method and apparatus for simulating central queue for distributing call in distributed arrangement of automatic call distributors | |
| US5530744A (en) | Method and system for dynamic customized call routing | |
| EP0755144B1 (en) | Prediction of a caller's motivation as a basis for selecting treatment of an incoming call | |
| US6639982B1 (en) | Method and apparatus for agent forcing and call distribution for large team call servicing | |
| US5519773A (en) | Call sharing for inbound and outbound call center agents | |
| US9648170B2 (en) | System and method for providing call-back options | |
| US5524147A (en) | Method for forming a virtual call center | |
| JP4209046B2 (en) | Method and apparatus for processing communication in a communication processing facility comprising a plurality of agents | |
| US5020095A (en) | Interactive call distribution processor | |
| US6879683B1 (en) | System and method for providing a call back option for callers to a call center | |
| EP0551715B1 (en) | System and method for controlling outbound and inbound calls in a telephone communication system | |
| USRE37001E (en) | Interactive call processor to facilitate completion of queued calls | |
| AU4590502A (en) | multi-site responsibility-based routing | |
| JPH07170546A (en) | Automatic call distribution network | |
| US20040081311A1 (en) | Method abandoned call rescue | |
| JP2000041110A (en) | Incoming call processing method, incoming call processing unit and recording medium recording incoming call processing program and readable by computer | |
| EP1111890B1 (en) | Automatic (dynamic) network skill-based routing | |
| Durinovic-Johri et al. | Advanced routing solutions for toll-free customers: algorithm design and performance | |
| AU6662700A (en) | Customer queuing arrangement | |
| CA2338290A1 (en) | Call queuing in a telecommunications network | |
| AU753610B2 (en) | Remote ACD data base modification via telephone |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |