a single server priority queue with server failures and queue flushing:一个服务器故障和队列冲洗的单服务器优先级队列.pdfVIP

a single server priority queue with server failures and queue flushing:一个服务器故障和队列冲洗的单服务器优先级队列.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 priority queue with server failures and queue flushing:一个服务器故障和队列冲洗的单服务器优先级队列

Operations Research Letters 10 (1991) 353-362 August 1991 North-Holland A single server priority queue with server failures and queue flushing D o n T o w s l e y * Department of Computerand Information Science, Universityof Massachusetts, Amherst, MA 01003, USA S a t i s h K . T r i p a t h i Department of Computer Science, Universityof Maryland, CollegePark, MD 20742, USA Received March 1989 Revised October 1990 We consider a singler server queue serving two classes of customers according to a preemptive resume head of the line priority discipline. The server is prone to failures and at the time that they occur, all customers are flushed out of the system. The system is analyzed under the assumption of a bulk arrival Poisson arrival process, exponential service times, general repair times and exponential interfailure time~ priority queue, failure model, queue with flushing 1. Introduction In this paper we study the behavior of a single server that serves two classes of customers. Each customer has a priority assigned to it according to its class and a preemptive resume discipline is used to serve all customers. If we label the classes k = 1, 2; then we assume that class 1 customers have higher priority. Customers receive an amount of service that is exponentially distributed with a mean that depends on the customer class. The server is subject to failures. At the time of a failure, all customers in the system are flushed out. The time between failures is assumed to be an exponential

您可能关注的文档

文档评论(0)

ajgoaw + 关注
文档贡献者

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

1亿VIP精品文档

相关文档