A fast simulation approach for tandem queueing systems

The authors present a novel simulation approach which is based on a recursive expression of sample path and can be applied to single-server tandem queueing systems. Numerical results show that compared with the event-scheduling-based simulation, the simulation can dramatically save run time, particularly for large-scale systems. In most of the cases studied, the run time ratio falls between 20% and 50%. That is, compared to the traditional simulator, the fast simulator may save 50% to 80% of the run time.<<ETX>>