Algorithms for the State Probabilities and Waiting Times in Single Server Queueing Systems with Random and Quasi-Random Input and Phase-Type Service Times

摘要

A unifying algorithmic analysis is presented for a general class of single server queueing systems with a state dependent Markovian input process and a phase type service time distribution including single server queues with random and quasirandom input. Using regenerative analysis, numerically stable and efficient recursion schemes are developed to compute the state probabilities. The computation of the waiting times is based on the state probabilities.