郭永江, 张玉艳. 两服务台串联排队系统的逗留时间的强逼近[J]. 应用概率统计, 2020, 36(1): 1-10. DOI: 10.3969/j.issn.1001-4268.2020.01.001
引用本文: 郭永江, 张玉艳. 两服务台串联排队系统的逗留时间的强逼近[J]. 应用概率统计, 2020, 36(1): 1-10. DOI: 10.3969/j.issn.1001-4268.2020.01.001
shu
GUO Yongjiang, ZHANG Yuyan. Strong Approximation of the Sojourn Time for a Two-Stage Tandem Queue[J]. Chinese Journal of Applied Probability and Statistics, 2020, 36(1): 1-10. DOI: 10.3969/j.issn.1001-4268.2020.01.001
Citation: GUO Yongjiang, ZHANG Yuyan. Strong Approximation of the Sojourn Time for a Two-Stage Tandem Queue[J]. Chinese Journal of Applied Probability and Statistics, 2020, 36(1): 1-10. DOI: 10.3969/j.issn.1001-4268.2020.01.001
shu

两服务台串联排队系统的逗留时间的强逼近

Strong Approximation of the Sojourn Time for a Two-Stage Tandem Queue

    摘要
  • 摘要: 本文考虑了两服务台串联排队, 证明了重话务条件~(即服务强度\rho_1=\rho_2=1下逗留时间的强逼近,此处的逗留时间指的是一个顾客从到达系统到离开系统的这段时间,其强逼近是一个布朗运动的过程.

     

    Abstract: We obtain the strong approximation of the sojourn time progress for a two-stage tandem queue in heavy traffic, that is, the traffic intensity \rho_1=\rho_2=1. The sojourn time is the period from a customer's arrival to her departure, and the strong approximation is a function of Brownian motion.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回