Maximum Entropy Analysis of Multiple-server Queueing Systems
研究了稳态下多服务器排队系统，用最大熵方法和渐近性质推导顾客数与等待时间的近似公式，并通过数值例子检验准确性。
AbstractThis 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, we 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, we present several numerical examples for illustration.Keywords: information theoryqueueing