Showing papers on "Retrial queue published in 1996"
TL;DR: Two characteristics of the orbit are investigated, namely, the orbit busy period and the orbit idle period, which seem to be very useful from this point of view.
Abstract: In teletraffic applications of retrial queues only the service zone is observable. Another part of a retrial queue, the orbit, which represents the delay before repeated attempts to get service, cannot be observed. Thus, it is very important to get general results about behavior of the orbit. We investigate two characteristics of the orbit, namely, the orbit busy period and the orbit idle period, which seem to be very useful from this point of view.
20 citations
TL;DR: A model queueing system in which customers cannot be in continuous contact with the server, but must call in to request service, is analyzed and several characterstic quantities are calculated for both the constant rate of reapplying for service and for the case when customers are discouraged and reduce their rate of demand.
Abstract: We analyze a model queueing system in which customers cannot be in continuous contact with the server, but must call in to request service. If the server is free, the customer enters service immediately, but if the server is occupied, the unsatisfied customer must break contact and reapply for service later. There are two types of customer present who may reapply. First transit customers who arrive from outside according to a Poisson process and if they find the server busy they join a source of unsatisfied customers, called the orbit, who according to an exponential distribution reapply for service till they find the server free and leave the system on completion of service. Secondly there are a number of recurrent customers present who reapply for service according to a different exponential distribution and immediately go back in to the orbit after each completion of service. We assume a general service time distribution and calculate several characterstic quantities of the system for both the constant rate of reapplying for service and for the case when customers are discouraged and reduce their rate of demand as more customers join the orbit.
10 citations
Journal Article•
TL;DR: In this article, the authors considered a retrial queue with two classes of customers where arrivals of class 1 (resp. class 2) customers are MMPP and Poisson process, respectively.
Abstract: We consider a retrial queue with two classes of customers where arrivals of class 1(resp. class 2) customers are MMPP and Poisson process, respectively. In the case taht arriving customers are blocked due to the channel being busy, the class 1 customers are queued in priority group and are served as soon as the channel is free, whereas the class 2 customers enter the retrial group in order to try service again after a random amount of time. We consider the following retrial rate control policy, which reduces their retrial rate as more customers join the retrial group; their retrial times are inversely proportional to the number of customers in the retrial group. We find the joint generating function of the numbers of custormers in the two groups by the supplementary variable method.
5 citations
Journal Article•
TL;DR: In this article, the authors considered an M/G/1 retrial queueing system under the threshold control policy whose motivation comes from a telephone exchange system and found a necessary and sufficient condition for the model to be stable and derived the limiting distribution of the number of customers in the system at the moment of service completion.
Abstract: We consider an M/G/1 retrial queueing system under the threshold control policy whose motivation comes from a telephone exchange system. We find a necessary and sufficient condition for the model to be stable and derive the limiting distribution of the number of customers in the system at the moment of service completion. Special cases are treated and some numerical examples are also presented.
2 citations