...
首页> 外文期刊>Mathematical Methods of Operations Research >The age of the arrival process in the G/M/1 and M/G/1 queues
【24h】

The age of the arrival process in the G/M/1 and M/G/1 queues

机译:G / M / 1和M / G / 1队列中到达过程的年龄

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

摘要

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit expressions for the conditional density functions, as well as some stochastic orders, in all three cases are given. Moreover, we show that this independence property, which we prove by elementary arguments, also leads to an alternative proof for the fact that given a busy server, the number of customers in the queue follows a geometric distribution. We conclude with a derivation for the Laplace Stieltjes Transform (LST) of the age of the inter-arrival time in the M/G/1 queue.
机译:本文表明,在G / M / 1排队模型中,在繁忙服务器上进行调节时,到达时间的长短和队列中的客户数量是独立的。用剩余的到达间隔时间或其总值代替年龄时,情况也是如此。在这三种情况下,都给出了条件密度函数的显式表达式以及一些随机阶数。此外,我们证明了通过基本论证证明的这种独立性,还为以下事实提供了另一种证明:在服务器繁忙的情况下,队列中的客户数量遵循几何分布。我们以M / G / 1队列中到达时间的年龄拉普拉斯Stieltjes变换(LST)为推论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号