Approximate analysis of open networks of queues with blocking: Tandem configurations
IEEE Transactions on Software Engineering
Modeling a class of flexible manufacturing systems with reversible routing
Operations Research
Mean Value Analysis for Blocking Queueing Networks
IEEE Transactions on Software Engineering
An approximation method for tandem queues with blocking
Operations Research
Exact solutions for open, closed and mixed queueing networks with rejection blocking
Theoretical Computer Science - Special issue on high performance computer systems
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers
IEEE Transactions on Software Engineering
On the Cycle Time Distribution in a Two-Stage Cyclic Network with Blocking
IEEE Transactions on Software Engineering
Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking
Performance Evaluation - Queueing networks with finite capacity queues
Analysis of cyclic queueing networks with finite buffers and blocking service
Performance Evaluation - Queueing networks with finite capacity queues
A note on the product form solutions of multiclass closed queueing networks with blocking
Performance Evaluation - Queueing networks with finite capacity queues
A bibliography of papers on queueing networks with finite capacity queues
Performance Evaluation - Queueing networks with finite capacity queues
Some equivalencies between closed queueing networks with blocking
Performance Evaluation
Equivalencies between open and closed queueing networks with finite buffers
Performance Evaluation - Selected papers from the international seminar on performance of distributed and parallel systems
Analysis of a Kanban discipline for cell coordination in production lines
Management Science
On decomposition methods for tandem queueing networks with blocking
Operations Research
Cycle time distribution of cyclic networks with blocking
Performance Evaluation - Special issue on queueing networks with finite capacity
Analysis of a tandem queue with state-dependent general blocking: a GSMP perspective
Performance Evaluation - Special issue on queueing networks with finite capacity
Entropy maximised queueing networks with blocking and multiple job classes
Performance Evaluation - Special issue on queueing networks with finite capacity
Design of manufacturing systems using queueing models
Queueing Systems: Theory and Applications - Special issue on queueing models of manufacturing systems
Queueing networks with blocking
Queueing networks with blocking
On the arrival theorem for product form queueing networks with blocking
Performance Evaluation
A maximum entropy optimization approach to tandem queues with generalized blocking
Performance Evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
On the Exact and Approximate Throughput Analysis of Closed Queuing Networks with Blocking
IEEE Transactions on Software Engineering
Some Equivalence Properties for Queueing Networks with and without Blocking
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Closed queueing networks with finite capacity queues: approximate analysis
Proceedings of the 14th European Simulation Multiconference on Simulation and Modelling: Enablers for a Better Quality of Life
Approximate Analysis of Arbitrary QNMs with Space and Service Priorities
Proceedings of the IFIP TC6 WG6.3/WG6.4 Fifth International Workshop on Performance Modelling and Evaluation of ATM Networks: Performance Analysis of ATM Networks
Foreword: queueing networks with blocking
Performance Evaluation
Entropy maximisation and open queueing networks with priorities and blocking
Performance Evaluation
Queuing networks with population size constraints
IBM Journal of Research and Development
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.00 |
Queueing network models with finite capacity queues and blocking are used for modeling and performance evaluation of systems with finite resources and population constraints, such as communication and computer systems, traffic, production and manufacturing systems. Various blocking types can be defined to represent different system behaviors, network protocols and technologies. Queueing networks with blocking are difficult to analyze, except for the special class of productform networks. Most of the analytical methods proposed in literature provide an approximate solution with a limited computational cost. We introduce queueing networks with finite capacity queues and blocking, the main solution techniques for their analysis, both exact and approximate algorithms, and some network properties. We discuss the conditions under which exact solutions can be derived, and criteria for the appropriate selection of approximate methods. We present equivalence properties among different types of blocking types, the analysis of heterogeneous networks, and some application examples.