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

DOI10.1016/0305-0548(90)90052-9zbMATH Open0697.60096OpenAlexW2068538898MaRDI QIDQ911173FDOQ911173

Authors: Hussein Badr, George D. Tsiotras 

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90052-9

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

zbMATH Keywords

closed-form expressionstandem queueing systemconditional blocking probabilities

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
• A Comparison Between Tandem Queues with Dependent and Independent Service Times
• Asymptotic behavior of the expansion method for open finite queueing networks
• A Queueing Model with Finite Waiting Room and 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach

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)