Skip to main content
SpringerLink
Log in

Arbitrary open queueing networks with server vacation periods and blocking

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

A cost-effective decomposition algorithm is proposed for the approximate analysis of arbitrary first-come-first-served (FCFS) open queueing network models (QNMs) with Generalised Exponential (GE) external interarrival time and service time distributions, multiple vacation periods, exhaustive service scheme and repetitive service blocking of random destination (RS-RD). The algorithm is based on a new product-form approximation suggested by the information theoretic principle of Minimum Relative Entropy (MRE), subject to marginal mean value constraints and a prior joint distribution estimate of the corresponding open QNM with infinite capacity. The censored GEyGEy1yN queue with exponential server vacations is solved via relative entropy minimisation and in conjunction with associated effective flow streams (departure, splitting, merging), plays the role of an efficient building block in the solution process. An exhaustive validation study against simulation is included to illustrate the credibility of the MRE results.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Labetoulle and G. Pujolle, Isolation method in a network of queues, IEEE Trans. Soft. Eng. SE-6(1980)373 - 381.

    Google Scholar 

  2. Y. Takahashi, H. Miyara and T. Hasegawa, An approximation method for open restricted queueing networks, Oper. Res. 28(1980)594 - 602.

    Google Scholar 

  3. T. Altiok, Approximate analysis of exponential tandem queues with blocking, European J. Oper. Res. 11(1982)390 - 398.

    Google Scholar 

  4. A. Brandwajn and Y.L. Jow, Tandem exponential queues with finite buffers, in: Computational Networking and Performance Evaluation, eds. Hasegawa et al., North-Holland, 1985, pp. 245 - 257.

  5. H.G. Perros and T. Altiok, Approximate analysis of open networks of queues with blocking: Tandem configurations, IEEE Trans. Soft. Eng. SE-12(1986)450 - 461.

    Google Scholar 

  6. T. Altiok and H.G. Perros, Approximate analysis of arbitrary configurations of queueuing networks with blocking, Annals of Oper. Res. 9(1987)481 - 509.

    Google Scholar 

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

  8. H.G. Perros, Approximation algorithms for open queueing networks with blocking, in: Stochastic Analysis of Computer and Communication Systems, ed. H. akagi, North-Holland, 1990, pp. 451 - 494.

  9. L. Kerbache and J. MacGregor Smith, The generalised expansion method for open finite queueing networks, Eur. J. Oper. Res. 32(1987)448- 461.

    Google Scholar 

  10. D.D. Kouvatsos and N.P. Xenios, MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking, Perf. Eval. 10(1989)106-195.

    Google Scholar 

  11. D.D. Kouvatsos and S.G. Denazis, MEM for arbitrary queueing networks with repetitive-service blocking under random routing, Tech. Report CS-18-91 Comp. Systems Modelling Group, Univ. of Bradford, 1991.

  12. D.D. Kouvatsos and S.G. Denazis, Entropy maximised queueing networks with blocking and multiple job classes, Perf. Eval. 17(1993)189 - 205.

    Google Scholar 

  13. D.D. Kouvatsos and C.A. Skianis, Minimum Relative Entropy analysis and queues with vacation time, 10th UKPEW '94, 1994, pp. 67 - 78.

  14. D.D. Kouvatsos and C.A. Skianis, MRE analysis of open exponential queueing networks with server vacations and blocking, Tech. Report CS-12-95 Comp. Systems Modelling Group, Univ. of Bradford, 1995.

  15. B.T. Doshi, Queueing systems with vacations - a survey, Queueing Systems 1(1986)29-66.

    Google Scholar 

  16. D.D. Kouvatsos, Entropy maximisation and queueing network models, Annals Oper. Res. 48(1994) 63 -126.

    Google Scholar 

  17. D. Yao and J.A. Buzacott, Modelling a class of state-dependent routing in flexible manufacturing systems, Annals Oper. Res. 3(1985)153 - 167.

    Google Scholar 

  18. J.E. Shore and R.W. Johnson, Properties of cross entropy minimisation, IEEE Trans. Inf. Theory IT-27(1981)472 - 482.

    Google Scholar 

  19. S. Kullback, Information Theory and Statistics, Wiley, New York, 1959.

    Google Scholar 

  20. A. Wehrl, Entropy, Rev. Mod. Phys. 50(1978)221 - 260.

    Google Scholar 

  21. E.T. Jaynes, Information theory and statistical mechanics I, Phys. Rev. 106(1957)620- 630.

    Google Scholar 

  22. E.T. Jaynes, Information theory and statistical mechanics II, Phys. Rev. 108(1957)171 - 190.

    Google Scholar 

  23. D.D. Kouvatsos, A maximum entropy analysis of the G/G/1 queue at equilibrium, J. Oper. Res. Soc. 39(1988)183 - 200.

    Google Scholar 

  24. R.J. Walstra, Iterative analysis of networks of queues, Ph.D. Thesis, University of Toronto, 1984.

  25. C. Sauer, Configuration of computing systems: An approach using queueing network models, Ph.D. Thesis, University of Texas, 1975.

  26. S. Nojo and H. Watanabe, A new stage method getting arbitrary coefficients of variation by two stages, Trans. IEICE 70(1987)33 - 36.

    Google Scholar 

  27. H. Takagi, Queueing Analysis. A Foundation of Performance Evaluation, Vol. 2: Finite Systems, North-Holland, 1993.

  28. Y. Baba, On the MX/G/1 queue with vacation time, Operations Research Letters 5(1986)93 - 98.

    Google Scholar 

  29. S.W. Fuhrmann and R.B. Cooper, Stochastic decompositions in the M/G/1 queue with generalised vacations, Oper. Res. 33(1985)1117 -1129.

    Google Scholar 

  30. M. Scholl and L. Kleinrock, On the M/G/1 queue with rest periods and certain service-independent queueing disciplines, Oper. Res. 31(1983)705 - 719.

    Google Scholar 

  31. H. Takagi, Queueing Analysis. A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, North-Holland, 1993.

  32. R.L. Burden and J.D. Faires, Numerical Analysis, 3rd ed., PWS Publishers, 1985.

  33. M. Veran and D. Potier, QNAP-2: A portable environment for queueing network modelling, Proc. Int. Conf. on Modelling Techniques and Tools for Performance Analysis, INRIA, 1984.

  34. K.M. Chandy, U. Herzog and L. Woo, Approximate analysis of general queueing networks, IBM J. Res. Develop. 19(1975)50 - 57.

    Google Scholar 

  35. C.A. Skianis and D.D. Kouvatsos, Performance analysis of a shared medium ATM switch architecture, 12th UK Computer and Telecommunications Performance Engineering Workshop, eds. J. Hillston and R. Pooley, The University of Edinburgh, 1996, pp. 33 - 48.

Download references

Authors
  1. Charalabos A. Skianis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Demetres D. Kouvatsos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skianis, C.A., Kouvatsos, D.D. Arbitrary open queueing networks with server vacation periods and blocking. Annals of Operations Research 79, 143–180 (1998). https://doi.org/10.1023/A:1018966520483

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018966520483

Search

Navigation