Systems with multiple servers are common in many areas and their correct dimensioning is in general a difficult problem under realistic assumptions on the pattern of user arrivals and service time distribution. We present an approximate solution for the underlying Ph/Ph/c/N queueing model. Our approximation decomposes the solution of the Ph/Ph/c/N queue into solutions of simpler M/Ph/c/N and Ph/M/c/N queues. It is conceptually simple, easy to implement and produces generally accurate results for the mean number in the system, as well as the loss probability. A significant speed advantage compared to the numerical solution of the full Ph/Ph/c/N queue can be gained as the number of phases representing the arrival process and/or the number of servers increases
