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, 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.

[1]  O. Yu,et al.  Queueing tables and graphs , 1981 .

[2]  Yukio Takahashi,et al.  A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS , 1976 .

[3]  Per Hokstad,et al.  Approximations for the M/G/m Queue , 1978, Oper. Res..

[4]  Rodney W. Johnson,et al.  Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.

[5]  Katsuhiko Ogata,et al.  Modern Control Engineering , 1970 .

[6]  Rodney W. Johnson.  Determining probability distributions by maximum entropy and minimum cross-entropy , 1979, APL.

[7]  Donald P. Gaver,et al.  Approximate Models for Processor Utilization in Multiprogrammed Computer Systems , 1973, SIAM J. Comput..

[8]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[9]  R. Weinstock.  Calculus of Variations: with Applications to Physics and Engineering , 1952 .

[10]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[11]  David D. Yao,et al.  Refining the Diffusion Approximation for the M/G/m Queue , 1985, Oper. Res..

[12]  A. Federgruen,et al.  Approximations for the steady-state probabilities in the M/G/c queue , 1981, Advances in Applied Probability.

[13]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[14]  Yukio Takahashi.  Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue , 1981, Advances in Applied Probability.