Skip to main content

MEM for Closed Exponential Queueing Networks with RS-Blocking and Multiple Job Classes

  • Chapter
Performance Engineering of Computer and Telecommunications Systems

Abstract

A new product-form approximation, based on the method of entropy maximisation (MEM), is characterised for arbitrary closed exponential queueing networks with multiple classes of jobs, mixed service disciplines and repetitive-service (RS) blocking with random destination (RS-RD). The ME approximation implies decomposition of the network into individual multiple class M/M/l/N queues, satisfying constraints on population and flow conservation, and it is, in turn, truncated and efficiently implemented by a convolution type recursive procedure. Numerical validation results against simulation are included to demonstrate the credibility of typical ME performance metrics.

Supported in the part by the Engineering and Physical Sciences reseach Council (EPSRC), UK, under grants GR/H/18609 and GR/K/67809 and in part by British Council

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.O. Onvural, Survey of Closed Queueing Networks with Blocking, ACM Comput. Surv. Vol. 22(2), 83–121, 1990.

    Article  Google Scholar 

  2. H.G.Perros, Approximation Algorithms for Open Queuing Networks with Blocking, Stochastic Analysis of Computer and Communication Systems, H. Takagi (ed.), North Holland, pp. 451–494, 1990.

    Google Scholar 

  3. H.G.Perros, Queueing Networks with Blocking. Oxford University Press, 1994.

    Google Scholar 

  4. I.F.Akyildiz and H. Von Brand, Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking, Theoret comput Sci. Vol. 64, 203–219, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  5. I.F.Akyildiz and H. Von Brand, Computational Algorithm for Networks of Queues with Rejection Blocking, Acta Inform. Vol. 26, 559–576, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  6. I.F.Akyildiz and H. Von Brand, Central Server Models with Multiple Job Classes, State Dependent Routing and Rejection Blocking, IEEE Trans. Software Eng. Vol. 15, pp. 1305–1312, 1989c.

    Article  Google Scholar 

  7. T. Choukri, Exact Analysis of Multiple Job Classes and Different Types of Blocking, R.O. Onvural and I.F.Akyildiz, eds., Proc. 2nd International Workshop on Queueing Networks with Finite Capacity, Research Triangle Park, pp. 25–40, May 1992.

    Google Scholar 

  8. I.F.Akyildiz and C.C.Huang, Exact Analysis of Multi-Job Class Networks of Queues with Blocking-After Service, Proc. 2nd International Workshop on Queueing Networks with Finite Capacity, R.O. Onvural and LF.Akyildiz, (eds.), Research Triangle Park, pp. 258–271, May 1992.

    Google Scholar 

  9. D.D. Kouvatsos and N.P. Xenios, MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-Service Blocking, Performance Evaluation, Vol. 10(3), 1989.

    Google Scholar 

  10. D.D kouvatsos and S.G. Denazis, MEM for Arbirary Queueing Networks with Blocking: A Revision, Technical Report CS-18–91, University of Bradford. May 1991.

    Google Scholar 

  11. D.D. Kouvatsos and S.G. Denazis, Entropy Maximised Queueing Networks with Blocking and Multiple Job Classes, Performance Evaluation, Vol. 17, pp. 189–205, 1993.

    Article  MATH  Google Scholar 

  12. D.D. Kouvatsos, Maximum Entropy and the G/G/l/N Queue, Acta Informatica, Vol. 23, pp. 545–565, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  13. F. Baskett, K.M. Chandy, R.R. Muntz and F.G. Palacios, Open, Closed and Mixed Networks of Queues with Different Classes of Customers, J. ACM, Vol. 22(2), pp. 248–260, 1975.

    Article  MathSciNet  Google Scholar 

  14. D.D. Kouvatsos, A Universal Maximum Entropy Algorithm for the Analysis of General Closed Networks, Computer Networking and Performance evaluation, Hasegawa, T. et al. (eds.), North Holland, pp. 113–124, 1986.

    Google Scholar 

  15. R. Walstra, Iterative Analysis of Networks of Queues, Ph.D. Thesis, Tech. Rep. CSE1–166, Toronto Univ., 1984.

    Google Scholar 

  16. S.C. Bruell and G. Ballbo, Computational Algorithm for Closed Queueing Networks, North Holland, New York, 1980.

    Google Scholar 

  17. J. Labetoulle, and G. Pujolle, Isolation Method in a Network of Queues, IEEE Transaction on Software Eng., Vol SE-6 pp. 373–381, 1980.

    Google Scholar 

  18. M. Veran and Potier D. QNAP-2: A Portable Environment for Queueing Network Modelling Techniques and Tools for Performance Analysis, Potier D. (ed.), North Holland, pp. 25–63, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag London Limited

About this chapter

Cite this chapter

Kouvatsos, D.D., Awan, IU. (1996). MEM for Closed Exponential Queueing Networks with RS-Blocking and Multiple Job Classes. In: Merabti, M., Carew, M., Ball, F. (eds) Performance Engineering of Computer and Telecommunications Systems. Springer, London. https://doi.org/10.1007/978-1-4471-1007-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1007-1_11

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-76008-5

  • Online ISBN: 978-1-4471-1007-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics