A Computational Algorithm for the Loss Probability in the M/G/1+PH Queue
A Computational Algorithm for the Loss Probability in the M/G/1+PH Queue
复制标题
M/G/1 PH队列丢失概率的计算算法
DOI：
10.1080/15326349.2016.1219955
复制
发表时间：
2017
影响因子：
0.7
通讯作者：
Y. Inoue and T. Takine
中科院分区：
文献类型：
--
作者：
Yoshiaki Inoue;Onno Boxma;David Perry;and Shelley Zacks;Y. Inoue and T. Takine
给出了具有不耐烦时间服从相型分布(M/G/1+Ph)的不耐烦顾客的平稳M/G/1排队的损失概率的计算算法。该算法给出了损失概率及其截断误差的上界，适用于M/D/1+PH、M/PH/1+PH和M/Pareto/1+PH排队。
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.