期刊文献+

带有启动时间的GI/G/1排队系统的扩散逼近 被引量:3

On the fluid approximation for GI/G/1 queue with setup times
原文传递
导出
摘要 为了刻画通信网络中自动请求重发(automatic repeat request,ARQ)通信协议,将其模型化转为一个带有启动时间的GI/G/1排队系统。首先建立了服务员的闲期所满足的上下界函数关系,后利用此关系证明了该排队系统队长、负荷和忙期过程的扩散逼近,近似刻画了系统指标。 A GI/G/1 queue with setup times was modeled to describe the automatic repeat request (ARQ) protocol in communication network. First, a functional lower and upper bound for the idle time was constructed, and then the bound relation was used to obtain the diffusion approximations for the queue length, workload and busy time processes.
作者 于加尚
机构地区 菏泽学院教务处
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2011年第1期109-113,共5页 Journal of Shandong University(Natural Science)
基金 山东省自然科学基金资助项目(Y2008A16)
关键词 带有启动时间的GI/G/1排队系统 流体逼近 扩散逼近 GI/G/1 queue with setup times fluid approximation diffusion approximation
  • 相关文献

参考文献3

二级参考文献12

  • 1Kumar, P R, Re-entrant Lines. Queueing Systems, 1993, 13:87-110.
  • 2Chen H, Zhang H. Diffusion Approximations for Re-entrant Lines with a First-buffer-first-served Priority Discipline. Queueing System, 1996, 23:177-195.
  • 3Dai J G, Weiss G. Stablity and Instability of Fluid Models for Reentrant Lines. Mathematics of Operations Research, 1996, 21:115-134.
  • 4Chen H, Shanthikumar J G. Fluid Limits and Diffusion Approximations for Networks of Multi-server Queues in Heavy Traffic. Discrete Event Dynamic Systems, 1994, 4:269-291.
  • 5Skorohod A V. Stochastic Differential Equations for a Bounded Region. Theor. Prb. Appl., 1961, 6: 261-274.
  • 6Chow Y S, Teicher H. Probability Theorey. New York: Springer-Verlag, 1978.
  • 7Iglehart D W Whitt. Multiple Channel Queues in Heavy Trifl:ic I. Adv. Appl. Prob., 1970, 2:150-177.
  • 8Ross S M. Stochastic Processes, Second Edition. New York: Wiley, 1996.
  • 9Chung K L. A Course in Probability Theory, Second Edition. New York: Academic Press, 1974.
  • 10Dai J G, On the Positive Harris Recurrence for Multiclass Queueing Networks. Annals of Applied Probability, 1995, 5:49-77.

同被引文献22

  • 1侯振挺,刘国欣.马尔可夫骨架过程及其应用[M].北京:科学出版社,2005.
  • 2韩海丽,胡冰单服务台多服务员排队的强逼近[c].IEEE服务、运筹、物流与信息化国际会议,2012.
  • 3then H, ShAnthikumar J G. Fluid limits arid diffusion Approximations fop networks of multi-server queues in heavy trMfic[J]. Discrete Event Dynamic Systems. 1994; 4:269-291.
  • 4Chen H, Yao D D. Fundamentals of queueing networks[M]. New York: Springer-Verlag. 2001; 98-151.
  • 5Harrison J M,Zeevi A.A method for staffing large call centers using stochastic fluid models[J].Manufacturing Service Operations Management,2005,7(1):20-36.
  • 6Zeynep A,Mor A,Vijay M.The modem call center:a multi-disciplinary perspective on operations management research[J].Production and Operations Management,2007,16(6):665-688.
  • 7Feldman Z,Mandelbaum A,Massey W A,Whitt W.Staffing of time-varying queues to achieve time-stable performance[J].Management Science,2008,54(2):324-338.
  • 8Harrison J M.The Heavy Traffic Approximation for Single Server Queues in Series[J].Journal of Applied Probability,1973,10 (3):613-629.
  • 9Chen H,Sshanthikumar J G.Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic[J].Discrete Event Dynamic Systems,1994,4(3):269-291.
  • 10Perry O,Whitt W.A fluid approximation for service systems responding to unexpected overloads[J].Operations Research,2011,59 (5):1159-1170.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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