Maximum entropy analysis of multiple-server queueing systems

This paper deals with a general queueing system with many servers in steady state. Applying the method of entropy maximization with several constraints and the asymptotic property of the GI/G/c queueing systems, the authors provide approximate formulae for the distributions of the number of customers and the waiting time. In order to examine the accuracy of the approximate formulae, they present several numerical examples for illustration.