Skip to main content
Log in

Computational algorithms for networks of queues with rejection blocking

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Open, closed and mixed queueing networks with reversible routing, multiple job classes and rejection blocking are investigated. In rejection blocking networks blocking event occurs when upon completion of its service of a particular station's server, a job attempts to proceed to its next station. If, at that moment, its destination station is full, the job is rejected. The job goes back to the server of the source station and immediately receives a new service. This is repeated until the next station releases a job and a place becomes available. In the model jobs may change their class membership and general service time distributions depending on the job class are allowed. Two station types are considered: Either the scheduling discipline is symmetric, in which case the service time distributions are allowed to be general and dependent on the job class or the service time distributions at a station are all identical exponential distributions, in which case more general scheduling disciplines are allowed. An exact product form solution for equilibrium state probabilities is presented. Using the exact product form solution of the equilibrium state distribution, algorithms for computation of performance measures, such as mean number of jobs and throughputs, are derived. The complexity of the algorithms is discussed.

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

Access this article

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. Akyildiz, I.F.: Exact Analysis of Queueing Networks with Rejection Blocking. Proc. Int. Conf. “Queueing Networks with Finite Capacities”, pp. 24–36. Amsterdam: North-Holland 1988

    Google Scholar 

  2. Akyildiz, I.F., von Brand, H.: Dual and Selfdual Networks of Queues with Rejection Blocking. Comput. J. (To appear)

  3. Akyildiz, I.F., von Brand, H.: Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking. J. Theor. Comput. Sci. (1989) (To appear)

  4. Balsamo, S., Iazeolla, G.: Some Equivalence Properties for Queueing Networks with and without Blocking. Proc. Performance 83 Conference, pp. 351–360. Amsterdam: North Holland 1983

    Google Scholar 

  5. Barbour, A.: Networks of Queues and the Method of Stages. Adv. Appl. Probab. 8, 584–591 (1976)

    Google Scholar 

  6. Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, Closed and Mixed Networks of Queues with Different Classes of Customers, J. A.C.M. 22, 248–260 (1975)

    Google Scholar 

  7. Buzen, J.P.: Queueing Network Models of Multiprogramming. Ph.D. Thesis, Div. Eng. Appl. Sci., Harvard Univ., Cambridge, Mass., Aug. 1971

    Google Scholar 

  8. Caseau, P., Pujolle, G.: Throughput Capacity of a Sequence of Queues with Blocking due to Finite Waiting Room. IEEE Trans. Software Eng. SE-5, 631–642 (1979)

    Google Scholar 

  9. Chandy, K.M., Martin, A.J.: A Characterization of Product Form Queueing Networks. J. A.C.M. 30, 286–299 (1983)

    Google Scholar 

  10. Cohen, J.W.: The Multiple Phase Service Network with Generalized Processor Sharing. Acta Inf. 12, 245–284 (1979)

    Google Scholar 

  11. van Dijk, N.M., Tijms, H.: Insensitivity in Two-Node Blocking Models with Applications. Proc. Teletraffic Anal. Comput. Perform. Evaluation, pp. 329–340. Amsterdam: North-Holland 1986

    Google Scholar 

  12. van Dijk, N.M., Akyildiz, I.F.: Networks of Mixed Processor Sharing Parallel Queues and Common Pools. Technical Report, Georgia Tech., GIT-ICS-88-022, June 1988

  13. Gordon, W.J., Newell, G.F.: Cyclic Queueing Systems with Restricted Queues. Oper. Res. 15, 266–277 (1967)

    Google Scholar 

  14. Hordijk, A., van Dijk, N.M.: Networks of Queues with Blocking. Proc. Performance '81, pp. 51–65. Amsterdam: North Holland 1981

    Google Scholar 

  15. Hordijk, A., van Dijk, N.M.: Adjoint Processes, Job-Local-Balance and Insensitivity of Stochastic Networks. Bull. 44th Session Int. Stat. Inst. 50, 776–788 (1982)

    Google Scholar 

  16. Hordijk, A., van Dijk, N.M.: Networks of Queues. Part I: Job-Local-Balance and the Adjoint Process. Part II: General Routing and Service Characteristics. Proc. Int. Conf. Modeling Comput. Syst. Vol. 60, pp. 158–205. Berlin Heidelberg New York: Springer 1983

    Google Scholar 

  17. Kelly, F.P.: Networks of Queues with Customers of Different Types. J. Appl. Probab. 12, 542–554 (1975)

    Google Scholar 

  18. Kelly, F.P.: Reversibility and Stochastic Networks. New York: Wiley 1979

    Google Scholar 

  19. Noetzel, A.S.: A Generalized Queueing Discipline for Product Form Network Solutions. J. ACM 26, 779–793 (1979)

    Google Scholar 

  20. Onvural, R.O., Perros, H.G.: On Equivalencies of Blocking Mechanisms in Queueing Networks with Blocking. Oper. Res. Lett. 5, 293–297 (1986)

    Google Scholar 

  21. Pittel, B.: Closed Exponential Networks of Queues with Saturation. The Jackson-Type Stationary Distribution and its Asymptotic Analysis. Math. Oper. Res. 357–378 (1979)

  22. Reiser, M., Kobayashi, H.: Queueing Networks with Multiple Closed Chains: Theory and Computational Algorithms. IBM J. Res. Dev. 19, 283–294 (1975)

    Google Scholar 

  23. Reiser, M., Kobayashi, H.: Horner's Rule for the Evaluation of General Closed Queueing Networks. Commun. ACM 18, 592–593 (1975)

    Google Scholar 

  24. Samelson, C.H., Bulgren, W.G.: A Note on Product Form Solution for Queueing Networks with Poisson Arrivals and General Service Time Distributions with Finite Means. J. ACM 29, 830–840 (1982)

    Google Scholar 

  25. Sauer, C.H., Chandy, K.M.: Computer Systems Performance Modeling. Englewood Cliffs, N.J.: Prentice Hall 1981

    Google Scholar 

  26. Spirn, J.: Queueing Networks with Random Selection for Service. IEEE Trans. Software Eng. SE-5, 287–289 (1979)

    Google Scholar 

  27. Tijms, H.J.: Stochastic Modeling and Analysis: A Computational Approach. Chichester: John Wiley 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akyildiz, I.F., von Brand, H. Computational algorithms for networks of queues with rejection blocking. Acta Informatica 26, 559–576 (1989). https://doi.org/10.1007/BF00263580

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00263580

Keywords

Navigation