A Fast Discrete Event Simulation Model for Queueing Network Systems

Abstract

Based on Lindley's recursive equations for G/G/1 systems, this paper proposes a Fast Discrete Event Simulation (FDES) model for queueing networks. Equations for multiplexer and de-multiplexer elements are presented, which allows to simulate not only tandem but queueing networks with an arbitrary topology. Time savings obtained with FDES could speed up the analyses of large-scale queueing network systems. Experimental results show that FDES modeling can be two orders of magnitude faster than their counterparts based on the event-scheduling for practical cases.