Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks (Q1945444)

The authors consider queueing networks that are not of product form. More precicely, they consider a class of two-stations closed re-entrant queueing networks under the last-buffer-first-served policy. They show how equilibrium probabilities can be obtained. When the number of customer classes in the network is five or less, they provide explicit solutions. It seems that the auhtor's model is the first class of non product form queueing networks for which explicit equilibrium probabilities can be constructed.