Results 91 to 100 of about 430 (131)

Queueing system with a constant retrial rate, non-reliable server and threshold-based recovery

open access: yes
In this paper, we examine a Markovian queueing system which is composed of a retrial queue with constant retrial rate and a non-reliable server. Upon arrival a customer occupies the server if it is idle, otherwise it goes to the retrial queue.
Winkler, Anastasia, Efrosinin, Dmitry
core  

Diffusion Limit of Multi-Server Retrial Queue with Setup Time

open access: yesDiffusion Limit of Multi-Server Retrial Queue with Setup Time
openaire  

Matrix analytic methods for a multi-server retrial queue with buffer

open access: yesTop, 1999
In the paper reviewed above the authors have studied single server retrial queues. In this paper, they extend their results for multi-server retrial queues with Markovian arrival process, phase type service time distribution with two states and finite buffer.
Attahiru Sule Alfa
exaly   +3 more sources

A Multi-Server Retrial Queue with BMAP Arrivals and Group Services

open access: yesQueueing Systems, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chakravarthy, Srinivas R.   +1 more
openaire   +4 more sources

Analysis of a multi-server retrial queue with search of customers from the orbit

open access: yesPerformance Evaluation, 2006
We consider a multi-server retrial queueing model in which customers arrive according to a Markovian arrival process (MAP). An arriving customer finding a free server enters into service immediately; otherwise the customer enters into an orbit of infinite size.
Chakravarthy, Srinivas R.   +2 more
openaire   +3 more sources

Multi-server retrial queue with negative customers and disasters

Queueing Systems, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang Woo Shin, Shin Yang Woo
exaly   +3 more sources

On the multi-server retrial queue with geometric loss and feedback: computational algorithm and parameter optimization

International Journal of Computer Mathematics, 2011
We consider an M/M/c retrial queue with geometric loss and feedback. An arriving customer finding a free server enters into service immediately; otherwise the customer either enters into an orbit to try again after a random amount of time or leave the system without service.
Jau-Chuan Ke
exaly   +2 more sources

The infinite server queue and heuristic approximations to the multi-server queue with and without retrials

open access: yesTop, 1999
This paper discusses three topics: (1) monotonicity properties of the transition probabilities for the initially empty \(\text{M}_t/ \text{G}/ \infty\) queue, and qualitative similarities with the M/M/1 queue; (2) a comparison of such probabilities for \(\text{M/M/}m/m\) and \(\text{M/M/}\infty\) queues; and (3) decomposition formulae for operating ...
M. Ramalhoto
openaire   +3 more sources

An M/M/1 retrial queue with unreliable server

open access: yesOperations Research Letters, 2006
We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle.
Jeffrey P Kharoufeh
exaly   +3 more sources

Home - About - Disclaimer - Privacy