Retrial queues with recurrent demand option
Summary: The object of this paper is to analyze the model of a queueing system in which customers can call it only to request service: if the server is free, the customer enters service immediately. Otherwise, if the service system is occupied, the customer joins a source of unsatisfied customers called the orbit. On completion of each service the recipient of service has an option of leaving the system completely with probability \(1-p\) or returning to the orbit with probability \(p\). We consider two models characterized by the discipline governing the order of requests for service from the orbit. First, all the customers from the orbit apply at a fixed rate. Secondly, customers from the orbit are discouraged and reduce their rate of demand as more customers join the orbit. The arrival at and the demands from the orbit are both assumed to be according to the Poisson process. However, the service times for both primary customers and customers from the orbit are assumed to have a general distribution. We calculate several characteristic quantities of these queueing systems.
- Single retrial queues with service option on arrival
- \(M/G/1/r\) retrial queueing systems with priority of primary customers.
- Discrete-time geo\(^{[X]}\)/G\(_{H}\)/1 retrial queue with Bernoulli feedback
- A retrial model in a nonstationary regime
- Single line queue with recurrent repeated demands
- An upper bound on the performance of queues with returning customers
- scientific article; zbMATH DE number 994722 (Why is no real title available?)
- Single retrial queues with loss of customers
- Recurrent retrial queues with service options on arrival
- An M^X/G/1 unreliable retrial queue with two phases of service and Bernoulli admission mechanism
- Single line queue with repeated demands
This page was built for publication: Retrial queues with recurrent demand option
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925153)
