首页> 外文期刊>Theory of probability and its applications >SUBEXPONENTIAL ASYMPTOTICS FOR STEADY STATE TAIL PROBABILITIES IN A SINGLE-SERVER QUEUE WITH REGENERATIVE INPUT FLOW
【24h】

SUBEXPONENTIAL ASYMPTOTICS FOR STEADY STATE TAIL PROBABILITIES IN A SINGLE-SERVER QUEUE WITH REGENERATIVE INPUT FLOW

机译:具有再生输入流程的单服务器队列中稳态尾部概率的子浓度渐变态

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

摘要

The present paper is devoted to queueing systems with regenerative input flow in the presence of heavy tails. Our goal is to develop an asymptotics for the probability of the waiting time process in a stationary regime to exceed a high level. In this paper, we consider the total service time of customers arriving during the time-interval [0, t] as an input flow X(t). This allows us to consider a case when the service times {eta(n)}(n=1)(infinity) are dependent random variables that, besides, may be dependent on a number of customers arriving in [0, t]. We obtain conditions for the virtual waiting time process in steady state to have a subexponential distribution function. We apply this result to a system with a Markov modulated semi-Markov input flow. We also consider a queue with a doubly stochastic Poisson flow in the case when the random intensity is a regenerative process. We show that these results could be transferred to corresponding systems with an unreliable server.
机译:本文致力于排队系统,在存在重尾部的存在下具有再生输入流动。 我们的目标是在静止制度中开发渐近的等待时间过程的可能性超过高水平。 在本文中,我们考虑在时间间隔[0,T]期间到达的客户的总服务时间作为输入流x(t)。 这允许我们考虑服务时间{eta(n)}(n = 1)(n = 1)(Infinity)是相关的随机变量的情况,除此之外,可以取决于到达[0,t]的许多客户。 我们在稳态处获得虚拟等待时间过程的条件,以具有子统计分布函数。 我们将此结果应用于带有Markov调制的半Markov输入流的系统。 我们还考虑在随机强度是再生过程的情况下具有双随机泊松流的队列。 我们表明这些结果可以传输到具有不可靠的服务器的相应系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号