...
首页> 外文期刊>Operations Research: The Journal of the Operations Research Society of America >Necessary and sufficient conditions for delay moments in FIFO multiserver queues with an application comparing s slow servers with one fast one
【24h】

Necessary and sufficient conditions for delay moments in FIFO multiserver queues with an application comparing s slow servers with one fast one

机译:FIFO多服务器队列中延迟时间的充要条件,该应用程序将慢速服务器与一个快速服务器进行比较

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

摘要

In this paper we establish the weakest known sufficient conditions for the existence of stationary delay moments in FIFO GI/GI/s queues, for s greater than or equal to 2. These conditions involve not only the service time distribution, as in the classic Kiefer and Wolfowitz conditions, but also the interplay of the traffic intensity and the number of servers in the queue. We then prove the necessity of our conditions for a large class of service times having finite first, but infinite alphath, moment for some finite alpha. Such service time distributions include many, but not all of, the class of heavy-tailed distributions: The Pareto and Cauchy are members; the Weibull is not. Our results are then applied to provide one answer to the classic question: When are s slow servers (operating at rate 1/s) better than one fast server (operating at rate 1)? We consider this question with respect to the rate of decay of the tail of stationary customer delay. In a system characterized by service times that have finite mean but lack some higher moments, such as are often used to model telecommunications traffic, for s greater than a traffic-related constant, the answer is always. Our results help to quantify the benefits of extra servers, while also pointing the way towards the derivation of bounds and asymptotics for the stationary delay distribution of multiserver queues having these types of service times. Such queues are attracting a great deal of academic research, motivated by their practical use modeling telecommunications systems. [References: 29]
机译:在本文中,我们为s大于或等于2的FIFO GI / GI / s队列中存在的固定延迟矩建立了最弱的已知充分条件。这些条件不仅涉及服务时间分布,如经典的Kiefer中所述和Wolfowitz条件,以及流量强度和队列中服务器数量的相互作用。然后,我们证明了对于大量服务时间而言,对于某些有限alpha具有有限的第一但无限alphath矩的条件的必要性。这样的服务时间分布包括许多但不是全部的重尾分布:Pareto和Cauchy是成员;威布尔不是。然后,我们的结果将用于为经典问题提供一个答案:慢速服务器(以1 / s的速率运行)何时比一台快速服务器(以1的速率运行)更好?我们考虑到固定客户延迟的尾巴衰减率这一问题。在一个以有限的平均时间但缺乏一些较高矩的服务时间为特征的系统中(例如通常用于对电信流量进行建模的系统),其值大于与流量相关的常数,则答案总是正确的。我们的结果有助于量化额外服务器的好处,同时也为具有这些服务时间类型的多服务器队列的静态延迟分配指明了界限和渐近的方法。此类队列因其对电信系统的实际使用建模而吸引了大量的学术研究。 [参考:29]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号