The combinatorics of birth–death processes and applications to queues

Abstract

In this paper we present a combinatorial technique which allows the derivation of the transition functions of general birth–death processes. This method provides a flexible tool for the transient analysis of Markovian queueing systems with state dependent transition rates, like M/M/c models or systems with balking and reneging.