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
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
Strong Approximation of the Sojourn Time for a Two-Stage Tandem Queue
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.