Abstract
Entropy maximisation is applied to characterise the distributional form of the steady-state probabilities of a G/G/ c/PR queue with c (≥ 2) parallel servers and R (≥ 2) priority classes under preemptive resume (PR) rule. For R = 2, closed-form expressions are derived as explicit functions of appropriate but unknown constraints which are approximately determined using analytical results for GE-type queues. The applicability of the maximum entropy (ME) solutions for R = 2 is also extended to the case of R > 2 via the method of class aggregation. Typical numerical results are presented to illustrate the credibility of ME approximations against simulations. Comments on the role of the GE/GE/ c/PR queue as a building block for the approximate analysis of arbitrary queueing networks are included.
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.
