Simulation Graph Duality: A World View Transformation For Simple Queueing Models

Planar graphs play an important role in real world applications, partly due to the fact that some practical problems can be efficiently solved for planar graphs while they are intractable for general graphs. Simulation Graph Models of simple queueing systems are planar graphs. Their geometric duals can then be constructed. In the context of queueing models, this dualization process represents a transformation from the event scheduling to the activity scanning world view in discrete event simulation. The so-called primal-dual pair of models provides an alternative but equivalent representation of these stochastic systems.