A central limit theorem for a Markov-modulated infinite-server queue with batch Poisson arrivals and binomial catastrophes.

Perform. Eval.(2019)

引用 12|浏览2
暂无评分
摘要
This paper considers the stationary queue length distribution of a Markov-modulated MX/M/∞queue with binomial catastrophes. When a binomial catastrophe occurs, each customer is either removed with a probability or is retained with the complementary probability. We focus on our model under a heavy traffic regime because its exact analysis is difficult if not impossible. We establish a central limit theorem for the stationary queue length of our model in a heavy traffic regime. The central limit theorem can be used to approximate the queue length distribution of our model with large arrival rates.
更多
查看译文
关键词
batch arrival, central limit theorem, infinite-server queue, markov-modulated, binomial catastrophes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要