A queueing model of general servers in tandem with finite buffer capacities

MaRDI QIDQ3436617zbMATH OpenFDO

Authors Hsing Paul Luh

Publication date 11 May 2007

Mathematics Subject Classification ID

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

Recommendations

• A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity
• Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers
• Modeling and analysis of multiple-class tandem queuing systems with finite capacities
• Tandem Queues with Correlated Service Times and Finite Capacity
• scientific article; zbMATH DE number 1187255

Cited in

(9)

• A mathematical modelling approach for systems where the servers are almost always busy
• Finite-buffer queues with workload-dependent service and arrival rates
• A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity
• Modeling and analysis of multiple-class tandem queuing systems with finite capacities
• An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
• scientific article; zbMATH DE number 3980197 (Why is no real title available?)
• scientific article; zbMATH DE number 7734366 (Why is no real title available?)
• The Effect of Routing and Buffer Sharing on the Behavior of a Finite Queue with Batch Poisson Inputs and Synchronous Servers
• Queueing-model based analysis of assembly lines with finite buffers and general service times

This page was built for publication: A queueing model of general servers in tandem with finite buffer capacities

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