CQNET - A Package for Performance Analysis of Closed Queueing Networks

In this paper an approximate procedure for the performance analysis of closed queueing networks with N stations and K total jobs is developed and discussed. Each station has a single server and an exponentially distributed service time with mean value 1/spl mu/i ( far i= 1,2,3 . . ..N ). The service discipline is based on First Come First served scheduling. To avoid deadlock, an assumption is made such that the total number of jobs in the network at any time may not exceed the total capacity of the network. The procedure so developed studies the behaviour of the system. By increasing the number of Jobs in the entire network various performance measurements are made. Comparison of the results obtained by the approximation method with the exact results demonstrates that the approximate method has reasonable accuracy.