A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity

Recommendations

Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach
scientific article; zbMATH DE number 1187255
An Approximation Method for Tandem Queues with Blocking
An approximate analysis of tandem queues with general blocking nodes
A queueing model of general servers in tandem with finite buffer capacities

Cites work

A Comparison Between Tandem Queues with Dependent and Independent Service Times
A Queueing Model with Finite Waiting Room and Blocking
Asymptotic behavior of the expansion method for open finite queueing networks
Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
On the blocking process in queue networks

Cited in

(9)

Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system
An approximation method for blocking probabilities in \(M/D/1/K_{1} \to \cdot /D/1/K_{2}\) queues
Generalized Lindley-type recursive representations for multiserver tandem queues with blocking
A queueing model of general servers in tandem with finite buffer capacities
scientific article; zbMATH DE number 1484338 (Why is no real title available?)
Exact analysis of the joint production quantity-quality of two-station stable tandem manufacturing system with restricted capacity
Control of a tandem queue with a startup cost for the second server
Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach
scientific article; zbMATH DE number 1187255 (Why is no real title available?)

This page was built for publication: A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911173)