In recent years, queueing networks with blocking have been studied by researchers from various research communities such as Computer Performance Modelling, Operations Research, and Industrial Engineering. In view of this, related results are scattered throughout various journals. The bibliography given below is the result of a first attempt to compile an exhaustive list of related papers in which analytic investigations (exact or approximate) or numerical investigations of queueing networks with blocking have been reported.

Queueing networks with blocking: a bibliography

In this paper a new method for analyzing complex queueing networks is proposed: the isolation method. As an example, we study packet switching networks with finite buffer size at each node.

Isolation Method in a Network of Queues

A bibliography of papers on queueing networks with finite capacity queues

1 Aggregate Control of Production Systems.- 1.1 Introduction.- 1.2 Problem formulation.- 1.3 Capacity control structures.- 1.3.1 Local control structures.- 1.3.2 Integral control structures.- 1.4 Capacity modeling of production systems.- 1.5 Contents of the text.- 2 Capacity Analysis of Two-Stage Lines.- 2.1 Case: an insertion department.- 2.1.1 Case descript ion.- 2.1.2 Modeling the insertion department.- 2.2 Literature on two-stage lines.- 2.3 The two-stage model.- 2.3.1 Introduction.- 2.3.2 Model description.- 2.3.3 Model analysis.- 2.3.4 Solution of the model for ?1?0, ?2?0 and ?1??2.- 2.3.5 Numeric results.- 2.3.6 State-dependent failures.- 2.3.7 Comparison with a discrete product model.- 2.4 More complex machines.- 2.4.1 The model.- 2.4.2 Interpretations of the model.- 2.4.3 Model analysis.- 2.5 Control of the two-stage line.- 2.5.1 Infinite buffers and backlogging.- 2.5.2 Control by switching policies.- 2.6 Analysis of buffer behavior.- 2.6.1 Buffer fluctuations.- 2.6.2 Determination of stock increase and stock decrease moments.- 2.6.3 Relations between buffer stock moments and line characteristics.- 2.7 Approximation of complex two-stage lines.- 2.7.1 Introduction.- 2.7.2 More numeric results.- 2.8 Discrete product models.- 2.9 Analysis of the insertion department.- 2.10 Conclusions and preview.- 3 More Complex Systems.- 3.1 Network layouts and analysis techniques.- 3.2 Literature survey.- 3.2.1 Literature on N-stage lines.- 3.2.2 Literature on general layouts.- 3.3 N-stage lines.- 3.3.1 The N-stage continuous flow line.- 3.3.2 Analysis of three-stage lines.- 3.3.2.1 Two machines perfect, one machine unreliable.- 3.3.2.2 More than one machine unreliable.- 3.3.3 Three-machine assembly-disassembly networks.- 3.4 Reversibility of production networks.- 3.4.1 Reversibility in assembly-disassembly networks.- 3.4.2 Buffer-sharing networks.- 4 Analysis of Locally Controlled Systems.- 4.1 Aggregation of two-stage lines.- 4.2 Approximation of flow lines.- 4.2.1 Approximation method 1.- 4.2.2 Approximation method 2 for three-stage lines.- 4.2.3 Method AP2 for N-stage lines.- 4.3 More numeric results and comparisons.- 4.4 Other network layouts.- 4.4.1 Approximation of assembly-disassembly networks.- 4.4.1.1 Networks with a single a/d machine.- 4.4.1.2 Numeric results.- 4.4.2 Buffer-sharing networks.- 4.5 Other types of local control.- 4.6 Discussion.- 5 Analysis of Integrally Controlled Production Systems.- 5.1 Control with the Base-Stock System.- 5.1.1 Model description.- 5.1.2 Approximation by locally controlled lines.- 5.1.3 Additional local restrictions.- 5.2 Approximation of workload-controlled lines.- 5.3 Discrete-product models.- 5.4 Nonstationary behavior and conclusions.- 6 Capacity Modeling of Multiproduct Lines.- 6.1 Aggregates instead of items.- 6.2 Lot-sizing.- 6.3 Work-in-process.- 6.4 Nonstationarity.- 6.5 Conclusions.- 7 Case Studies.- 7.1 A coin-validator production line.- 7.1.1 Case description.- 7.1.2 Design problems.- 7.1.3 Control structure.- 7.1.4 Problems involving operators.- 7.1.5 Modeling the coin-validator line.- 7.1.6 Model analysis.- 7.1.7 Discussion of results.- 7.2 A differential gear factory.- 7.2.1 Case description.- 7.2.2 Control objectives.- 7.2.3 Modeling the case.- 7.2.4 Control of the aggregate flow in the model.- 7.2.5 Analysis of the model.- 7.2.6 Evaluation.- Epilogue.- Appendix A.- Appendix A. 1.- Appendix A. 2.- Appendix A. 3.- Appendix B.- Appendix C.- Appendix D.- References.- Glossary of Notations.

/pdf/capacity-oriented-analysis-and-design-of-production-systems-3lbjbjvzz7.pdf

Capacity Oriented Analysis and Design of Production Systems

The application of queueing network models to the performance analysis of messageswitched (or packet-switched) commumcatmn networks m surveyed. The main topics covered are the analysis of end-to-end delay and the analysis of buffer management schemes. A brief discussmn on flow control is also included. A queueing network model is developed for a simple user-resource network. The mean response time of a host computer m this network is illustrated by a numerical example.

Queueing Network Modeling of Computer Communication Networks

We consider packet-switching network as a queueing system with constant service times: that means that the lengths of the packets are equal. We study such a network by isolating a particular path, that we consider as a tandem system of queueing. Two aspects of the question will be examined:1 - The study of the response time of such a system2 - The study of the throughput of such a system when introducing the notion of time-out for each packet.The results we obtained show that when neglecting the interferences between paths the response time is independent of the order of the stations. The control policy we examined prove the necessity to have a limited memorisation capacity at each node of a packet-switching network. These results confirm the intuitive options taken in a network like CYCLADES.

G. Pujolle

Papers

A study of queueing networks with deterministic service and applications to computer networks