Stationary analysis of a single server retrial queue with priority and vacation

D. Arivudainambi, I. Averbakh and O. Berman

International Journal of Operational Research, 2009, vol. 5, issue 1, 26-47

Abstract: We study a single server retrial queue with Bernoulli vacations and a priority queue. A customer who finds the server busy upon arrival, either joins the priority queue with probability α, or leaves the service area and enters a retrial group (orbit) with probability α-bar (= 1 − α). Using the supplementary variable technique, we find the joint probability generating function of the number of customers in the priority queue and of the number of customers in the retrial group in a closed form. Also, we find explicit expressions for the mean queue length and the mean waiting time for both queues, and derive steady-state performance measures for the system. We show that the general stochastic decomposition law for M/G/1 vacation models holds for our system too. Some special cases and numerical results are also discussed.

Keywords: priority queue; probability generating functions; retrial queues; Bernoulli vacations; steady-state performance measures; stochastic decomposition; single server queues; supplementary variable technique. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=24528 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:5:y:2009:i:1:p:26-47

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().