An Analysis of the El/Ek/1 Queueing System by Restricted Minimal Lattice Paths

DOI10.1057/JORS.1995.29MaRDI QIDQ4834246zbMATH OpenOpenAlexFDO

Authors Ikuo Arizono, Hiroshi Ohta, Stuart Jay Deutsch, Ching-Cheng Wang

Publication date 5 July 1995

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1995.29

zbMATH Keywords

combinatorial theorydifference-differential equationsequilibrium probability distributionminimal lattice pathsqueueing systems

Mathematics Subject Classification ID

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

Recommendations

• On lattice path counting and the random product representation, with applications to the E_r/M/1 queue and the M/E_r/1 queue
• On the limiting probabilities of the \(\mathrm{M}/\mathrm{E}_r/1\) queueing system
• scientific article; zbMATH DE number 1354935
• Analyzing \(E_k/E_r/ c\) queues
• Lattice path counting and \(M/M/c\) queueing systems

Cited in

(5)

• Lattice path counting and \(M/M/c\) queueing systems
• On lattice path counting and the random product representation, with applications to the E_r/M/1 queue and the M/E_r/1 queue
• On the limiting probabilities of the \(\mathrm{M}/\mathrm{E}_r/1\) queueing system
• A comparative analysis of the successive lumping and the lattice path counting algorithms
• The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates

This page was built for publication: An Analysis of the E_l/E_k/1 Queueing System by Restricted Minimal Lattice Paths

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