Analyzing priority queues with 3 classes using tree-like processes (Q854994)

The authors use tree-like processes to study a general class of priority queues with three services classes. Their main result is that the queue length distributions and loss rate are obtained by applying a censoring argument on the steady state of the tree-like process. Their key approach is matrix analytic methods. Moreover, numerical examples are used to illustrate the strength of the approach.