A unified algorithm for computing the stationary queue length distributions inM(k)/G/1/Nand GI/M(k)/1/N queues

摘要

An iterative algorithm is developed for computing numerically the stationary queue length distributions in M/G/1/N queues with arbitrary state-dependent arrivals, or simply M(k)/G/1/N queues. The only input requirement is the Laplace-Stieltjes transform of the service time distribution.