Generalized Lindley-type recursive representations for multiserver tandem queues with blocking

DOI10.1145/1842722.1842726zbMATH Open1384.90027OpenAlexW2004434556MaRDI QIDQ4635158FDOQ4635158

Authors: Wai Kin, Victor Chan 

Publication date: 16 April 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1842722.1842726

Recommendations

• scientific article; zbMATH DE number 1187255
• A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity
• Servers in tandem with k-stage blocking and communications-type flow
• A new approach to the Lindley recursion
• Large tandem queueing networks with blocking

zbMATH Keywords

blockingtandem queuefast simulationLindley recursion

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Queues and service in operations research (90B22)

Cited In (1)

• A fast simulation model based on Lindley's recursion for the G/G/1/K queue

This page was built for publication: Generalized Lindley-type recursive representations for multiserver tandem queues with blocking

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