一类Fork-Join排队网络的弱极限定理  

Weak Limits Theorems of the Fork Join Queueing Network

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

机构地区：[1]淮北煤师院数学系 [2]上海铁道大学应用数学所 [3]西安交通大学理学院

出　　处：《工程数学学报》1997年第4期59-66,84,共9页Chinese Journal of Engineering Mathematics

基　　金：国家自然科学基金

摘　　要：借助于概率测度弱收敛理论，对Ｎ台并联Ｆｏｒｋ－Ｊｏｉｎ排队网络进行了较为详细的研究，得到了响应时间、队长和离去过程等排队指标的弱收敛定理。对一般型Ｆｏｒｋ－Ｊｏｉｎ网络，提出一种新的研究方法，并针对某一类型Ｆｏｒｋ－Ｊｏｉｎ网络给出了响应时间的弱收敛定理。Abstract In this paper, N station parallel Fork Join network is investigated detailly by means of weak convergence theory in probability measure, some weak convergence theorems for response time, queueing length and departual processes are obtained. For general Fork Join network, a new method is introduced. As to given Fork Join network, a weak convergence theorem for response time is gotten.

关 键 词：Fork-Join网络 队长 排队网络 弱极限定理 

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