A computational algorithm for the loss probability in the M/G/1+PH queue |
| |
| Authors: | Yoshiaki Inoue Tetsuya Takine |
| |
| Institution: | Department of Information and Communications Technology, Graduate School of Engineering, Osaka University, Suita, Japan |
| |
| Abstract: | This article develops a computational algorithm for the loss probability in the stationary M/G/1 queue with impatient customers whose impatience times follow a phase-type distribution (M/G/1+PH). The algorithm outputs the loss probability, along with an upper-bound of its numerical error due to truncation, and it is readily applicable to the M/D/1+PH, M/PH/1+PH, and M/Pareto/1+PH queues. |
| |
| Keywords: | Error bound impatient customers loss probability M/G/1 queue phase-type impatience times |
|
|
