Skip to main content
Log in

Exact analysis of queueing networks with multiple job classes and blocking-after-service

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Two models of closed queueing networks with blocking-after-service and multiple job classes are analyzed. The first model is a network withN stations and each station has either type II or type III. The second model is a star-like queueing network, also called a central server model, in which the stations may have either type I or type IV, with the condition that the neighbors of these stations must be of type II or type III such that blocking will be caused only by this set of station types. Exact product form solutions are obtained for the equilibrium state probabilities in both models. Formulae for performance measures such as throughput and the mean number of jobs are also derived.

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.

Similar content being viewed by others

References

  1. I.F. Akyildiz, Exact product form solution for queueing networks with blocking, IEEE Trans. Comput. C-36 (1987) 122–125.

    Google Scholar 

  2. I.F. Akyildiz, On the exact and approximate throughput analysis of closed queueing networks with blocking, IEEE Trans. Software Eng. SE-14 (1988) 62–71.

    Google Scholar 

  3. I.F. Akyildiz and H.G. Perros, Special issue on queueing networks with finite capacity queues: introduction, Performance Evaluation 10 (3) (1989).

  4. I.F. Akyildiz and H. von Brand, Exact solutions for networks of queues with blocking-after-service, to appear in Theor. Comput. Sci. J. (1993).

  5. I.F. Akyildiz and J. Liebeherr, Optical deadlock free buffer allocation in multiple chain blocking networks of queues, in:Proc. Int. Conf. on the Performance of Distributed Systems and Integrated Communication Networks, September 10–12, 1991.

  6. S. Balsamo, V. De Nitto Persone and G. Iazeoalla, Identity and reducibility properties of some blocking and non-blocking mechanisms in congested networks, in:Flow Control of Congested Networks, NATO ASI Series (Springer Verlag, 1987) pp. 243–254.

  7. S. Balsamo and L. Donatiello, On the cycle time distribution in a two-stage cyclic network with blocking, IEEE Trans. Software Eng. SE-15 (10) (1989).

  8. 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 22 (1975) 248–260.

    Google Scholar 

  9. P.P. Bocharov, On the two-node queueing networks with finite capacity, in:Proc. 1st Int. Workshop on Queueing Networks with Blocking (North-Holland, 1989) pp. 105–125.

  10. F.P. Kelly, Networks of queues with customers of different types, J. Appl. Prob. 12 (1975) 542–554.

    Google Scholar 

  11. F.P. Kelly, Networks of queues, Adv. Appl. Prob. 8 (1976) 416–432.

    Google Scholar 

  12. R.O. Onvural, A note on the product form solutions of multiclass closed queueing networks with blocking, Performance Evaluation 10 (1989) 247–255.

    Google Scholar 

  13. R.O. Onvural, A survey of closed queueing networks with finite buffers, ACM Comp. Surveys 22 (1990) 83–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by the National Science Foundation (NSF) under Grant No. CCR-90-11981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akyildiz, I.F., Huang, CC. Exact analysis of queueing networks with multiple job classes and blocking-after-service. Queueing Syst 13, 427–440 (1993). https://doi.org/10.1007/BF01149264

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation