期刊文献+

带有反馈机制的单服务台排队系统的泛函重对数律 被引量:2

Functional Law of Iterated Logarithm for Single Server Quene with Bernoulli Feedback
原文传递
导出
摘要 本文考虑了一个带有贝努里反馈机制的单服务台排队系统.我们将该系统的一些数量指标如队长过程,忙期过程,负荷过程的泛函重对数律的问题转化为一个反射布朗运动相关的问题,利用已有的布朗运动的重对数率的结果,刻画了队长过程,忙期过程,负荷过程的重对数律. In this paper, we consider the single server queue with Bernoulli feedback. We transfer the problem of functional law of iterated logarithm for queue length process, busy time process and the workload process into problems related to reflected Brownian Motion. By using properties of reflected Brownian Motion, we get the functional law of iterated log- arithm for queue length process, busy time process and the workload process and determine the parameters there.
出处 《应用数学学报》 CSCD 北大核心 2012年第4期586-594,共9页 Acta Mathematicae Applicatae Sinica
基金 国家自然科学基金(10901023 11101050) 中央高校基本科研业务费专项资金(BUPT2011RC0704)资助项目
关键词 单服务台排队 泛函重对数律 强逼近 贝努里反馈机制 single server queue functional law of iterated logarithm (FLIL) strong approximation bernoulli Feedback
  • 相关文献

参考文献7

  • 1Chen H, Yao D D. Fundamentals of Queueing Networks. New York: Springer-Verlag, 2001.
  • 2Iglehart D L. Multiple Channel Queues in Heavy Traffic IV: Law of the Iterated Logarithm. Zeitschrift Wahrescheinlichkeitstheorie View. Geb., 1971, 17:168-180.
  • 3Zhang H, Xu G. Stong Approximations for Open Queueing Network in Heavy Traffic. Science in China (Chinese Version) (Series A), 1992, 35:521-535.
  • 4Chen H, Shen X. Strong Approximations for Multiclass Feedforward Queueing Networks. The Annals of Applied Probability, 2000, 10:828-876.
  • 5Gamarnik D, Zeevi A. Validity of Heavy Traffic Steady-state Approximations in Generalized Jackson. The Annals o] Applied Probability, 2006, 16:56-90.
  • 6Horv-th L. Strong Approximations of Open Queueing Networks. Mathmatics of Operations Research, 1992, 17:487-508.
  • 7Karatzas I, Shreve S E. Brownian Motion and Stochastic Calculus, 2nd ed. New York: Springer- Verlag, 1991.

同被引文献6

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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