This paper considers two approaches to the numerical solution of single node queueing models. Both approaches use a phase-type distribution to model very general service processes. The first approach ...

Performance analysis of queueing networks is one of the most challenging areas of queueing theory. Barring very specialized models such as product-form type queueing networks, there exist very few ...

Markov chains and queueing theory together provide a robust framework for analysing systems that evolve randomly over time. Markov chains describe stochastic processes where the future state depends ...