Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach

DOI10.1016/0893-9659(92)90107-KzbMath0745.90027OpenAlexW2047091306WikidataQ126422880 ScholiaQ126422880MaRDI QIDQ1186962

George D. Tsiotras

Publication date: 28 June 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(92)90107-k

zbMATH Keywords

finite intermediate buffertwo-station tandem queueing system

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach