Check examples

Last Updated : Jun 04, 2019 |
Prolog information
Metadata
Keywords:
When using the check command to queue a call to backup splits, ensure that an adequate time has elapsed before checking the backup splits again.
Note:
With EWT, the programming style used in this example is not optimal. The best approach is to use EWT to locate an appropriate split for the call and queue the call.

Continuous check

The following example checks the backup splits continuously as long as the call is in queue.
1. queue-to split 1 pri h
2. announcement 3000
3. wait-time 10 seconds hearing music
4. check split 21 pri m if available-agents > 0
5. check split 22 pri m if available-agents > 0
6. check split 23 pri m if available-agents > 0
7. check split 24 pri m if available-agents > 0
8. check split 25 pri m if available-agents > 0
9. goto step 4 if unconditionally

Check with 10 second delay

The following example adds a delay of 10 seconds to ensure that some time has elapsed before checking the backup splits again.
1. queue-to split 1 pri h
2. announcement 3000
3. wait-time 30 seconds hearing music
4. check split 21 pri m if available-agents > 0
5. check split 22 pri m if available-agents > 0
6. check split 23 pri m if available-agents > 0
7. check split 24 pri m if available-agents > 0
8. check split 25 pri m if available-agents > 0
9. wait-time 10 seconds hearing music
10. goto step 4 if unconditionally
Agent availability status cannot change every 10 seconds.

Check with 30 second delay

The following example adds a delay of 30 seconds to ensure that some time has elapsed before checking the backup splits again.
1. queue-to split 1 pri h
2. announcement 3000
3. wait-time 30 seconds hearing music
4. check split 21 pri m if available-agents > 0
5. check split 22 pri m if available-agents > 0
6. check split 23 pri m if available-agents > 0
7. check split 24 pri m if available-agents > 0
8. check split 25 pri m if available-agents > 0
9. wait-time 30 seconds hearing music
10. goto step 4 if unconditionally
The following table 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.
Approximate number of vector steps executed for check examples
Initial conditions
Example
continuous check
Example
check with 10-second delay
Example
check with 30-second delay
An agent is available in split 1
1
1
1
Queuing time of 5 minutes
up to 1,000
190
65
If a call is queued for 5 minutes, the number of vector steps drop dramatically under the following two conditions:
  • when a delay is added before checking the backup splits again
  • when the length of the delay is increased again
When an agent in split 1 is immediately available to answer the call, there is no difference in the number of vector steps for the three examples.