Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AEUE - International Journal of Electronics and Communications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
