Single line queue with repeated demands
Single line queue with repeated demands
复制标题
DOI：
10.1007/bf02411475
复制
发表时间：
1990-04
期刊：
影响因子：
1.2
通讯作者：
K. Farahmand
中科院分区：
文献类型：
--
作者：
K. Farahmand
我们分析了一个排队系统的模型，在这个模型中，客户只能呼入请求服务：如果服务器空闲，客户立即进入服务，但如果服务系统被占用，不满意的客户必须中断联系，稍后重新发起请求。这样的客户被称为“在轨”。本文考虑了以控制轨道再请求顺序的纪律为特征的三种模型。首先，轨道上的所有客户都可以重新申请，但随着越来越多的客户加入轨道，他们的需求率会降低。其次，FCFS纪律为轨道上不满意的客户运作。最后，LCFS规范管理轨道上的客户，而服务器在每次服务完成后会按指数分布休假。我们计算了这样的系统的几个特征量，假设一个一般的服务时间分布和第一个和重复请求到达之间的时间的不同指数分布。
We analyze a model of a queueing system in which customers can only call in to request service: if the server is free, the customer enters service immediately, but if the service system is occupied, the unsatisfied customer must break contact and reinitiate his request later. Such a customer is said to be in “orbit”. In this paper we consider three models characterized by the discipline governing the order of re-request of service from orbit. First, all customers in orbit can reapply, but are discouraged and reduce their rate of demand as more customers join the orbit. Secondly, the FCFS discipline operates for the unsatisfied customers in orbit. Finally, the LCFS discipline governs the customers in orbit and the server takes an exponentially distributed vacation after each service is completed. We calculate several characteristics quantities of such systems, assuming a general service-time distribution and different exponential distributions for the times between arrivals of first and repeat requests.