A bibliography of papers on queueing networks with finite capacity queues
Performance Evaluation - Queueing networks with finite capacity queues
Queueing networks with blocking
Queueing networks with blocking
Introduction to matrix analysis (2nd ed.)
Introduction to matrix analysis (2nd ed.)
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
Queueing networks with blocking: a bibliography
ACM SIGMETRICS Performance Evaluation Review
A Two-Phase BMAP|G|1|N → PH|1|M – 1 System with Blocking
Automation and Remote Control
The BMAP/G/1/N -- · /PH/1/M tandem queue with losses
Performance Evaluation
Performance of two-stage tandem queues with blocking: the impact of several flows of signals
Performance Evaluation
The BMAP/G/1--·/PH/1/M tandem queue with feedback and losses
Performance Evaluation
EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS
Cybernetics and Systems
A tandem retrial queueing system with two Markovian flows and reservation of channels
Computers and Operations Research
Tandem service system with batch Markov flow and repeated calls
Automation and Remote Control
Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
International Journal of Applied Mathematics and Computer Science
A dual tandem queueing system with a finite intermediate buffer and cross traffic
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Priority tandem queueing model with admission control
Computers and Industrial Engineering
A two-phase GI/PH/1 → ·/PH/1/0 system with losses
Automation and Remote Control
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services
Operations Research Letters
| Hi-index | 0.00 |
Queueing networks with blocking have proved useful in modelling of data communications and production lines. We study such a network consisting of a sequence of two service stations with an infinite queue allowed before the first station and no intermediate queue allowed between them. This restriction results in the blocking of the first station whenever a unit having completed its service in that station cannot enter into the second one due to the presence of another unit there. The input of units to the network is the MAP (Markovian Arrival Process). At the first station, service requirements are of phase type whereas service times at the second station are arbitrarily distributed. The focus is on the embedded process at departures. The essential tool in our analysis is the general theory on Markov renewal processes of M/G/1-type.