%0 Journal Article
%T STRONG APPROXIMATIONS FOR OPEN QUEUEING NETWORKS IN SAfURAfION<br>饱和情形开排队网络的强逼近
%A Wang Rongxin
%A <br>江荣鑫
%J 系统科学与数学
%D 1997
%I 
%X 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.
%K Open queueing networks
%K strong approximation theorems
%K oblique reflected theorem<br>开排队网络
%K 强逼近理论
%K 斜反射定理
%K Wiener过程
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=5BEDEC31CB95A52F030B661BAE26BD70&yid=5370399DC954B911&vid=BCA2697F357F2001&iid=38B194292C032A66&sid=89AC6B0ADBEA2741&eid=DC330B09A33F1455&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0