This equation, known as Little’s formula, is particularly useful because it is valid for any scheduling algorithm and arrival distribution.
We can use Little’s formula to compute one of the three variables if we know the other two.
For example, if we know that 7 processes arrive every second (on average) and that there are normally 14 processes in the queue,
then we can compute the average waiting time per process as 2 seconds.