Abstract
The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of true expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuous-time and discrete-time Queueing Network Models (QNMs) at equilibrium under Repetitive-Service (RS) blocking and Arrivals First (AF) or Departures First (DF) buffer management policies. An ME application to the performance modelling of a shared-buffer Asynchronous Transfer Mode (ATM) switch architecture is also presented. The ME solutions are implemented subject to Generalised Exponential (GE) and Generalised Geometric (GGeo) queueing theoretic mean value constraints, as appropriate. In this context, single server GE and GGeo type queues in conjunction with associated effective flow streams (departure, splitting, merging) are used as building blocks in the solution process. Physical interpretations of the results are given and extensions to the quantitative analysis of more complex queueing networks are discussed.
Chapter PDF
Bibliography
Baskett, F., Baskett, K.M., Muntz, R.R. and Palacios, F.G., Open, Closed and Mixed Networks with Different Classes of Customers, JACM 22, 2 (1975) 248–260.
Reiser, M. and Kobayashi, H., Queueing Networks with Mulitple Closed Chains: Theory and Computational Algorithms, IBM J. Res. & Dev. 19 (1975) 283–294.
Marie, R., An Approximate Analytical Method for General Queueing Networks, IEEE Trans. on Software Eng. SE-5, No. 5 (1979) 530–538.
Reiser, M. and Kobayashi, H., Accuracy of the Diffusion Approximation for Some Queueing Systems, IBM J. Res. & Dev. 18 (1974) 110–124.
Gelenbe, E. and Pujolle, G., The Behaviour of a Single Queue in a General Queueing Network, Acta Info. 7 (1976) 123–160.
Courtois, P.J., Decomposability: Queueing and Computer Systems Applications, Academic Press Inc., New York (1977).
Chandy, K.M., Herzog, U. and Woo, L., Approximate Analysis of General Queueing Networks, IBM J. Res. & Dev. 19 (1975) 43–49.
Kelly, F.P., Reversibility and Stochastic networks, Wiley, New York (1979).
Bryant, R.M., Krzesinski, A.E., Lasmi, M.S. and Chandy, K.M., The MVA Priority Approximation, T.O.C.S. 2(4) (1984) 335–359.
Altiok, T. and Perros, H.G., Approximate Analysis of Arbitrary Configurations of Queueing Networks with Blocking, Annals of OR (1987) 481–509.
Van Dijk, N.M., A Simple Bounding Methodology for Non-Product-Form Queueing Networks with Blocking, Queueing Networks with Blocking, Perros, H.G. and Altiok, T. (Eds.), North-Holland (1980) 3–18.
Akyildiz, I.F. and Von Brand, H., Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking, Theoret. Comput. Sci. 64 (1989) 203–219.
Perros, H.G., Approximation Algorithms for Open Queueing Networks with Blocking, Stochastic Analysis of Computer and Communication Systems, Takagi (Ed.), North-Holland (1990) 451–494.
Onvural, R.O., Survey of Closed Queueing Networks with Blocking, ACM Computing Surveys 22, 2 (1990), 83–121.
Hsu, J. and Burke, P.J., Behaviour of Tandem Buffers with Geometric Input and Markovian Output, IEEE Trans. Commun. 25, (1976) 2–29.
Bharath-Kumar, K., Discrete-Time Queueing Systems and their Networks, IEEE Trans. on Commun. 28, 2, (1980) 260–263.
Hunter, J.J., Mathematical Techniques of Applied Probability, Vol. 2, Discrete-time Models: Techniques and Applications, Academic Press (1983).
Kobayashi, H., Discrete-Time Queueing Systems, Chapter 4 of Probability Theory and Computer Science, Louchard, G. and Latouche, G. (Eds.), Academic Press (1983).
Pujolle, G., Discrete-time Queueing Systems for Data Networks Performance Evaluation, Queueing, Performance and Control in ATM, Cohen, J.W. and Pack, C.D. (Eds.), North-Holland, (1991) 239–244.
Gravey, A. and Hebuterne, G., Simultaneity in Discrete-time Single Server Queues with Bernoulli Inputs, Performance Evaluation, 14, (1992) 123–131.
Benes, V.E., Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York (1965).
Ferdinand, A.E., A Statistical Mechanical Approach to Systems Analysis, IBM J. Res. Dev. 14 (1970) 539–547.
Pinsky, E. and Yemini, Y., A Statistical Mechnics of Some Interconnection Networks, Performance '84, Gelenbe, E. (Ed.), North-Holland (1984) 147–158.
Pinsky, E and Yemini, Y., The Canonical Approximation in Performance Analysis, Computer Networking and Performance Evaluation, Hasegawa, T. et al. (Eds.), North-Holland (1986) 125–137.
Shore, J.E., Information Theoretic Approximations for M/G/1 and G/G/1 Queueing Systems, Acta Info. 17 (1982) 43–61.
El-Effendi, M.A. and Kouvatsos, D.D., A Maximum Entropy Analysis of the M/G/1 and G/M/1 Queueing Systems at Equilibrium, Acta Info. 19 (1983) 339–355.
Kouvatsos, D.D., Maximum Entropy Methods for General Queueing Networks, Modelling Techniques and Tools for Performance Analysis, Potier, D. (Ed.), North-Holland (1985) 589–609.
Kouvatsos, D.D., A Universal Maximum Entropy Algorithm for the Analysis of General Closed Networks, Computing Networking and Performance Evaluation, Hasegawa, T. et al. (Eds.), North-Holland (1986) 113–124.
Jaynes, E.T., Information Theory and Statistical Mechanics, Phys, Rev. 106, 4 (1957) 620–630.
Jaynes, E.T., Information Theory and Statistical Mechanics II, Phys. Rev. 108, 2 (1957) 171–190.
Jaynes, E.T., Prior Probabilities, IEEE Trans. Systems Sci. Cybern. SSC-4 (1968) 227–241.
Shannon, C.E., A Mathematical Theory of Communication, Bell Syst. Tech. J. 27 (1948) 379–423, 623–656.
Shore, J.E., Derivation of Equilibrium and Time-Dependent Solutions of M/M/∞/N and M/M/∞ Queueing Systems Using Entropy Maximisation, Proc. 1978 National Computer Conference, AFIPS (1978) 483–487.
Cantor, J., Ephremides, A. and Horton, D., Information Theoretic Analysis for a General Queueing System at Equilibrium with Application to Queues in Tandem, Acta Info. 23 (1986) 657–678.
Lutton, J.L., Bonomi, E. and Felix, M.R., Information Theory and Statistical Mechanics Approach to Solving a Queueing Problem Encountered in Telephone Exchanges, Research Report PA/1199, Division ATR — Centre National d'Etudes des Telecommunications, France (1984).
Walsta, R., Iterative Analysis of Networks of Queues, PhD Thesis, Technical Report CSE1-166, University of Toronto, Canada (1984).
Guiasu, S., Maximum Entropy Condition, in Queueing Theory, J. Opl. Res. Soc. 37, 3 (1986) 293–301.
Rego, V. and Szpankowski, W., The Presence of Exponentiality in Entropy Maximised M/GI/1 Queues, Computers Opns. Res. 16, 5 (1989) 441–449.
Kouvatsos, D.D., A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium, J. Opl. Res. Soc. 39, 2 (1989) 183–200.
Kouvatsos, D.D., Maximum Entropy and the G/G/1/N Queue. Acta Info. 23 (1986) 545–565.
Arizono, I., Cui, Y. and Ohta, H., An Analysis of M/M/s Queueing Systems Based on the Maximum Entropy Principle, J. Opl. Res. Soc. 42, 1 (1991) 69–73.
Kouvatsos, D.D. and Almond, J., Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers, Acta info. 26 (1988) 241–267.
Wu, J.S. and Chan, W.C., Maximum Entropy Analysis of Multiple-Server Queueing Systems, J. Opl. Res. Soc. 40, 9 (1989) 815–825.
Strelen, C., Piecewise Approximation of Densities Applying the Principle of Maximum Entropy: Waiting Time in G/G/1-Systems, Modelling Techniques and Tools for Computer Performance Evaluation, Puigjaner, R. and Potier, D. (Eds.), Plenum Press (1989) 421–438.
Kouvatsos, D.D. and Tabet-Aouel, N.M., A Maximum Entropy Priority Approximation for a Stable G/G/1 Queue, Acta Info. 27 (1989) 247–286.
Tabet-Aouel, N.M. and Kouvatsos, D.D., On an Approximation to the Mean Response Times of Priority Classes in a Stable G/G/c/PR Queue, J. Opl. Res. Soc., 43, 3 (1992) 227–239.
Kouvatsos, D.D. and Tabet-Aouel, N.M., An ME-Based Approximation for Multi-Server Queues with Preemptive Priority, To appear in the European Journal of Operational Research (1993).
Kouvatsos, D.D. and Georgatsos, P.H., General Queueing Networks with SQJ Routing, Proc. 5th UK Perf. Eng. Workshop, University of Edinburgh, September 1988.
Falin, G., Martin, G.I. and Artaleo, J., Information Theoretic Approximations for the M/G/1 Retrial Queue, To appear in Acta Infomatica.
Kouvatsos, D.D., Georgatsos, P.H. and Tabet-Aouel, N.M., A Universal Maximum Entropy Algorithm for General Multiple Class Open Networks with Mixed Service Disciplines, Modelling Techniques and Tools for Computer Performance Evaluation, Puigjaner, R. and Potier, D. (Eds.), Plenuum Publishing Corporation (1989) 397–419.
Kouvatsos, D.D. and Tabet-Aouel, N.M., Product-Form Approximations for an Extended Class of General Closed Queueing Networks, Performance '90, King, P.J.B. et al. (Eds.), North-Holland (1990) 301–315.
Kouvatsos, D.D. and Tabet-Aouel, N.M., Approximate Solutions for Networks of Queues with Multiple Server Stations under PR Discipline, Proc. 8th UK Perf. Eng. Workshop, Harrison, P. and Field, T. (Eds.), Imperial College, London, 1992.
Kouvatsos, D.D. and Xenios, N.P., Maximum Entropy Analysis of General Queueing Networks with Blocking, Queueing Networks with Blocking, Perros, H.G. and Altiok, T. (Eds.), North-Holland, Amsterdam (1989) 281–309.
Kouvatsos, D.D. and Xenios, N.P., MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-Service Blocking, Perf. Eval. 10 (1989) 169–195.
Kouvatsos, D.D., Denazis, S.G. and Georgatsos, P.H., MEM for Arbitrary Exponential Open Networks with Blocking and Multiple Job Classes, Proc. 7th Perf. Eng. Workshop, Hillston, J. et al. (Eds.), Springer-Verlag (1991) 163–178.
Kouvatsos, D.D. and Denazis, S.G., Entropy Maximised Queueing Networks with Blocking and Multiple Job Classes, Perf. Eval. 17 (1993) 189–205.
Kouvatsos, D.D. and Georgatsos, P.H., Queueing Models of Packet-Switched Networks with Locally Adaptive Routing, Teletraffic and Datatraffic in Period of Change, ITC-13, Jensen, A. and Iversen, V.B. (Eds.), North-Holland (1991) 303–308.
Kouvatsos, D.D. and Denazis, S.G., Comments on and Tuning to: MEM for Arbitrary Queueing Networks with Repetitive-Service Blocking under Random Routing, Technical Report CS-18-91, University of Bradford, (May 1991).
Kouvatsos, D.D. and Denazis, S.G., A Universal Building Block for the Approximate Analysis of a Shared Buffer ATM Switch Architecture, Annals of Operations Research (to appear).
Kouvatsos, D.D. and Tabet-Aouel, N.M., GGeo-type Approximations for General Discrete-Time Queueing Systems, Proc. IFIP Workshop TC6 on Modelling and Performance Evaluation of ATM Technology, Pujolle, G. et al. (Eds.), La Martinique, North-Holland (1993) (to appear).
Kouvatsos, D.D., Tabet-Aouel, N.M. and Denazis, S.G., A Discrete-Time Queueing Model of a Shared Buffer ATM Switch Architecture with Bursty Arrivals, Proc. of 10th UK Teletraffic Symposium, IEE, BT Labs., Ipswich (1993) 19/1–19/9.
Kouvatsos, D.D. and Tabet-Aouel, N.M., The GGeo/G/1 Queue under AF and DF Buffer Management Policies, Proc. of 1st UK Workshop on Performance Modelling and Evaluation of ATM Networks, Kouvatsos, D.D. (Ed.), University of Bradford (1993) 7/1–7/11.
Kouvatsos, D.D., Tabet-Aouel, N.M. and Denazis, S.G., ME-Based Approximations for General Discrete-Time Queueing Models, Res. Rep. CS-11-93, Department of Computing, University of Bradford (1993).
Kouvatsos, D.D., Tabet-Aouel, N.M. and Denazis, S.G., Approximate Analysis of Discrete-Time Networks with or without Blocking, Proc. of 5th International Conference on Data Communication Systems and their Performances, Viniotis, Y. and Perros, H. (Eds.), (to appear).
Tribus, M., Rational Description, Decisions and Designs, Pergamon, New York (1969).
Shore, J.E. and Johnson, R.W., Axiomatic Derivation of the Principle of ME and the Principle of Minimum Cross-Eentropy, JEEE Trans. Info. Theory TI-26 (1980) 26–37.
Sauer, C., Configuration of Computing Systems: An Approach Using Queueing Network Models, PhD Thesis, University of Texas (1975).
Nojo, S. and Watanabe, H., A New Stage Method Getting Arbitrary Coefficient of Variation by Two Stages, Trans. IEICE 70 (1987) 33–36.
Devault, M., Cochennec, J.Y. and Servel, M., The Prelude ATD Experiment: Assessments and Future Prospects, IEEE J. Sac, 6(9) (1988) 1528–1537.
Iliadis, I., Performance of a Packet Switch with Shared Buffer and Input Queueing, Teletraffic and Datatraffic in a Period of Change, ITC-13, Jensen, A. and Iversen, V.B. (Eds), North-Holland (1991), 911–916.
Yamashita, H., Perros, H.G. and Hong, S., Performance Modelling of a Shared Buffer ATM Switch Architecture, Teletraffic and Datatraffic in a Period of Change, ITC-13, Jensen, A. and Iversen, V.B. (Eds), North-Holland (1991), 993–998.
Hong, S., Perros, H.G. and Yamashita, H., A Discrete-Time Queueing Model of the Shared Buffer ATM Switch with Bursty Arrivals, Res. Rep., Computer Science Department, North Carolina State University (1992).
Williams, A.C. and Bhandiwad, R.A., A Generating Function Approach to Queueing Network Analysis of Multiprogrammed Computers, Networks, 6 (1976) 1–22.
Kouvatsos, D.D. and Tomaras, P.J., Multilevel Aggregation of Central Server Models: A Minimum Relative Entropy Approach, Int. J. Systems Science, 23, 5 (1992) 713–739.
Tomaras, P.J. and Kouvatsos, D.D., MRE Hierarchical Decomposition of General Queueing Network Models, Acta Info. 28 (1991) 265–295.
Tabet-Aouel, N.M. and Kouvatsos, D.D., A Discrete-Time Maximum Entropy Solution for the Performance Analysis of DQDB Architecture, Proc. of 9th UK Perf. Eng. Workshop, Woodward, M. (Ed.), Pentech Press (1993) (to appear).
Tabet-Aouel, N.M. and Kouvatsos, D.D., Entropy Maximisation and Unfinished Work Analysis of the Logical DQDB Queue, Res. Rep. TAN/DDK 13, Department of Computing, University of Bradford (1993), 16/1–16/7.
Tabet-Aouel, N.M. and Kouvatsos, D.D., Performance Analysis of a DQDB under a Priority MAC Protocol, Proc. of 1st UK Workshop on Performance Modelling and Evaluation of ATM Networks, Kouvatsos, D.D. (Ed.), University of Bradford (1993) 24/1–24/12.
Kouvatsos, D.D., Entropy Maximisation and Queueing Network Models, Annals of Operations Research (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kouvatsos, D. (1993). Maximum entropy analysis of queueing network models. In: Donatiello, L., Nelson, R. (eds) Performance Evaluation of Computer and Communication Systems. Performance SIGMETRICS 1993 1993. Lecture Notes in Computer Science, vol 729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013856
Download citation
DOI: https://doi.org/10.1007/BFb0013856
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57297-8
Online ISBN: 978-3-540-48044-0
eBook Packages: Springer Book Archive