A Solution For Multiserver And Multiclass Open Queueing Networks

In this paper, an approximate solution for a complex queueing network is proposed. The queueing network is an open network with N G/G/m queueing stations with arbitrary? interconnections. Different classes of customers served with FIFO (First In First Out) service discipline are allowed. In a previous paper we have developed an approximate solution for a G/G/m station. We extend this result to several classes of customers and to a general network. Two examples of elementary networks are analysed with this new method. Numerical results are compared with simulation results to indicate the accuracy of the solution.