A semigroup approach to queueing systems (Q2464350)

The authors consider the following queueing system consisting of two machines separated by a finite storage buffer of capacity \(N\). At the first machine, there are always requests which are served consecutively according to exponential processing times (rate \(\lambda\)). If the service of a request at the first machine is finished then, with probability \(1-\eta_1\), the request is reprocessed by the first machine; with probability \(\eta_1\) the request is transferred into the buffer if there is at least one place free; otherwise, the first machine is blocked by the request until there is a place free in the buffer. The buffer feeds the second machine. The service times are generally distributed with hazard rate \(\mu(x)\) satisfying the condition \(\lim_{x\to\infty}\mu(x)=\mu>0\). After finishing service with probability \(\eta_2\in(0,1)\), the request leaves the system and with probability \(1-\eta_2\) it is reprocessed by the second machine immediately. For this model, the authors prove asymptotic stability of the solutions of the partial differential equations (Kolmogorov equations) for the time-dependent densities of the state process. They use the approach by \textit{G.\,Gupur} [Acta Anal.\ Funct.\ Appl.\ 5, No.\,3, 193--209 (2003; Zbl 1052.47069)] by applying the theory of \(C_0\)-semigroups and the spectral theory of positive operators.