A computational algorithm for the loss probability in the M/G/1+PH queue
DOI10.1080/15326349.2016.1219955zbMATH Open1361.60083OpenAlexW2525586256MaRDI QIDQ2976124FDOQ2976124
Authors: Yoshiaki Inoue, Tetsuya Takine 
Publication date: 13 April 2017
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349.2016.1219955
Recommendations
- The loss probability of an M/M/\(m\) queuing system with impatient customers
- Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
- An \(\mathrm{M}/\mathrm{PH}/K\) queue with constant impatient time
- Multi-class M/PH/1 queues with deterministic impatience times
- \(M/PH/1\) queue with deterministic impatience time
phase-type distributionerror boundloss probabilitycomputational algorithm\(\mathrm{M}/\mathrm{G}/1\) queueimpatience times
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
- Some Queuing Problems with Restrictions
- The \(M/G/1+G\) queue revisited
- The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues
- Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
Cited In (4)
Uses Software
This page was built for publication: A computational algorithm for the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{PH}\) queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976124)
