Skip to main content
SpringerLink
Log in

Approximate analysis of arbitrary configurations of open queueing networks with blocking

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

Abstract

An algorithm for analyzing approximately open exponential queueing networks with blocking is presented. The algorithm decomposes a queueing network with blocking into individual queues with revised capacity, and revised arrival and service processes. These individual queues are then analyzed in isolation. Numerical experience with this algorithm is reported for three-node and four-node queueing networks. The approximate results obtained were compared against exact numerical data, and they seem to have an acceptable error level.

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. T. Altiok, Approximate analysis of exponential tandem queues with blocking, Eur. J. Oper. Res. 11(1982)390.

    Google Scholar 

  2. T. Altiok and H.G. Perros, Open networks of queues with blocking: Split and merge configurations, AIIS Trans.

  3. P.P. Bocharov and G.P. Rokhas, On an exponential queueing system in series with blocking, Problems of Control and Information Theory 9(1980)441.

    Google Scholar 

  4. O.J. Boxma and A.G. Konheim, Approximate analysis of exponential queueing systems with blocking, Acta Informatica 15(1981)19.

    Google Scholar 

  5. A. Brandwajn and Y.L. Jow, An approximation method for tandem queues with blocking, manuscript, Amdahl Corp. (1985).

  6. P. Caseau and G. Pujolle, Throughput capacity of a sequence of queues with blocking due to finite waiting room, IEEE Trans. Soft. Eng. SE-5 (1979) 631.

    Google Scholar 

  7. S.B. Gershwin, An efficient decomposition method for the approximate evaluation of tandem queues with finite storage and blocking, manuscript, Lab. for Information and Decision Sciences, M.I.T. (1983).

  8. K. Goto, Y. Takahashi and J. Hasegawa, An approximate analysis on controlled tandem queues, Proc. Modelling Techniques and Tools for Performance Analysis, Cannes, France (1985).

  9. F.S. Hillier and R. Boling, Finite queues in series with exponential or Erlang service times —A numerical approach, Oper. Res. 15(1967)286.

    Google Scholar 

  10. A. Hordijk and N. Van Dijk, Networks of queues with blocking, in:Performance '81, ed. F.J. Kylstra (North-Holland, New York, 1981).

    Google Scholar 

  11. F.P. Kelly, The throughput of a series of buffers, Adv. Appl. Prob. 14(1982)633.

    Google Scholar 

  12. J. Labetoulle and G. Pujolle, Modelling of packet switching communication networks with finite buffer size at each node, in:Computer Performance, eds. Chandy and Reiser (North-Holland, 1977) p. 515.

  13. L.-M. Le Ny, Etude analytique de réseaux de files d'attente multiclasses a routage variable, RAIRO Recherche Operationelle 14(1980)331.

    Google Scholar 

  14. M.F. Neuts,Matrix-geometric Solutions in Stochastic Models — An Algorithmic Approach (The John Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  15. R.O. Onvural and H.G. Perros, On equivalencies of blocking mechanisms in queueing networks with blocking, manucript, Comp. Sci. Dept., N.C. State Univ. (1985).

  16. H.G. Perros, A symmetrical exponential open queue network with blocking and feedback, IEEE Trans. Soft. Eng. SE-7 (1981) 395.

    Google Scholar 

  17. H.G. Perros and T. Altiok, Approximate analysis of open networks of queues with blocking: Tandem configurations, IEEE Trans. Soft. Eng., to appear.

  18. H.G. Perros, Queueing networks with blocking: A bibliography, Performance Evaluation Review, ACM SIGMETRICS 12(1984)8.

    Google Scholar 

  19. S.M. Pollock and J.R. Birge, Parallel iteration for multiple servers, manuscript, I and OR Dept. 83-16, Michigan Univ. (1983).

  20. R. Suri and G.W. Diehl, A variable buffer-size model and its use in analytic closed queueing networks with blocking, Proc. ACM SIGMETRICS on Measurement and Modelling of Computer Systems (1984) 134.

  21. Y. Takahashi, H. Miyahara and T. Hasegawa, An approximation method for open restricted queueing networks, J. Oper. Res. 28(1980)594.

    Google Scholar 

  22. D. Yao and J.A. Buzacott, Modelling a class of flexible manufacturing systems with reversible routing, manuscript, I.E. Dept., Columbia Univ. (1983).

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Rutgers University, 08854, Piscataway, NJ, USA

    T. Altiok

  2. Computer Science Department, North Carolina State University, 27695, Raleigh, NC, USA

    H. G. Perros

Authors
  1. T. Altiok
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. G. Perros
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported in part by a grant from CAIP Center, Rutgers University.

Supported in part by the National Science Foundation under Grant DCR-85-02540.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altiok, T., Perros, H.G. Approximate analysis of arbitrary configurations of open queueing networks with blocking. Ann Oper Res 9, 481–509 (1987). https://doi.org/10.1007/BF02054751

Download citation

  • Issue Date:

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

Keywords and phrases

Search

Navigation