Example of maintaining FIFO processing with LAI

Last Updated : Sep 08, 2012 |

One of the advantages of enhanced LAI is the ability to provide FIFO or near-FIFO call processing. The following example shows a vector that is used to achieve such call processing.

FIFO processing vector


1. announcement 3501
2. wait-time 0 secs hearing music
3.  queue-to skill 1 pri m
4. goto step 7 if interflow-qpos < 9
5. wait-time 30 secs hearing music
6. goto step 5 if interflow-qpos >= 9
7. route-to number 93031234567 with cov n if interflow-qpos = 1
8. route-to number 99089876543 with cov n if interflow-qpos = 1
9. wait-time 5 secs hearing music
10. goto step 7 if unconditionally

In this vector:

  • The rapid look-ahead loop is only entered when the call reaches one of the top 8 positions in queue.

  • The number of executed vector steps is reduced dramatically when call waiting times are long.

It is important to write vectors so that calls at the head of the queue have advanced to the rapid look-ahead loop by the time their turn to interflow has been reached. In the vector example shown above, if 8 calls can be serviced from queue in less than 30 seconds (which is the loop time on step 5), there can be a delay in outflowing calls to available agents at the remote sites.