A computational algorithm for the loss probability in the M/G/1+PH queue

DOI10.1080/15326349.2016.1219955zbMath1361.60083OpenAlexW2525586256MaRDI QIDQ2976124

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

zbMATH Keywords

error boundcomputational algorithmphase-type distributionloss probability\(\mathrm{M}/\mathrm{G}/1\) queueimpatience times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Analysis of \(M^{ X}/ G/1\) queues with impatient customers ⋮ Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue

Uses Software

• GSL

Cites Work

• Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
• 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
• Some Queuing Problems with Restrictions

This page was built for publication: A computational algorithm for the loss probability in the M/G/1+PH queue