Construction of the stationary regime of queues with locking (Q1110926)

The authors consider a queueing system with N servers and two types of customers: Simple customers who require a service from one of the N servers and Locking customers who have to be served simultaneously by all N servers. Only stationarity and ergodicity of the input and service processes are assumed thus relaxing the various known independence and exponentiality assumptions. The aim is on the one hand to find the adequate stability condition for the present situation and on the other hand to build and analyze the stationarity trend of this system. An increasing diagram showing both the existence and uniqueness of the stationary waiting times under the stability condition is analyzed by extending an argument of \textit{R. M. Loynes} [Proc. Cambridge Phil Soc. 58, 497-520 (1962; Zbl 0203.223)] for simple G/G/1 queues. (Based on the authors' introduction).