首页> 外文期刊>Queueing systems >Tail asymptotics of the waiting time and the busy period for the M/G/1/K queues with subexponential service times
【24h】

Tail asymptotics of the waiting time and the busy period for the M/G/1/K queues with subexponential service times

机译:具有次指数服务时间的M / G / 1 / K队列的等待时间和繁忙时段的尾部渐近线

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

摘要

We study the asymptotic behavior of the tail probabilities of the waiting time and the busy period for the M/G/1/K queues with subexponential service times under three different service disciplines: FCFS, LCFS, and ROS. Under the FCFS discipline, the result on the waiting time is proved for the more general GI/G/1/K queue with subexponential service times and lighter interarrival times. Using the well-known Laplace-Stieltjes transform (LST) expressions for the probability distribution of the busy period of the M/G/1/K queue, we decompose the busy period into a sum of a random number of independent random variables. The result is used to obtain the tail asymptotics for the waiting time distributions under the LCFS and ROS disciplines.
机译:我们在三种不同的服务准则下(FCFS,LCFS和ROS)研究具有次指数服务时间的M / G / 1 / K队列的等待时间和繁忙时段的尾部概率的渐近行为。在FCFS准则下,对于具有次指数服务时间和更短到达时间的更通用的GI / G / 1 / K队列,证明了等待时间的结果。使用众所周知的Laplace-Stieltjes变换(LST)表达式计算M / G / 1 / K队列的繁忙时段的概率,我们将繁忙时段分解为随机数的独立随机变量之和。该结果用于获得LCFS和ROS学科下等待时间分布的尾部渐近性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号