Fast Simulation of Open Queueing Systems

Abstract

We describe a technique developed by the authors for fast simulation of open queueing networks. The technique takes advantage of the recursive nature of departure times of customers in various parts of the system. The event calendar is circumvented using these recursive relationships whenever possible. A framework for identifying these recursive aspects of a network is presented. The technique involves identifying the servers in the system at which flows merge or diverge. Knowledge about the merge and diverge points defines the dependency relationships a specific customer has with other customers at each point in the system. The concept of a system level is based on these dependency relationships.