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

DOI10.1504/IJMOR.2009.022874MaRDI QIDQ843389zbMATH OpenOpenAlexFDO

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

\(M/ M/1/c\)\(M/ M/1\)countingpathsqueueingtransient

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Review text

Summary: We find combinatorially the probability of having \(n\) customers in an \(M/ M/1/ c\) queueing system at an arbitrary time \(t\) when the arrival rate and the service rate are equal, including the case \(c =\infty \). Our method uses pathcounting methods and finds a bijection between the paths of the type needed for the queueing model and paths of another type which are easy to count. The bijection involves some interesting geometric methods.

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)

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

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)