a single-server retrial queue with general retrial times and bernoulli schedule:一般重试次数和伯努利时间的单服务器重试排队.pdfVIP

a single-server retrial queue with general retrial times and bernoulli schedule:一般重试次数和伯努利时间的单服务器重试排队.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
a single-server retrial queue with general retrial times and bernoulli schedule:一般重试次数和伯努利时间的单服务器重试排队

A lied Mathematics and Computation 162 (2005) 855–880 /locate/amc A single-server retrial queue with general retrial times and Bernoulli schedule I. Atencia a,*, P. Moreno b a Departamento de Matematica Aplicada, E.T.S.I. Telecomunicacion, Universidad de Malaga, Campus de Teatinos, 2907 1Malaga, Spain b Departamento de Economıa y Empresa, Facultad de Ciencias Empresariales, Universidad Pablo de Olavide, Ctra. de Utrera, km. 1, 41013 Sevilla, Spain Abstract We consider an M =G=1 retrial queue with general retrial times where the blocked customers either with probability q join the infinite waiting room (called priority queue) or with complementary probability p leave the service area and enter the retrial grou (called orbit) in accordance with an FCFS discipline. We assume that only the customer at the head of the orbit is allowed to retry for service. We study the ergodicity of the embedded Markov chain, its stationary distribution function and the joint generating function of the number of customers in both groups in the steady-state regime. Moreover, we obtain the generating function of the system size distribution, which generalizes the well-known Pollaczek–Khinchin formula. Also we obtain the stochastic decomposition law and as an a lication we study the asymptotic behaviour under high rate of retrials. Besides the optimal control of the priority policy is investigated. The results agree with known special cases. Finally, numerical calculations are used to ob- serve system performance. 2004 Elsevier Inc.

您可能关注的文档

文档评论(0)

ajgoaw + 关注
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档