Results 201 to 210 of about 3,294 (252)
Some of the next articles are maybe not open access.
A Finite Source Retrial Queue: Number of Retrials
Communications in Statistics - Theory and Methods, 2013We consider a single-server queuing system with a finite number of sources, where customers are not allowed to queue; instead of that, they make repeated attempts, or retrials, in order to enter service after some time. This queuing system and its variants are widely used to model disk memory systems, star-like local area networks, and other ...
exaly +2 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
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
On the stability of retrial queues
Queueing Systems, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eitan Altman, Aleksandr A. Borovkov
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 +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 +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, J. Raja
openaire +1 more source
Stability analysis of a multiclass retrial system with classical retrial policy
Performance Evaluation, 2017We consider a multiserver retrial queueing system with a renewal input, K classes of customers, and a finite buffer. Service times are class-dependent, however, for each class, are independent, identically distributed (iid). A new class-i customer joins the primary system (servers and buffer), otherwise, if all servers and buffer are full, he joins the
Evsey Morozov, Tuan Phung-Duc
openaire +1 more source