Summary
A new “hybrid” analytic framework, based on the principle of maximum entropy, is used to derive a closed form expression for the queue length distribution of a G/G/1 finite capacity queue. It is shown that “Birth-Death” homogeneous recursions for a single resource queue are special cases of maximum entropy “one-step” transitions which can be applied either in an operational or stochastic context. Furthermore, an “equivalence” relationship is used to analyse two-stage cyclic queueing networks with general service times, and favourable comparisons are made with global balance and approximate results. Numerical examples provide useful information on how critically system behaviour is affected by the distributional form of interarrival and service patterns. Comments on the implication of the work to the performance analysis and aggregation of computer systems are included.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Mitrani, I.: Nonpriority multiprogramming system under heavy demand conditions — customer's viewpoint. JACM 19, 445–452 (1972)
Reiser, M., Kobayashi, H.: The effects of service time distributions on system performance. Proc. IFIP Congress 74, pp. 230–234. Stockholm, Amsterdam 1974
Franta, W.R.: The mathematical analysis of the computer system modelled as a two-stage cyclic queue. Acta Inf. 6, 187–209 (1976)
Sauer, C.H., Chandy, K.M.: Computer systems performance modelling. Englewood Cliffs, N.J.: Prentice-Hall 1981
Courtois, P.J.: Decomposability: queueing and computer system applications. New York: Academic Press 1977
Buzen, J.P.: Fundamental operational laws of computer system performance. Acta Inf. 7, 167–182 (1976)
Denning, P.J., Buzen, J.P.: The operational analysis of queueing network models. Comput. Surv. 10, 225–261 (1978)
Lavenberg, S.S.: The steady-state queueing time distribution for the M/G/1 finite capacity queue. Manage. Sci. 21, 501–506 (1975)
El-Affendi, M.A., Kouvatsos, D.D.: A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium. Acta Inf. 19, 339–355 (1983)
Gelenbe, E., Pujolle, G.: The behaviour of a single queue in a general queueing network. Acta Inf. 7, 123–160 (1976)
Badel, M., Shum, A.V.Y.: Accuracy of an approximate computer system model, Proc. of Modelling and Performance Evaluation of Computer Systems, pp. 11–33. Amsterdam: North-Holland 1976
Buzen, J.P.: Operational analysis: An alternative to stochastic modelling, in Performance of Computer Installations. (D. Ferrari, ed.), pp. 175–194. Amsterdam: North-Holland 1978
Buzen, J.P., Denning, P.J.: Measuring and calculating queue length distributions. Comput. IEEE 13, 33–44 (1980)
Jaynes, E.T.: Prior probabilities, IEEE Trans. Syst. Sci. Cyber. SSC-4, 227–241 (1968)
Shore, J.E., Johnson, R.W.: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Trans. Inf. Theory, IT-26, 26–37 (1980)
Shore, J.E.: Information theoretic approximations for M/G/1 and G/G/1 queueing systems. Acta Inf. 17, 43–61 (1982)
Bard, Y.: A model of shared DASD and multipathing. CACM, 23, 564–572 (1980)
Cantor, J.L.: Information theoretic analysis for a multi-server queueing system of equilibrium with applications to queues in tandem. M.Sc. Thesis, Electrical Engineering Dept., University of Maryland, USA, April 1981
Kouvatsos, D.D.: Maximum entropy methods for general queueing networks. Proc. Int. Conf. Modelling Techniques and Tools for Performance Analysis. (D. Potier, ed.). pp. 589–608. Amsterdam: North-Holland 1985
Allen, A.O.: Probability, statistics, and queueing theory with computer science applications. New York: Academic Press 1978
Johnson, R.W.: Determining probability distributions by maximum entropy and minimum cross-entropy. Proc. APL79, ACM 0-89791-005, 24–29 (1979)
Tribus, M.: Rational description, decisions and designs. New York: Pergamon Press 1969
Rose, C.A.: Measurement procedure for queueing network models of computer systems. Comput. Surv. 10, 263–280 (1978)
Kouvatsos, D.D., El-Affendi, M.A.: On the analysis of the G/G/1 queue. Res. Rep. CCR18, Univ. of Bradford. (Submitted for publication)
Morgan, M.W.: The simulation of computer systems — DEMOS implementation and maximum entropy applications. M.Sc. Dissertation, Univ. of Bradford, 1983
Veran, M., Potier, D.: QNAP-2: A portable environment for queueing network modelling. Proc. Int. Conf. on Modelling Techniques and Tools for Performance Analysis, INRIA, May 1984
Whitt, W.: On approximations for queue, III: Mixtures of exponential distributions, AT & T BLTJ 63, 163–175 (1984)
Bondi, A.B.: Modelling the effect of local area networks contention on the performance of host computers, Performance 84 (E. Gelenbe ed.), pp. 303–318. Amsterdam: North-Holland 1984
Walstra, B.R.: Iterative analysis of networks of queues. Ph.D. Thesis, Tech. Rep. CSRI-166, Toronto Univ., December 1984
Kouvatsos, D.D.: A maximum entropy queue length distribution for a G/G/1 finite capacity queue. Proc. “Performance '86 and ACM Sigmetrics 1986”, North Carolina State University, USA, May 1986
Kouvatsos, D.D., Almond, J.: Two-station cyclic queues with multiple servers of GE-type Papers of Int. Workshop on “Computer Performance Evaluation”, INRIA, France, April 1986
Author information
Authors and Affiliations
Additional information
Some of the material included in this paper has been presented to the “Performance '86 and ACM Sigmetrics 1986” Joint Conference on Computer Modelling, Measurement and Evaluation, May 28–30, 1986, University of North Carolina, USA
Rights and permissions
About this article
Cite this article
Kouvatsos, D.D. Maximum entropy and the G/G/1/N queue. Acta Informatica 23, 545–565 (1986). https://doi.org/10.1007/BF00288469
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288469