【摘要】 研究了较文［１］更一般的顾客带转移时间的ｋ台开排队网络。借助于概率论强逼近理论，在高负荷情形下得到了队长、虚等待时间、顾客逗留时间和离去过程的强逼近定理。研究结果表明，在高负荷情形下，两种模型具有相同的强逼结果。更多还原

【Abstract】 AbstractIn this paper, a more general opening queueing network, in which customers transfer from one station to other with a random time, is studied by means of strong approximation theory. This model is a generalization of model in . Some strong approximation theroems for queueing length, virtual waiting time, sojourn time and departure process are obtained under high loading and a theorem about sojourn time in is corrected. These theorems indicate that two models have same strong approximation results.更多还原