Abstract
Exact recursive formulas are derived for the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. Furthermore, applications of the method to other queueing systems are discussed.
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 callDisclaimer: 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.
