首页> 外文期刊>Sankhya >An M~X/G/1 Queue with a Bernoulli Vacation Schedule Under Restricted Admissibility Policy
【24h】

An M~X/G/1 Queue with a Bernoulli Vacation Schedule Under Restricted Admissibility Policy

机译:受限接纳政策下具有伯努利休假时间表的M〜X / G / 1队列

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

摘要

We consider a batch arrival queue with a Bernoulli vacation schedule, where after completion of a service the server either goes for a vacation of random length with probability θ(0 ≤ θ ≤ 1) or may continue to serve the next unit, if any, with probability (1 - θ), under a restricted admissibility policy of arriving batches. Unlike the usual batch arrival queueing system, the restricted admissibility policy differs during a busy period and a vacation period and hence all arriving batches are not allowed to join the system at all time. We derive the steady state queue size distribution at a random point of time as well as at a departure epoch. Also we obtain some important performance measures of this model. More over, this paper attempts to unify several classes of related batch arrival queueing systems.
机译:我们考虑一个具有伯努利休假时间表的批量到达队列,其中服务完成后,服务器要么以概率θ(0≤θ≤1)进行随机长度的休假,要么可以继续服务下一个单元(如果有),在到达批次的限制接纳策略下,概率为(1-θ)。与通常的批次到达排队系统不同,在繁忙时段和休假期间,受限的可接纳性策略有所不同,因此不允许所有到达的批次始终都加入系统。我们在一个随机的时间点以及一个出发时间点得出稳态队列的大小分布。我们还获得了该模型的一些重要性能指标。而且,本文试图统一几类相关的批量到达排队系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号