.png){kind=icon}
.png){kind=icon}
Return
Joint queue-length distribution for the non-preemptive multi-server multi-level Markovian priority queue
.png){kind=icon}
PRE
AI
DOI：10.1007/s11134-026-09980-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Explicit results are obtained using simple and exact methods for the joint queue-length distribution of the M/M/c queue with an arbitrary number of non-preemptive priority levels. This work is the first to provide explicit results for the joint probability generating function and joint probability mass function for a general number of priority levels. A fixed-point iteration is developed for the stationary balance equations, which enables direct computation of the joint queue-length distribution. A multi-variate probability generating function is also derived, from which the joint probability mass function can be computed by means of a multi-dimensional fast Fourier transform method.
Keywords:
Queueing theory
Non-preemptive priority
Markovian queue
Queue-length distribution
C44
C63