Results 181 to 190 of about 2,852 (222)

A Priority Retrial Queue with Constant Retrial Policy

2018
We 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, Joris Walraevens, Herwig Bruneel   +2 more
openaire   +1 more source

Stability analysis of a multiclass retrial system with classical retrial policy

Performance Evaluation, 2017
We 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

APPROXIMATION OF PH/PH/c RETRIAL QUEUE WITH PH-RETRIAL TIME

Asia-Pacific Journal of Operational Research, 2014
We consider the PH/PH/c retrial queues with PH-retrial time. Approximation formulae for the distribution of the number of customers in service facility, sojourn time distribution and the mean number of customers in orbit are presented. We provide an approximation for GI/G/c retrial queue with general retrial time by approximating the general ...
YANG WOO SHIN, DUG HEE MOON
openaire   +3 more sources

NUMBER OF RETRIALS IN A FINITE SOURCE RETRIAL QUEUE WITH UNRELIABLE SERVER

Asia-Pacific Journal of Operational Research, 2014
The object of this paper is to continue investigation of a single server retrial queue with finite number of sources in which the server is subjected to breakdowns and repairs. The server life time as well as the intervals between repetitions are exponentially distributed, while the repair and the service times are generally distributed.
openaire   +2 more sources

Extended generator and associated martingales for M/G/1 retrial queue with classical retrial policy and general retrial times

Probability in the Engineering and Informational Sciences, 2022
AbstractA retrial queue with classical retrial policy, where each blocked customer in the orbit retries for service, and general retrial times is modeled by a piecewise deterministic Markov process (PDMP). From the extended generator of the PDMP of the retrial queue, we derive the associated martingales. These results are used to derive the conditional
S. Meziani, T. Kernane
openaire   +2 more sources

A Model of Rational Retrials in Queues

SSRN Electronic Journal, 2014
Customers often wait in queues before being served. Because waiting is undesirable, customers may come back later (i.e., retry) when the queue is too long. However, retrial attempts can be costly as a result of transportation fees and service delays. This paper introduces a framework for rational retrial decisions in stationary queues.
Shiliang Cui, Xuanming Su, Senthil K. Veeraraghavan   +2 more
openaire   +1 more source

Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates

Operations Research, 2020
Customer retrials commonly occur in many service systems, such as healthcare, call centers, mobile networks, computer systems, and inventory systems. However, because of their complex nature, retrial queues are often more difficult to analyze than queues without retrials.
Jinting Wang, Zhongbin Wang 0002, Yunan Liu   +2 more
openaire   +2 more sources

A survey of retrial queues

Queueing Systems, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Finite Source Retrial Queue: Number of Retrials

Communications in Statistics - Theory and Methods, 2013
We 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 ...
openaire   +1 more source

ESTIMATORS OF THE RETRIAL RATE IN M/G/1 RETRIAL QUEUES

Asia-Pacific Journal of Operational Research, 2006
In this article we analyze the M/G/1 retrial queue from a statistical viewpoint. Assuming that retrials are exponentially distributed we focus on the estimation of the retrial parameter for constant and non-constant retrial policies, including the non-ergodic case. We consider different estimators and compare their asymptotic variances.
openaire   +2 more sources