N台并联Fork-Join排队网络的弱收敛与强逼近  

Strong Approximation And Weak Convergence for N-union Station Fork-Join Queueing Network

作　　者：侯为波[1] 汪荣鑫[2] 

机构地区：[1]淮北煤师院数学系,235000 [2]上海铁道学院应数所,200333

出　　处：《淮北煤师院学报（自然科学版）》1995年第4期9-15,共7页Journal of Huaibei Teachers College(Natural Sciences Edition)

基　　金：国家自然科学基金

摘　　要：本文借助于概率测度弱收敛与概率论强逼近理论,较为详细地研究了N台并联Fork-Join排队网络,得到了响应时间、队长、离去过程的弱收敛与强逼近定理。这些结果具有一定的实际意义,并为一般型Fork-Join网络的研究提供了必要的理论基础。In this paper,N-union station Fork-Join queueing network is studied detailed by means of probability measure weak convergence and strong approximation in probability.We obtain weak convergence and strong approximation theorems for response time.queueing length and departure process.These theorems are useful in pracrice,and they are foundations for investigating more general Fork-Join queueing network.

关 键 词：Fork-Join排队 弱收敛 强逼近 Fork-Join网络 

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