Lattice path counting and the theory of queues

In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like M a / M b / 1 systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto–Hahn model or systems with preemptive priorities.