Approximation of the Overflow Process from a G/M/N/K Queueing System

The overflow process from a G/M/N/K queueing system with a stationary counting arrival process, Markovian service times, N parallel homogeneous servers, and K waiting spaces, is asymptotically approximated by a two parameter method. Numerical results are presented and approximation outcomes are compared against those from a simulation study.