On the approximate solution of non-separable queueing networks

This paper proposes an approximate method to solve a queueing network with semaphores. The basic idea is to approximate the semaphore by an infinite processor center with service time equal to the semaphore delay. The semaphore delay can then be found iteratively by using the mean value analysis. The basic idea and the results are examined by using an example with simulation.