首页> 外文期刊>Mathematics and computers in simulation >Bayesian sample size determination in a single-server deterministic queueing system
【24h】

Bayesian sample size determination in a single-server deterministic queueing system

机译:贝叶斯示例大小在单服务器确定性排队系统中确定

获取原文
获取原文并翻译 | 示例

摘要

Although queueing models in the mathematical field of queueing theory are mainly studied in the steady-state regime and practical applications are interested mostly in queues in transient situations subject to burst arrivals and congestion, their use is still justified as a first step towards a more complex and thorough analysis. In these practical applications, parameters such as the traffic intensity, which is the ratio between the arrival rate and service rate, are unknown and need to be estimated statistically. In this study, a Markovian arrival and deterministic single-server queueing system, known in Kendall notation as an M/D/1 queueing model, is considered. This is one of the simplest queueing models with deterministic service time and may be seen as an approximation of a variety of applications in the performance evaluation of production management, telecommunications networks, and other areas. The main goal of this manuscript is to propose a methodology to determine the sample size for an M/D/1 queueing system under the Bayesian setup by observing the number of customer arrivals during the service time of a customer. To verify the efficiency and efficacy of the proposed approach, an extensive set of numerical results is presented and discussed.
机译:虽然排队理论的数学领域的排队模型主要在稳态制度中研究,但实际应用在瞬态情况下的队列中有兴趣,但其使用仍然是迈向更复杂的第一步和彻底的分析。在这些实际应用中,诸如交通强度的参数,即到达率和服务率之间的比率是未知的,并且需要在统计上估计。在本研究中,考虑了Markovian到达和确定性单服务器排队系统,以KENDALL表示法称为M / D / 1排队模型。这是具有确定性服务时间的最简单排队模型之一,并且可以被视为生产管理,电信网络和其他区域的性能评估中各种应用的近似。本手稿的主要目标是提出一种方法,通过观察客户在客户的服务时间内的客户到货数量来确定贝叶斯设置下的M / D / 1排队系统的样本大小。为了验证所提出的方法的效率和功效,提出和讨论了广泛的数值结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号