Results 171 to 180 of about 3,514 (223)
A survey on retrial queues [PDF]
A systematized survey of the analytic results for retrival queues is given by discussing a generalized model A/B/s/m/O/H. Here, A and B describe the interarrival and service time distribution, respectively, s denotes the number of waiting positions in the queue, O is the capacity of an orbit for the retrying customers and \(H=\{H_ k\), \(k\geq 0 ...
J G C Templeton
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Multiclass Retrial Systems with Constant Retrial Rates
2021In a loss queueing system, a customer facing a busy server upon arrival (a blocked customer) leaves the system forever without waiting for service. However, in many applications, the blocked customers leaving the system may retry to enter service after some random time period.
Evsey Morozov, Bart Steyaert
openaire +1 more source
Approximation of M/M/c retrial queue with PH-retrial times
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dug Hee Moon, Yang Woo Shin
exaly +2 more sources
Approximations of retrial queue with limited number of retrials
Computers & Operations Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang Woo Shin, Dug Hee Moon
openaire +3 more sources
On the Conditional Probability of a Successful Retrial in Retrial Queues
INFOR: Information Systems and Operational Research, 2011Abstract Customer retrials are very common phenomena in industrial engineering and business management. The number of retrials required before receiving a success is an important measure for evaluating system performance. Focusing on the M/M/1 and M/M/2 retrial queues, we study the conditional probability of a successful retrial given that all previous
Bin Liu, Jinting Wang, Yiqiang Q. Zhao
openaire +1 more source
Stability Analysis of a Multi-class Retrial Queue with General Retrials and Classical Retrial Policy
2021 28th Conference of Open Innovations Association (FRUCT), 2021We deal with a single server multi-class retrial model, feed by Poisson input. The system is considered under classical retrial policy, while inter-retrial times are class dependent and generally distributed. Such systems have various applications like multi-access protocols or cellular mobile networks, where blocked messages are sent again after some ...
openaire +1 more source
On multiserver feedback retrial queues with balking and control retrial rate
Annals of Operations Research, 2006The paper considers a multiserver retrial queueing system in which primary customers arrive according to a Poisson process. The service facility consists of a finite number of identical servers and service times are exponentially distributed. An arriving customer who finds all servers busy enters the retrial group with probability \(p\) or is lost ...
B Krishna Kumar
exaly +2 more sources
A Priority Retrial Queue with Constant Retrial Policy
2018We analyse a priority queueing system with a normal queue (high priority) and an orbit (low priority). Only the first customer in orbit can retry during times that the queue and server are empty (constant retrial policy). In contrast with existing literature, we assume different service time distributions for the high- and low-priority customers.
Arnaud Devos +2 more
openaire +2 more sources
Estimation of retrial rate in a retrial queue
Queueing Systems, 1995Describing the time evolution of a purely exponential retrial queue by a two-dimensional vector (number of call attempts since last departure, number of calls in retrial queue) yields a nonstandard Markovian description of the system's time evolution. The second coordinate of this process determines essentially the retrial rate, but is not accessible ...
openaire +2 more sources
The Israeli queue with retrials
Queueing Systems, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nir Perel, Uri Yechiali
openaire +3 more sources

