摘要
本文考虑了两服务台串联排队,证明了重话务条件(即服务强度ρ1=ρ2=1)下逗留时间的强逼近,此处的逗留时间指的是一个顾客从到达系统到离开系统的这段时间,其强逼近是一个布朗运动的过程.
We obtain the strong approximation of the sojourn time progress for a two-stage tandem queue in heavy traffic,that is,the traffic intensity ρ1=ρ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.
作者
郭永江
张玉艳
GUO Yongjiang;ZHANG Yuyan(School of Science,Beijing University of Posts and Telecommunications,Beijing,100876,China;Shanghai Police College,Shanghai,200137,China)
出处
《应用概率统计》
CSCD
北大核心
2020年第1期1-10,共10页
Chinese Journal of Applied Probability and Statistics
基金
国家自然科学基金项目(批准号:11871116)资助。
关键词
两服务台串联排队
流逼近
强逼近
布朗运动
two-stage tandem queue
fluid approximation
strong approximation
Brownian motion
