Skip to main content
SpringerLink
Log in

A Review of Decomposition Methods for Open Queueing Networks

  • Conference paper
Rapid Modelling for Increasing Competitiveness

Abstract

Open queueing networks are useful for modeling and performance evaluation of complex systems such as computer systems, communication networks, production lines and manufacturing systems. Exact analytical results are available only in few situations with restricted assumptions. In the general case, feasible solutions can be obtained only through approximations. This paper reviews performance evaluation methods for open queueing systems with focus on decomposition methods.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Albin SL (1982) On poisson approximations for superposition arrival processes in queues. Management Science 28(2):126–137

    Article  MATH  MathSciNet  Google Scholar 

  • Albin SL (1984) Approximating a point process by a renewal process, ii: Superposition arrival processes to queues. Operations Research 32(5):1133–1162

    Article  MATH  MathSciNet  Google Scholar 

  • Baldwin R, Davis IV N, Midkiff S, Kobza J (2003) Queueing network analysis: concepts, terminology, and methods. Journal of Systems and Software 66(2):99–117

    Article  Google Scholar 

  • Barbour A (1976) Networks of queues and the method of stages. Advances in Applied Probability 8(3):584–591

    Article  MATH  MathSciNet  Google Scholar 

  • Baskett F, Chandy K, Muntz R, Palacios F (1975) Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM 22(2):248–260, DOI http://doi.acm.org/10.1145/321879.321887

    Article  MATH  MathSciNet  Google Scholar 

  • Bitran G, Morabito R (1996) Open queueing networks : Optimization and performance evaluation models for discrete manufacturing systems. Production and Operations Management 51(2–4):163–193

    Google Scholar 

  • Bitran G, Tirupati D (1988) Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference. Management Science 34(1):75–100

    Article  MATH  MathSciNet  Google Scholar 

  • Bitran GR, Dasu S (1992) A review of open queueing network models of manufacturing systems. Queueing Systems 12(1-2):95–134

    Article  MATH  MathSciNet  Google Scholar 

  • Blacio˜glu B, Jagerman D, Altiok T (2008) Merging and splitting autocorrelated arrival processes and impact on queueing performance. Performance Evaluation 65(9):653–669

    Article  Google Scholar 

  • Bocharov P, Naumov V (1986) Matrix-geometric stationary distribution for the PH / PH /1/ r, queue. Elektronische Informationsverarbeitung und Kybernetik 22(4):179–186

    MATH  MathSciNet  Google Scholar 

  • Bolch G, Greiner S, de Meer H, Trivedi K (2006) Queueing Networks and Markov Chains : Modeling and Performance Evaluation with Computer Science Applications, 2nd edn. Wiley, New York

    MATH  Google Scholar 

  • Borovkov AA (1987) Limit theorems for queueing networks. i. Theory Probab Appl 31(3):413–427

    Article  MATH  Google Scholar 

  • Burke P (1956) The output of a queueing system. Operations Research 4(6):699–704

    Article  MathSciNet  Google Scholar 

  • Buzacott JA, Shanthikumar JG (1992) Design of manufacturing systems using queueing models. Queueing Systems 12(1–2):135–213

    Article  MATH  MathSciNet  Google Scholar 

  • Buzacott JA, Shanthikumar JG (1993) Stochastic models of manufacturing systems. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

  • Caldentey R (2001) Approximations for multi-class departure processes. Queueing Systems 38(2):205–212

    Article  MATH  MathSciNet  Google Scholar 

  • Coleman J, Henderson W, Pearce C, Taylor P (1997) A correspondence between product-form batch-movement queueing networks and single-movement networks. Journal of Applied Probability 34(1):160–175

    Article  MATH  MathSciNet  Google Scholar 

  • Dai J (1995) On positive recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals of Applied Probability 5(1):49–77

    Article  MATH  MathSciNet  Google Scholar 

  • Dai J, Nguyen V, Reiman M (1994) Sequential bottleneck decomposition: an approximation method for generalised jackson networks. Operations Research 42(1):119–136

    Article  MATH  Google Scholar 

  • Disney RL (1981) Queueing networks. Proceedings of AMS Symposia in Applied Mathematics 25:53–83

    MathSciNet  Google Scholar 

  • Disney RL, Konig D (1985) Queueing networks: A survey of their random processes. SIAM Review 27(3):335–403

    Article  MATH  MathSciNet  Google Scholar 

  • Govil M, Fu M (1999) Queueing theory in manufacturing : A survey. Journal of Manufacturing Systems 18(3):214–240

    Article  Google Scholar 

  • Gross D, Harris M (1998) Fundamentals of Queueing Theory, 3rd edn. Wiley, New York

    MATH  Google Scholar 

  • Harrison J, Lemoine A (1981) A note on networks of infinite-server queues. Journal of Applied Probability 18(2):561–567

    Article  MATH  MathSciNet  Google Scholar 

  • Haverkort B (1995) Approximate analysis of networks of PH / PH /1/ K, queues: Theory & tool support. In: MMB ’95: Proceedings of the 8th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, isbn: 3-540-60300-X, Springer-Verlag, London, UK, pp 239–253

    Google Scholar 

  • Haverkort B (1998) Approximate analysis of networks of PH / PH /1/ K, queues with customer losses: Test results. Annals of Operations Research 79(0):271–291

    Article  MATH  MathSciNet  Google Scholar 

  • Heindl A (2001) Decomposition of general tandem queueing networks with mmpp input. Performance Evaluation 44(1-4):5–23

    Article  MATH  Google Scholar 

  • Heindl A, Telek M (2002) Output models of MAP / PH /1(/ K) queues for an efficient network decomposition. Performance Evaluation 49(1–4):321–339

    Article  MATH  Google Scholar 

  • Heindl A, Mitchell K, van de Liefvoort A (2006) Correlation bounds for secondorder maps with application to queueing network decomposition. Performance Evaluation 63(6):553–577

    Article  Google Scholar 

  • Jackson JR (1957) Networks of waiting lines. Operations Research 5(4):518–521

    Article  MathSciNet  Google Scholar 

  • Jackson JR (1963) Job shop-like queueing systems. Management Science 10(1):131–142

    Article  Google Scholar 

  • Jackson RRP (1954) Queueing systems with phase type service. OR 5(4):109–120

    Article  Google Scholar 

  • Jagerman D, Bolcio˜glu B, Altiok T, Melamed B (2004) Mean waiting time approximations in the g / g /1 queue. Queueing Systems 46(3):481–506

    Article  MATH  MathSciNet  Google Scholar 

  • Kelly FP (1975) Networks of queues with customers of different types. Journal of Applied Probability 12(3):542–554

    Article  MATH  MathSciNet  Google Scholar 

  • Kelly FP (1976) Networks of queues. Journal of Applied Probability 8(2):416–432

    Article  MATH  Google Scholar 

  • Kelly FP (1979) Reversibility and Stochastic Processes. Wiley, NY

    Google Scholar 

  • Kim S (2004) The heavy-traffic bottleneck phenomenon under splitting and superposition. European Journal of Operational Research 157(3):736–745

    Article  MATH  MathSciNet  Google Scholar 

  • Kim S (2005) Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing. Naval Research Logistics 52(5):399–408

    Article  MATH  MathSciNet  Google Scholar 

  • Kim S, Muralidharan R, O’Cinneide C (2005) Taking account of correlation between streams in queueing network approximations. Queueing Systems 49(3–4):261–281

    Article  MATH  MathSciNet  Google Scholar 

  • Kleinrock L (1976) Queueing systems, Vol. II : Computer applications. Wiley, New York

    MATH  Google Scholar 

  • Koenigsberg E (1982) Twenty five years of cyclic queues and closed queue networks: A review. The Journal of the Operational Research Society 33(7):605–619

    Article  MATH  MathSciNet  Google Scholar 

  • Kraemer W, Langenbach-Belz M (1976) Approximate formulae for the delay in the queueing system gi / g /1. Proceedings of the 8th International Teletraffic Congress, Melbourne 235:1–8

    Google Scholar 

  • Kuehn PJ (1979) Approximate analysis of general queuing networks by decomposition. IEEE Transactions on Communications 27(1):113–126

    Article  MATH  Google Scholar 

  • Lemoine AJ (1977) Networks of queues - a survey of equilibrium analysis. Management Science 24(4):464–481

    Article  MATH  MathSciNet  Google Scholar 

  • Massey WA, Whitt W (1993) Networks of infinite-server queues with nonstationary poisson input. Queueing Systems 13(1–3):183–250

    Article  MATH  MathSciNet  Google Scholar 

  • Meng G, Heragu SS (2004) Batch size modeling in a multi-item, discrete manufacturing system via an open queuing network. IIE Transactions 36(8):743–753

    Article  Google Scholar 

  • Miyazawa M, Taylor P (1997) A geometric product-form distribution for a queueing network with non-standard batch arrivals and batch transfers. Advances in Applied Probability 29(2):523–544

    Article  MATH  MathSciNet  Google Scholar 

  • Pollett PK (1987) Preserving partial balance in continuous-time markov chains. Advances in Applied Probability 19(2):431–453

    Article  MATH  MathSciNet  Google Scholar 

  • Reich E (1957) Waiting times when queues are in tandem. Annals of Mathematical Statistics 28(3):768–773

    Article  MATH  MathSciNet  Google Scholar 

  • Reiser M, Kobayashi H (1974) Accuracy of the diffusion approximation for some queuing systems. IBM Journal of Research and Development 18(2):110–124

    Article  MATH  MathSciNet  Google Scholar 

  • Sadre R, Haverkort B, Ost A (1999) An efficient and accurate decomposition method for open finite- and infinite-buffer queueing networks. In W Stewart and B Plateau, editors, Proceedings 3rd International Workshop on Numerical Solution of Markov Chains p 120

    Google Scholar 

  • Segal M, Whitt W (1989) A queueing network analyser for manufacturing. Teletraffic Science for New Cost-Effective Systems, Networks and Services, Proceedings of ITC 12 (ed M Bonatti), North-Holland, Amsterdam pp 1146–1152

    Google Scholar 

  • Sevcik KC, Levy AI, Tripathi SK, Zahorjan JL (1977) Improving approximations of aggregated queueing network systems. Computer Performance (eds K Chandy and M Reiser), North-Holland pp 1–22

    Google Scholar 

  • Shanthikumar J, Ding S, Zang M (2007) Queueing theory for semiconductor manufacturing systems : A survey and open problems. IEEE Transactions on Automation Science and Engiheering 4(4):513–522

    Article  Google Scholar 

  • Shanthikumar JG, Buzacott JA (1981) Open queueing network models of dynamic job shops. International Journal of Production Research 19(3):255–266, DOI 10.1080/00207548108956652

    Article  Google Scholar 

  • Suresh S, Whitt W (1990) The heavy-traffic bottleneck phenomenon in open queueing networks. Operations Research Letters 9(6):355–362

    Article  MATH  Google Scholar 

  • Suri R, Sanders JL, Kamath M (1993) Performance evaluation of production networks, vol 4. Elsevier, North-Holland,Amsterdam

    Google Scholar 

  • Suri R, Diehl GWW, de Treville S, Tomsicek MJ (1995) From can-q to mpx: Evolution of queuing software for manufacturing. Interfaces 25(5):128–150

    Article  Google Scholar 

  • Takacs L (1963) A single server queue with feedback. BSTJ 42:505–519

    MathSciNet  Google Scholar 

  • Whitt W (1983a) The queueing network analyzer. The Bell System technical journal 62(9):2779–2815

    Google Scholar 

  • Whitt W (1983b) Performance of the queueing network analyzer. The Bell System technical journal 62(9):2817–2843

    Google Scholar 

  • Whitt W (1994) Towards better multi-class parametric-decomposition approximations for open queueing networks. Annals of Operations Research 48(3):221–248

    Article  MATH  MathSciNet  Google Scholar 

  • Whitt W (1995) Variability functions for parametric-decomposition approximations of queueing networks. Management Science 41(10):1704–1715

    Article  MATH  Google Scholar 

  • Whitt W (1999) Decomposition approximations for time-dependent markovian queueing networks. Operations Research Letters 24(3):97–103, DOI http://dx.doi.org/10.1016/S0167-6377(99)00007-3

    Article  MATH  MathSciNet  Google Scholar 

  • Whittle P (1986) Systems in Stochastic Equilibrium. Wiley, London

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Enterprise Institute, University of Neuchâtel, Rue A.-L. Breguet 1, 2000, Neuchâtel, Switzerland

    Boualem Rabta

Authors
  1. Boualem Rabta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut de l’Entreprise (IENE), Faculté des Sciences Économiques, Université de Neuchâtel, Rue A.-L. Breguet 1, 2000, Neuchâtel, Switzerland

    Gerald Reiner

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer London

About this paper

Cite this paper

Rabta, B. (2009). A Review of Decomposition Methods for Open Queueing Networks. In: Reiner, G. (eds) Rapid Modelling for Increasing Competitiveness. Springer, London. https://doi.org/10.1007/978-1-84882-748-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-748-6_3

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-747-9

  • Online ISBN: 978-1-84882-748-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation