首页 | 本学科首页   官方微博 | 高级检索  
     检索      

N台并联Fork-Join排队网络的弱收敛与强逼近
引用本文:侯为波,汪荣鑫.N台并联Fork-Join排队网络的弱收敛与强逼近[J].淮北煤炭师范学院学报(自然科学版),1995(4).
作者姓名:侯为波  汪荣鑫
作者单位:淮北煤师院数学系 235000 (侯为波),上海铁道学院应数所 200333(汪荣鑫)
摘    要:本文借助于概率测度弱收敛与概率论强逼近理论,较为详细地研究了N台并联Fork-Join排队网络,得到了响应时间、队长、离去过程的弱收敛与强逼近定理。这些结果具有一定的实际意义,并为一般型Fork-Join网络的研究提供了必要的理论基础。

关 键 词:Fork-join排队  弱收敛  强逼近  嵌入排队  响应时间

Strong Approximation And Weak Convergence for N-union Station Fork-Join Queueing Network
Hou vveibo Wang Rongxing.Strong Approximation And Weak Convergence for N-union Station Fork-Join Queueing Network[J].Journal of Huaibei Coal Industry Teachers College(Natural Science edition),1995(4).
Authors:Hou vveibo Wang Rongxing
Institution:Hou vveibo Wang Rongxing
Abstract: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.
Keywords:Fork-Join queueing  weak convergence  strong approximation  imbeded quueing  response time  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号