.png){kind=icon}
返回
An approximation method for 2-chain flexible queues with preemptive priority
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2018.1556410.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Chaining configurations (e.g. 2-chain) have been widely applied in service systems to improve responsiveness to customer demand. In this paper, we propose an approximation method for the analysis of symmetric parallel queueing systems with 2-chain configuration and preemptive priority. In the queueing system of interest, the arrival processes of different types of customers follow independent Poisson processes with identical arrival rate lambda, and service times of different types of customers are exponentially distributed with identical service rate mu. Each server serves its primary customers with preemptive priority. When there are no primary customers in the system, the server serves secondary customers. We first derive the system stability condition. Then, we analyse the system's various performance measures. Our approach relies on the matrix-analytic method coupled with the idle probability of each server, which is proved to be 1 - lambda/mu. The average queue length of each queue and the rate that each server serves its secondary customers (i.e. the helping rate) can be estimated using our proposed method. Finally, we conduct numerical studies to demonstrate the accuracy of our proposed approximation method.
Keyword:
queueing models
stability
chaining configurations
preemptive priority
matrix-analytic method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏Quantitative proteomics revealed novel proteins associated with molecular subtypes of breast cancer
PREAI
分享收藏
查看更多内容