An approximate solution of the heterogeneous multi-server queueing problem

The exact solution of the M/M/m/k queuing problem for the case of different capacity servers requires extensive process time and memory space. An approximation method which reduces the necessary solution effort drastically is proposed. Rather than the utilization of each link, overall system performance is computed in terms of steady-state system population probabilities. The efficiency and accuracy of the proposed method are compared with the exact solution and the feasibility of the approximation is demonstrated.