.png){kind=icon}
返回
Maximum queue lengths during a fixed time interval in the M/M/c retrial queue
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.02.074.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We are concerned with the problem of characterizing the distribution of the maximum number Z(t(0)) of customers during a fixed time interval [0, t(0)] in the M/M/c retrial queue, which is shown to have a matrix exponential form. We present a simple condition on the service and retrial rates for the matrix exponential solution to be explicit or algorithmically tractable. Our methodology is based on splitting methods and the use of eigen-values and eigenvectors. A particularly appealing feature of our solution is that it allows us to obtain global error control. Specifically, we derive an approximating solution p(x; t(0)) = p(x; t(0); epsilon) verifying [P(Z(t(0)) <= x vertical bar X(0) = (i,j)) - p(x; t(0))] < epsilon uniformly in x >= i + j, for any epsilon > 0 and initial numbers i of busy servers and j of customers in orbit. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Absorbing Markov chain
Eigenvalues/eigenvectors
Maximum queue length
Retrial queue
Splitting method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later.png)
SIAM REVIEW
SIAM REVIEWIF6.1
PREAI
分享收藏
查看更多内容