a recursive methodology for the derivation of the blocking probabilities of tandem queues with finite capacity：一种用于有限容量串联队列阻塞概率的递推方法.pdfVIP

下载本文档

6
0
约2.04万字
约 5页
2016-03-12 发布于广东
举报
版权申诉

a recursive methodology for the derivation of the blocking probabilities of tandem queues with finite capacity：一种用于有限容量串联队列阻塞概率的递推方法.pdf

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

a recursive methodology for the derivation of the blocking probabilities of tandem queues with finite capacity：一种用于有限容量串联队列阻塞概率的递推方法

ComputersOpnsRex Vol. 17.No. 5. pp. 475-479, 1990 030%os48/90 53.00+ 0.00 Pnntcdm GreatBrmun All rightsreserved copyright 0 1990PergamonPressplc A RECURSIVE METHODOLOGY FOR THE DERIVATION OF THE BLOCKING PROBABILITIES OF TANDEM QUEUES WITH FINITE CAPACITY GEORGE D. TSIOTRAS’**and HUSSEINBADRzFt ‘ATT Bell Laboratories, 480 Red Hill Road, Middletown, NJ 07748, U.S.A. and 2Department of Computer Science, SUNY at Stony Brook,NY 11794-4400,U.S.A. (Recetved November 1988; revised November 1989) Scope and Purpose-Queuing networks with finite capacities have proved useful in modeling flexible manufacturing systems, public services, computer and communication systems and service facilities. Closed-form solutions for the analysis of such systems are not generally attainable. In this paper, we present a new recursive methodology for the calculation of the conditional blocking probabilities of a two-station tandem system with finite capacity. Abstract-In thrs paper we deal with a two-station tandem queuing system incorporating a finite Intermediate buNer between the stations. Blocking occurs when a customer is momentarily stopped at the first station owing to a capacity limitation of the second station having been reached. We assume general input and exponentially distributed service times. We o