Transient results for M/M/1/c queues via path counting

DOI10.1504/IJMOR.2009.022874zbMATH Open1176.90120OpenAlexW2129174856MaRDI QIDQ843389FDOQ843389

Authors L. M. Hurajt, M. Cylwa, M. Hlynka

Publication date 12 October 2009

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2009.022874

zbMATH Keywords

queueingpathstransientcounting\(M/ M/1/c\)\(M/ M/1\)

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Lattice path counting and \(M/M/c\) queueing systems
• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• Transient solution to the many-server Poisson queue: a simple approach
• Combinatorial approach to Markovian queueing models
• scientific article; zbMATH DE number 1045887

Cited in

(2)

• Discussion on the transient solution of single server Markovian multiple variant vacation queues with disasters
• Weighted Dyck paths and nonstationary queues

This page was built for publication: Transient results for \(M/M/1/c\) queues via path counting

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