The paper under review studies a single server queueing system without buffer. Customers arrive in the queue according to a Poisson process with rate \(\lambda\) and immediately receive the service, if the server is available. If the server is busy, the customer joins the orbit and retries after a deterministic time \(S\). This process is repeated until the customer finds an idle server. The customer service times are deterministic as well, and service and retrial times are equal. Drawing on a time-discretisation approach and on an equivalence with polling systems, the authors find explicit expressions for the distribution of the number of retrials, and the probability generating function of the number of customers in orbit. While the state space of the queueing system at hand is complicated, the results are strikingly simple. The number of retrials follows a geometric distribution, while the orbit size decomposes into two independent random variables: the system content of the \(M/D/1\) queue at departure times and the orbit size of the \(M/D/1\) retrial queue, when the server is idle. The authors finally obtain explicit expressions for the retrial rate after a departure and for the distribution of the time until the \(n\)th retrial after a departure.
- A Geo/G/1 retrial queueing system with priority services
- A continuous polling system with general service times
- A discrete-time Geo/G/1 retrial queue with general retrial times
- A retrial BMAP/PH/N system
- A retrial system with two input streams and two orbit queues
- A survey of retrial queueing systems
- An approximation method for the \(M/G/1\) retrial queue with general retrial times
- Approximation method for \(M/PH/1\) retrial queues with phase type inter-retrial times
- Approximation of \(M/M/c\) retrial queue with PH-retrial times
- APPROXIMATION OF PH/PH/c RETRIAL QUEUE WITH PH-RETRIAL TIME
- Conditions for stability and instability of retrial queueing systems with general retrial times
- Continuous polling models and application to ferry assisted WLAN
- Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times
- On the M/G/1 retrial queue subjected to breakdowns
- On the stability of retrial queues
- Polling systems and multitype branching processes
- Queueing systems on a circle
- Retrial queueing models in discrete time: a short survey of some late arrival models
- Retrial Queueing Systems
- Retrial Queues
- Single line queue with repeated demands
- Single-server queues with spatially distributed arrivals
- Stability and performance of greedy server systems
- Stability condition for a single-server retrial queue
- Stochastic analysis of a single server retrial queue with general retrial times
- Tail asymptotics for the \(M_1,M_2/G_1,G_2/1\) retrial queue with non-preemptive priority
- Tandem behavior of a telecommunication system with repeated calls. II: A general case without buffers
- The BMAP/PH/N retrial queue with Markovian flow of breakdowns
- The queue length in an M/G/1 batch arrival retrial queue
- A priority retrial queue with constant retrial policy
- Deterministic Retrial Times Are Optimal In Queues With Forbidden States
- On the retrial queue with imperfect coverage and delay reboot
- Admission control policy of a two heterogeneous server finite capacity retrial queueing system with maintenance activity
- Analysis of two-way communication in M₁^X, M₂/G₁,G₂/1 retrial queue under the constant retrial policy
- Performance and economic analysis of an unreliable single-server queue with general retrial times and varied customer patience levels
- A cost-efficient retrial queueing model for mitigating DDoS attacks with standby mechanisms
- Lower and upper stochastic bounds for the joint stationary distribution of a non-preemptive priority retrial queueing system
- Optimal capacity planning for cloud service providers with periodic, time-varying demand
- A discrete-time retrial queue with multiplicative repeated attempts
This page was built for publication: Retrial queues with constant retrial times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165519)