Exact solutions for networks of queues with blocking-after-service

Abstract

The paper has two major parts. The first part deals with two-station networks with blocking-after-service (BAS) mechanism and different station types. In this part only single class of jobs is allowed. The contribution here is to show that exact solutions exist for two-station queueing networks with BAS mechanism having different station types. The exact equilibrium state probability distributions are derived. Insensitivity is investigated and formulas for performance measures are obtained. It is demonstrated that the throughput, mean number of jobs and mean number of Cblocked jobs depend on the scheduling discipline. A queueing network model with more than two stations is analyzed in the second part. Multiple-job classes with job class change, and different station types are allowed in the model. Exact solutions for equilibrium state probabilities and performance measures are obtained under the condition that only a certain total number of jobs is allowed in the network.