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

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

作　　者：郭永江[1] 张玉艳 GUO Yongjiang;ZHANG Yuyan(School of Science,Beijing University of Posts and Telecommunications,Beijing,100876,China;Shanghai Police College,Shanghai,200137,China)

机构地区：[1]北京邮电大学理学院,北京100876 [2]上海公安学院,上海200137

出　　处：《应用概率统计》2020年第1期1-10,共10页Chinese Journal of Applied Probability and Statistics

基　　金：国家自然科学基金项目(批准号:11871116)资助。

摘　　要：本文考虑了两服务台串联排队,证明了重话务条件(即服务强度ρ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.

关 键 词：两服务台串联排队 流逼近 强逼近 布朗运动 

分 类 号：O226[理学—运筹学与控制论]