Markovian controllable queueing systems with hysteretic policies: Busy period and waiting time analysis (Q2583518): Difference between revisions

The paper considers a queueing system with hysteretic policy. Customers arrive according to a Poisson process. The service station can provide service at various controlled rates \(\{ \mu _k ;0 \leqslant k \leqslant N\} \), where \(\mu _0 = 0\) and \(\mu _k < \mu _{k + 1} \). The mechanism for activating and releasing the service capacity is characterized by two sequences of integers \(\{ R_k ;1 \leqslant k \leqslant N\} \) and \(\{ S_k ;0 \leqslant k \leqslant N - 1\} \) such that \(R_k < R_{k + 1} \), \(S_k < S_{k + 1} \), \(S_k < R_{k + 1} \) and \(S_0 = 0\). Whenever the queue length reaches from below the value \(R_k\), then the service rate increases from \(\mu _{k - 1} \) to \(\mu _k \). On the other hand, whenever the system drops from above to the value \(S_k \), then the service rate decreases from \(\mu _{k + 1} \) to \(\mu _k \). The paper investigates algorithmically the busy period and the waiting time distributions.