...
首页> 外文期刊>Queueing systems >An alternative approach to heavy-traffic limits for finite-pool queues
【24h】

An alternative approach to heavy-traffic limits for finite-pool queues

机译:有限池队列的重型流量限制的替代方法

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

摘要

We consider a model for transitory queues in which only a finite number of customers can join. The queue thus operates over a finite time horizon. In this system, also known as the △_((i))/G/1 queue, the customers decide independently when to join the queue by sampling their arrival time from a common distribution. We prove that, when the queue satisfies a certain heavy-traffic condition and under the additional assumption that the second moment of the service time is finite, the rescaled queue length process converges to a reflected Brownian motion with parabolic drift. Our result holds for general arrival times, thus improving on an earlier result Bet et al. (Math Oper Res 2019, ) which assumes exponential arrival times.
机译:我们考虑一个用于暂时队列的模型,其中只有有限数量的客户可以加入。因此,队列在有限时间范围内运行。在该系统中,也称为△_((i))/ g / 1队列,客户独立地决定,何时通过从公共发行分发采样它们的到达时间来加入队列。我们证明,当队列满足一定的重交通条件并且在服务时间的第二时刻是有限的附加假设下,重新定位的队列长度进程与具有抛物线漂移的反射布朗运动会聚。我们的结果适用于一般到达时间,从而改善了早期的结果Bet等。 (Math Oper 2019,)假设指数到达时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号