Abstract
In this paper, we give a tutorial of queueing networks with blocking. Except for a few special cases, these networks could not be shown to have product form solutions. Although the steady state queue length distributions of these networks can, in theory, be calculated by solving the global balance equations together with the normalization equation numerically, this procedure can, in practice, be restrictive due to the time complexity of the procedure and the large storage required to store the rate matrices, particularly for large networks. Since exact values of their steady state queue length distributions are, in general, not attainable, good approximation algorithms are required to analyze queueing networks with finite queues.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Akyildiz, I.F. 1987, Exact Product Form Solutions for Queueing Networks with Blocking, IEEE Tran. Computers, 1, 121–126
Akyildiz, I.F. 1988b, On the Exact and Approximate Throughput Analysis of Closed Queueing Networks with Blocking, IEEE Trans. Software Engineering, SE-14-1, 62–71
Akyildiz, I.F. and Von Brand, H. 1989a, Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking, Theor. Comp. Sci. J., 64, 203–219
Akyildiz, I.F. and Perros, H.G. 1989, Special Issue of Performance Evaluation on Queuing Networks with Finite Capacity Queues, 10-3
Altiok, T. and Perros, H.G. 1987, Approximate Analysis of Arbitrary Configurations of Queueing Networks with Blocking, Annals of OR, 481–509
Asare, B. 1978, Queue networks with blocking, Ph.D. Thesis, Trinity College Dublin, Ireland, 1978.
Avi-Itzhak, B. 1965, A Sequence of Service Stations with Arbitrary Input and Regular Service Times, Management Science, 11, 565–571
Balsamo, S., Clo, M.C., and Donatiello, L. 1992, Cycle Time Distributions of Cyclic Networks with Blocking, Proc. Second Int. Workshop on Queueing Networks with Blocking, Onvural and Akyildiz (Eds.), North Holland
Balsamo, S. and Donatiello, L. 1988, Two-Stage Cyclic Network with Blocking: Cycle Time Distribution and Equivalence Properties, Proc. Modeling Tech. and Tools for Computer Perf. Eval., Potier and Puigjaner (Eds), 513–528
Balsamo, S., Persone V. De Nitto, and Iazeolla, G. 1986, Some Equivalencies of Blocking Mechanisms in Queueing Networks with Finite Capacity”, Manuscript, Dipartimento di Informatica, Universite di Pisa, Italy
Balsamo, S. and Iazeolla, G. 1983, Some Equivalence Properties for Queueing Networks with and without Blocking”, Performance'83, Agrawala and Tripathi (Eds), 351–360, North Holland Publishing Company, Amsterdam
Bocharov, P.P. and Albores, F.K. 1980, On Two-Stage Exponential Queueing System with Internal Losses or Blocking, Problems of Control and Information Theory, 9, 365–379
Boxma, O. and Konheim, A. 1981, Approximate Analysis of Exponential Queueing Systems with Blocking, Acta Informatica, 15, 19–66
Brandwajn, A. and Jow, Y.-L.L. 1988, An Approximation Method for Tandem Queues with Blocking, Operations Research, 36, 73–83
Caseau, P. and Pujolle, G. 1979, Throughput Capacity of a Sequence of Transfer Lines with Blocking Due to Finite Waiting Room”, IEEE Trans. Software Engineering, 5, 631–642
Dallery, Y. and Frein, Y. 1989, A Decomposition Method for the Approximate Analysis of Closed Queueing Networks with Blocking, Proc. First International Workshop on Queueing Networks with Blocking, Perros and Altiok (Eds), 193–215, North Holland
Daskalaki, S. and MacGregor Smith, J. 1989, The Static Routing Problem in Open Finite Queueing Networks, Proc. First International Workshop on Queueing Networks with Blocking, Perros and Altiok (Eds), 193–215, North Holland
Foster, F.G. and Perros, H.G. 1980, On the Blocking Process in Queue Networks, Eur. J. Oper. Res., 5, 276–283
Frein, Y. and Dallery, Y. 1989, Analysis of Cyclic Queueing Networks with Finite Buffers and Blocking Before Service, Performance Evaluation, 197–210
Gershwin, S.B. 1987, An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking, Operations Research, 35, 291–305
Gershwin, S.B. 1987, An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking, Operations Research, 35, 291–305
Gordon, W.J. and Newell, G.F. 1967a, Cyclic Queueing Systems with Restricted Queues, Oper. Res., 15, 266–278
Gun, L. and Makowski, A.M. 1988, Matrix Geometric Solution for Finite Queues with Phase Type Distributions, Performance'87, Courtois and Latouche (Eds.), 269–282, North Holland
Hatcher, J.M. 1969, The Effect of Internal Storage on the Production Rate of a Series of Stages Having Exponential Service Times, AIIE Trans., 1, 150–156
Hillier, F.S. and Boling, R.W. 1967, Finite Queues in Series with Exponential or Erlang Service Times-A Numerical Approach, Operations Research, 15, 286–303
Hillier, F.S. and So, K.C. 1989, The Assignment of Extra Servers to Stations in Tandem Queueing Systems with Small or No Buffers, Performance Evaluation, 10-3, 219–232
Hordijk, A. and Van Dijk, N. 1981, Networks of Queues with Blocking, Performance'81, Klystra (Ed.), 51–65, Elsevier Science Publishers B.V. (North Holland)
Jafari, M.A. and Shanthikumar, J.G. 1984, Allocation of Buffer Storages Along a Multi-Stage Automatic Transfer Line, IE Rept. 84-003, Arizona University
Jafari, M.A. and Shanthikumar, J.G. 1985, Determination of Optimal Buffer Storage Capacities and Optimal Allocation in Multi-Stage Automatic Transfer Lines, IE&OR Rept. 85-011, Syracuse University
Kelly, F.P. 1984, Blocking, Reordering, and the Throughput of a Series of Buffers, Stochastic Processes and Their Applications, 17, 327–336
Kelly, K.P. 1979, Reversibility and Stochastic Networks, John Wiley and Sons Ltd., Chichester, England
Konheim, A.G. and Reiser, M. 1976, A Queueing Model with Finite Waiting Room and Blocking, J. ACM, 23, 328–341
Kouvatsos, D.D. 1983, Maximum Entropy Methods for General Queueing Networks, Modeling Tech. and Tools for Perf. Analysis, Potier (Ed.), 589–608, North Holland, Amsterdam
Kouvatsos, D.D. and Xenios, N.P. 1989, MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive Service Blocking, Performance Evaluation, 10-3, 169–196
Labetoulle, J. and Pujolle, G. 1980, Isolation Method in a Network of Queues, IEEE Transactions on Software Engineering, SE-6, 373–381
Langaris, C. and Conolly, C. 1984, On the Waiting Time of a Two-Stage Queueing System with Blocking, J. Appl. Prob., 21, 628–638
Lavenberg, S.S. 1978, Stability and Maximum Departure Rate of Certain Open Queueing Networks Having Finite Capacity Constraints, RAIRO Informatique/Computer Science, 12, 353–370
MacGregor Smith, J. and Daskalaki, S. 1988, Buffer Space Allocation in Automated Assembly Lines, Operations Research, 36, 343–358
Mitra, D. and Mitrani, I. 1988, Analysis of a Novel Discipline for Cell Coordination in Production Lines, AT&T Bell Labs Res. Rep.
Onvural, R.O. 1987, Closed Queueing Networks with Finite Buffers, Ph.D. thesis, CSE/OR, North Carolina State University
Onvural, R.O. 1989a, On the Exact Decomposition of Exponential Closed Queueing Networks with Blocking, First International Workshop on Queueing Networks with Blocking, Perros and Altiok (Eds), 73–83, North Holland
Onvural, R.O. 1989b, A Note on the Product Form Solutions of Multi-Class Closed Queueing Networks with Blocking, Performance Evaluation, 10-3, 247–254
Onvural, R.O. 1990, A Survey of Closed Queueing Networks with Blocking, ACM Computing Surveys, 22-2, 83–122
Onvural, R.O. and Akyildiz, I.F. 1993, Proc. Second International Workshop on Queueing Networks with Finite Capacity, North Holland, 1993
Onvural, R.O. 1993, Queueing Networks with Finite Capacity (Ed.), Performance Evaluation, April 1993
Onvural, R.O. and Perros, H.G. 1986, On Equivalencies of Blocking Mechanisms in Queueing Networks with Blocking, Oper. Res. Letters, 5–6, 293–298
Onvural, R.O. and Perros, H.G. 1988, Equivalencies Between Open and Closed Queueing Networks with Finite Buffers, Performance Evaluation, 9, 263–269
Onvural, R.O. and Perros, H.G. 1989a, Some Equivalencies on Closed Exponential Queueing Networks with Blocking”, Performance Evaluation, 9, 111–118
Onvural, R.O. and Perros, H.G. 1989b, Throughput Analysis in Cyclic Queueing Networks with Blocking, IEEE Trans. Software Engineering, SE 15-6, 800–808
Perros, H.G. 1984, Queueing Networks with Blocking: A Bibliography, ACM Sigmetrics, Performance Evaluation Review, 12-2, 8–12
Perros, H.G. 1989, A Bibliography of Papers on Queueing Networks with Finite Capacity Queues, Performance Evaluation, 10-3, 255–260
Perros, H.G. 1988, Two Node Open Networks with Finite Capacity Queues, CS Tech. Rep., North Carolina State University
Perros, H.G. and Altiok, T. 1986, Approximate Analysis of Open Networks of Queues with Blocking: Tandem Configurations, IEEE Trans. Software Engineering, SE-12, 450–461
Perros, H.G. 1989, Approximation Algorithms for Open Queueing Networks with Blocking, Chapter in Stochastic Analysis of Computer and Communications Systems, Takagi (Ed.), Elsevier SciencePublishers B.V. (north Holland)
Perros, H.G., Nilsson, A., and Liu, Y.C. 1989, Approximate Analysis of Product Form Type Queueing Networks with Blocking and Deadlock, Performance Evaluation, to appear
Persone, De Nitto, V., and Grillo, D. 1987, Managing Blocking in Finite Capacity Symmetrical Ring Networks, 3rd Conference on Data and Communication Systems and Their Performance, Rio de Jenerio, Brasil
Shanthikumar, G.J. and Yao, D.D. 1989, Monotonicity Properties in Cyclic Queueing Networks with Finite Buffers, First International Workshop on Queueing Networks with Blocking, Perros and Altiok (Eds), 325–344, North Holland
Sheskin, T. J. 1976, Allocation of Interstage Storage Along an Automated Production Line, AIIE Trans., 8, 146–152
Soyster, A.L., Schmidt, J.W., and Rohrer, M.W. 1979, Allocation of Buffer Capacities for a Class of Fixed Cycle Production Lines, AIIE Trans., 11, 140–146
Suri, R. and Diehl, G.W. 1986, A Variable Buffer Size Model and Its Use in Analytical Closed Queueing Networks with Blocking, Management Science, 32-2, 206–225
Takahashi, Y., Miyahara, H. and Hasegawa, T. 1980, An Approximation Method for Open Restricted Queueing Networks, Operations Research, 28, 594–602
van Dijk, N.M. 1989, A Simple Throughput Bound for Large Closed Queueing Networks with Finite Capacities, Performance Evaluation, 10-3, 153–168
Van Dijk, N.M. and Tijms, H.C. 1986, Insensitivity in Two Node Blocking Models with Applications, Teletraffic Analysis and Computer Performance Evaluation, Boxma, Cohen and Tijms (Eds), 329–340, Elsevier Science Publishers B.V. (North Holland), Amsterdam, The Netherlands
Yamashita, H. and Onvural, R.O. 1993, Buffer Allocation in Queueing Networks with Arbitrary Topologies, to appear in Annals of OR on Queueing Networks, van Dijk (Ed.)
Yamashita, H. and Suzuki, S. 1987, An Approximate Solution Method for Optimal Buffer Allocation in Serial n-stage Automatic Production Lines, Trans. Japan. Soc. Mech. Eng., 53-C, 807–814
Yao, D.D. and Buzacott, J.A. 1985, Queueing Models for Flexible Machining Stations Part II: The Method of Coxian Phases, Eur. J. Operations Research, 19, 241–252
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onvural, R.O. (1993). Queueing networks with finite capacities. In: Donatiello, L., Nelson, R. (eds) Performance Evaluation of Computer and Communication Systems. Performance SIGMETRICS 1993 1993. Lecture Notes in Computer Science, vol 729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013862
Download citation
DOI: https://doi.org/10.1007/BFb0013862
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57297-8
Online ISBN: 978-3-540-48044-0
eBook Packages: Springer Book Archive