A computational algorithm for the loss probability in the M/G/1+PH queue
From MaRDI portal
Publication:2976124
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
Cites work
- Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
- 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
- Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
Cited in
(5)- 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
- Calculating the loss probability in aBMAP/G/l/N+1 queue
- An \(\mathrm{M}/\mathrm{PH}/K\) queue with constant impatient time
- Analysis of \(M^{ X}/ G/1\) queues with impatient customers
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)
