期刊文献+

N台并联Fork-Join排队网络的弱收敛与强逼近 被引量:1

Strong Approximation And Weak Convergence for N-union Station Fork-Join Queueing Network
下载PDF
导出
摘要 本文借助于概率测度弱收敛与概率论强逼近理论,较为详细地研究了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.
出处 《淮北煤师院学报(自然科学版)》 1995年第4期9-15,共7页 Journal of Huaibei Teachers College(Natural Sciences Edition)
基金 国家自然科学基金
关键词 Fork-Join排队 弱收敛 强逼近 Fork-Join网络 Fork-Join queueing weak convergence strong approximation imbeded quueing response time.
  • 相关文献

参考文献4

二级参考文献9

共引文献6

同被引文献7

  • 1张汉勤.高负荷情形下排队系统的强逼近:博士论文[D].北京:中国科学院应用数学所,1990.
  • 2Vien N. Processing networks with parallel and sequential tasks: heavy traffic analysis and Brownian limits. The Annals of Avvlied Probability, 1993, 1: 28-55.
  • 3Csorgo M and Revese P. Strong Approximation in Probability and Statistic, New York: Academic Press, 1981.
  • 4Csorgo Met al. Invariances principles for renew processes. The Annals of Prob., 1987, 4: 1441-1460.
  • 5Komles et al. An approximation of partial sum of independent R.V.'s and the sample D.F.Wahrscheinlichkeitsth, I, 1975, 32: 111-131; II, 1976, 34: 33-58.
  • 6Zhang Hanqin, Hsu Guanghui. Strong approximation for priority queuing: Head-of-the-line-first discipline. Queueing Systems, 1992, 10: 213-234.
  • 7徐学雷,郑大钟.Fork-Join排队网络建模与分析的研究进展[J].控制理论与应用,1992,9(5):449-458. 被引量:4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部