Queue length in an absolute priority system with hyperexponential input flow (Q1759140)

The paper under review studies a single-server queueing system with two priority classes operating under the absolute priority. The service times of interrupted customers are assumed to be restarted, i.e., they have the same distribution as that of original service time. The service time distribution of customers of the \(i\)th priority class is \(B_i(x)\), \(i=1,2\). The service times are assumed to be mutually independent, and they are independent of the interarrival times. The input flow is recurrent, and the probability density function of the interarrival time is given as \[ a(x)=\sum_{j=1}^Nc_ja_j\exp(-a_jx), \;x\geq0, \] where \(a_i\neq a_j\) for \(i\neq j\), \(a_i>0\) and \(c_i>0\) for \(i=1,2,\dotsc,N\), \(\sum_{i=1}^Nc_i=1\). An arriving customer belongs with probability \(p_i\) to the \(i\)th priority class, \(p_1+p_2=1\), and the first class has an absolute priority. Assuming that at the initial moment the system is free from customers, the authors derive the joint generating function of the two-dimensional queue-length process at time \(t\).