We introduce a process similar to the birth-death process and use it as a starting point for defining queueing models much in the same way as the birth-death process can be used for this purpose. Steady-state distributions for this process and the corresponding queues are derived. Generalizations allowing nonexponential service times are also studied.
Keywords Queueing models - birth-death process - insensitivity - quasireversibility - processor sharing - last-in-first-served