Filter
Top Products
Looping Examples
Issue 4 September 1995
M-7
Since the agent availability status may not be likely to change every 10 seconds,
it may make sense to increase the wait time to 30 seconds, as shown in the
example in Figure M-9.
Figure M-9. Another Example Vector with Improved Performance
Table M-2 compares the relative processing cost of the three examples by
looking at the approximate number of vector steps executed while processing
the call. Assumption is that the announcement is 5 seconds long.
When a call is queued for 5 minutes, the amount of vector steps drops
dramatically when a delay is added before checking the backup splits again
(Figure M-8), and drops even more when the length of the delay is increased
again (Figure M-9). When an agent in split 1 is immediately available to answer
the call, there is no difference in the amount of vector steps for the three
examples.
Table M-3. Approximate Number of Vector Steps Executed
for Check Backup Examples
Example in
Figure M-7
Example in
Figure M-8
Example in
Figure M-9
when a agent is available in
split 1
111
queueing time of 5 minutes up to 1,000 190 65
1. queue-to main split 1 pri h
2. announcement 3000
3. wait-time 30 seconds hearing music
4. check-backup split 21 pri m if available-agents > 0
5. check-backup split 22 pri m if available-agents > 0
6. check-backup split 23 pri m if available-agents > 0
7. check-backup split 24 pri m if available-agents > 0
8. check-backup split 25 pri m if available-agents > 0
9. wait-time 30 seconds hearing music
10. goto step 4 if unconditionally