Linking priority queues and tree-like processes

This paper links the analysis of a general class of priority queues with three service classes with tree-like processes. This is realized by demonstrating that the operation of a 3-class priority queue can be mimicked by means of an alternate system that is composed of a single stack and queue. Some insights on how to reduce the evolution of this alternate system to a tree-like process are provided, allowing an efficient solution of the priority system through matrix analytic methods.