Stationary analysis of a single server retrial queue with priority and vacation
by D. Arivudainambi, I. Averbakh, O. Berman
International Journal of Operational Research (IJOR), Vol. 5, No. 1, 2009

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.

Online publication date: Wed, 08-Apr-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com