STRONG APPROXIMATIONS FOR OPEN QUEUEING NETWORKS IN SAfURAfION
饱和情形开排队网络的强逼近

In this paper, we consider the open queueing networks in saturation (i.e. all the traffic intensity of each station equals l). By using the strong approximation theory and obliqlle reflected theorem, the strong approximation theorems about the queue-length, virtual waiting time and sojourn time of one customer in the system are obtained.