Acta Informatica

, Volume 26, Issue 3, pp 241–267 | Cite as

Maximum entropy two-station cyclic queues with multiple general servers

  • Demetres D. Kouvatsos
  • John Almond


The efficient implementation and extension of various approximate methods for general queueing networks require the study of two-station cyclic queues. In this paper maximum entropy formalism is used to analyse two-station cyclic queues with multiple general servers and a fixed number of jobs. New robust “one step” recursions for the queue length distribution are derived and asymptotic connections to infinite capacity queues are established. Links with Birth-Death and global balance solutions are determined and extensions to load dependent servers with Bernoulli feedback are presented. Numerical examples provide useful information on how critically system behaviour is affected by the distributional form of service times and simple bounds for typical performance measures such as throughout and mean queue length are defined. Moreover, the utility of the work as a “building block” for the approximate analysis of a general central server model is demonstrated.


Service Time Maximum Entropy Queue Length Length Distribution Approximate Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kouvatsos, D.D., Almond, J.: Two-station cyclic queues with multiple servers of GE-type. Tech. Rep. #DDK/JA0, Univ. of Bradford (1986)Google Scholar
  2. 2.
    Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260 (1975)Google Scholar
  3. 3.
    Gordon, W.J., Newell, G.F.: Cyclic queueing systems with restricted length queues. Oper. Res. 15, 266–278 (1967)Google Scholar
  4. 4.
    Chandy, K.M., Herzog, U., Woo, L.: Approximate analysis of general queueing networks. IBM J. Res. Dev. 19, 43–49 (1975)Google Scholar
  5. 5.
    Sauer, C.H., Chandy, K.M.: Approximate analysis of central server models. IBM J. Res. Dev. 19, 301–313 (1975)Google Scholar
  6. 6.
    Gelenbe, E., Pujolle, G.: The behaviour of a single queue in a general queueing network. Acta Inf. 7, 123–136 (1976)Google Scholar
  7. 7.
    Pujolle, G., Soula, C.: A study of flows in queueing networks and an approximate method for solution. In: Arato, M., Butrimenko, A., Gelenbe, E. (eds.) Performance of computer systems, pp. 375–389. Amsterdam Oxford New York: North Holland 1979Google Scholar
  8. 8.
    Courtois, P.J.: Decomposability: queueing and computer systems applications. New York: Academic Press 1977Google Scholar
  9. 9.
    Buzen, J.P., Denning, P.J.: Measuring and calculating queue length distributions. Comput. IEEE 13, 33–44 (1980)Google Scholar
  10. 10.
    Kouvatsos, D.D.: Maximum entropy methods for general queueing networks. In: Potier, D. (ed.) Modelling techniques and tools for performance analysis, pp. 589–608. Amsterdam Oxford New York: North Holland 1985Google Scholar
  11. 11.
    Kouvatsos, D.D.: A universal maximum entropy algorithm for the analysis of general closed networks. In: Hasegawa, T., et al. (eds.) Computer networking and performance evaluation, pp. 113–124. Amsterdam Oxford New York: North Holland 1986Google Scholar
  12. 12.
    Walstra, R.J.: Nonexponential networks of queues: a maximum entropy analysis. Performance Eval. Rev. 13, 27–37 (1985)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Kouvatsos, D.D.: Maximum entropy and the G/G/1/N queue. Acta Inf. 23, 545–565 (1986)Google Scholar
  15. 15.
    Kouvatsos, D.D., Almond, J.: A critical investigation into approximate solutions for general queueing networks. Tech. Rep. DDK/JA2, Bradford University 1987Google Scholar
  16. 16.
    Marie, R.A.: An approximate analytical method for general queueing networks. IEEE Trans. Software Eng. SE-5, 530–538 (1979)Google Scholar
  17. 17.
    Sevcik, K.C., Levy, A.I., Tripathi, S.K., Zahorjan, J.L.: Improving approximations of aggregated queueing network systems. In: Chandy, K.M., Reiser, M. (eds.) Computer performance, pp. 1–22. Amsterdam Oxford New York: North Holland 1977Google Scholar
  18. 18.
    Marie, R.A.: Calculating equilibrium probabilities for λ(n)/C k /1/N queues. Performance Eval. Rev. 2, 117–125 (1980)Google Scholar
  19. 19.
    Franta, W.R.: The mathematical analysis of the computer system modelled as a two-stage cyclic queue. Acta Inf. 6, 187–209 (1976)Google Scholar
  20. 20.
    Hodstad, P.: Approximations for the M/G/m queue. Oper. Res. 26, 510–523 (1978)Google Scholar
  21. 21.
    Badel, M., Shum, A.V.Y.: Accuracy of an approximate computer system model. In: Gelenbe, E., et al. (eds.) Modelling and performance evaluation of computer systems, pp. 11–33. Amsterdam Oxford New York: North Holland 1976Google Scholar
  22. 22.
    Veran, M., Potier, D.: QNAP-2: a portable environment for queueing network modelling. In: Potier, D. (ed.) Modelling techniques and tools for performance analysis, pp. 25–63. Amsterdam Oxford New York: North Holland 1985Google Scholar
  23. 23.
    Seelen, L.P., Tijms, H.C., Van-Hoorn, M.H.: Tables for multiserver queues. Amsterdam Oxford New York: North Holland 1985Google Scholar
  24. 24.
    Stewart, W.J., Marie, R.A.: A numerical solution for the λ(n)/C k /r/N queue. Eur. J. Oper. Res. 5, 56–68 (1980)Google Scholar
  25. 25.
    Nance, R.E., Narayan Bhat, U.: A processor utilisation model for a multiprocessor computer system. Oper. Res. 26, 881–895 (1978)Google Scholar
  26. 26.
    Makino, T.: On the mean passage time concerning some queueing problems of the tandem type. J. Oper. Res. Soc. Jpn. 7, 17–47 (1964)Google Scholar
  27. 27.
    Cantor, J.L.: Information theoretic analysis for a multiserver queueing system at equilibrium with applications to queues in tandem. MSc Thesis, Elec. Eng. Dept., Univ. of Maryland, USA (1984)Google Scholar
  28. 28.
    Chaudhry, M.C., Templeton, J.G.C.: A first course in bulk queues. New York: Whiley 1983Google Scholar
  29. 29.
    Heyman, D.P.: Comments on a queueing inequality. Manage. Sci. 10, 956–959 (1980)Google Scholar
  30. 30.
    Sobel, M.J.: Simple inequalities for multiserver queues. Manage. Sci. 26, 951–956 (1980)Google Scholar
  31. 31.
    Kingman, J.F.C.: The heavy traffic approximation in the theory of queues. Proceedings of the Symposium on congestion theory, pp. 137–169. University of North Carolina 1964Google Scholar
  32. 32.
    Sakasegawa, H.: An approximation formula L q≈αϱn(1-ϱ). Ann. Inst. Stat. Math. 29, 67–75 (1977)Google Scholar
  33. 33.
    Pujolle, G.: Files d'attente avec Dépendence de l'éate. Proc. of SMF/AFCET Congrés, Palaiseau (1978)Google Scholar
  34. 34.
    Agrawal, S.C., Buzen, J.P., Shum, A.W.: Response time preservation: a general technique for developing approximate algorithms for queueing networks. Performance Eval. Rev. 12, 63–77 (1984)Google Scholar
  35. 35.
    Tripathi, S.K.: On approximate solution techniques for queueing network models of computer systems. PhD thesis, Toronto University (1979)Google Scholar
  36. 36.
    Shum, A.W.: Queueing models for computer systems with general service time distributions. PhD thesis, Harvard University, Cambridge, Mass. (1976)Google Scholar
  37. 37.
    Marsan, M.A., Conte, G., Balbo, G.: A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems. ACM Trans. Comput. Syst. 2, 93–122 (1984)Google Scholar
  38. 38.
    Sauer, C.H.: Configuration of computer systems: an approach using queueing network models. PhD Thesis, University of Texas (1975)Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Demetres D. Kouvatsos
    • 1
  • John Almond
    • 1
  1. 1.Schools of ComputingUniversity of BradfordBradfordUK

Personalised recommendations