.png){kind=icon}
.png){kind=icon}
返回
Computing performance measures in a multi-class multi-resource processor-shared loss system
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00051-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper develops methods to comfpute performance measures in a specific type of loss system with multiple classes of customers sharing the same processor. Such systems arise in the modeling of a call center, where the performance measures of interest are the blocking probability of a call and the reneging probability of customers that are put on hold. Expressions for these performance measures have been derived in previous work by the authors. Given the difficulty of computing these performance measures for realistic systems, this paper proposes two different approaches to simplify this computation. The first method introduces the idea of multi-dimensional convolutions, and uses this approach to compute exact blocking and reneging probabilities. The second method establishes an adaptation of the Monte Carlo summation technique in order to obtain good estimates of blocking and reneging probabilities in large systems along with their associated confidence intervals. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
queueing
loss system
processor sharing
computational analysis
approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。