A fast simulator for tandem queueing systems

Abstract A simulator based on a recursive expression of the sample path is presented. It can quickly simulate tandem queueing systems with single server stations and finite buffer sizes. We show that the computational cost (simulation run time) is related linearly to the number of stations and the number of customers, while the storage cost (memory space requirement) has a linear relationship with the number of stations and the sum of buffer spaces of all stations. Compared to the event-scheduling based simulator, the fast simulator can save more computational cost in larger systems. This simulator's logic is clear, and it uses only simple data structures and procedures. The simulator is written in only 160 lines of C code which is executable under any operating environment which supports standard C language. Speed, simplicity, and portability are the strengths of the simulator.