A two-queue, one-server model with priority for the longer queue (Q1109435)

The queueing model studied consists of one server fed by two Poissonian arrival streams. Each stream has its own waiting room and (general) service time distribution. If upon a service completion the two queues are unequal in length, then the server proceeds with a customer from the longer queue, otherwise the server chooses with some probability a customer from one of the queues. The author derives a functional equation for the generating function of the stationary joint distribution of the number of customers of both types in the system just after a service completion, and shows that the solution of this equation can be reduced to a Riemann boundary value problem which he subsequently solves. The special case of exponential service times is treated in detail and some numerical results for this case are obtained and compared to the corresponding results for the single-queue model.