A Fast Simulation Model Based on Lindley’s Recursion for the G/G/1/K Queue

Algorithm 1

Number of entities served between the arrivals of and , .

Input: The last entity attended until the arrival of entity , at the begin ;

the -th arrival epoch ; the departures epochs previous to .

Output: Number of entities served between the arrival of and , .

1: for  to    do

2:if    then

3:

4:

5:brake the for loop.

6:end if

7: end for