Use the interflow-qpos conditional to achieve first in, first out (FIFO) or near-FIFO call processing. If you do not have the interflow-qpos conditional, add a wait period between successive LAI attempts and extend the waiting period.
The following example continuously attempts an LAI as long as the call is in queue or until a look-ahead attempt succeeds.
Example: continuous look ahead - no delay
1. queue-to split 1 pri l
2. announcement 3000
3. wait-time 20 seconds hearing music
4. route-to number 93035555555 cov n if unconditionally
5. goto step 4 if unconditionally
The following example adds a delay so that the LAI attempt occurs every 10 seconds.
Example: look ahead with a 10–second delay
1. queue-to split 1 pri l
2. announcement 3000
3. wait-time 20 seconds hearing music
4. route-to number 93035555555 cov n if unconditionally
5. wait-time 10 seconds hearing music
6. goto step 4 if unconditionally
The following example increases performance by increasing the delay between the LAI attempts to 30 seconds.
Example: look ahead with a 30–second delay
1. queue-to split 1 pri l
2. announcement 3000
3. wait-time 20 seconds hearing music
4. route-to number 93035555555 cov n if unconditionally
5. wait-time 30 seconds hearing music
6. 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 when processing the call with an announcement that is 5 seconds long.
Table 1: Approximate number of vector steps executed for look-ahead interflow examples
