CFP last date
20 May 2024
Reseach Article

Retrial Queueing System with Single Working Vacation Under Pre-Emptive Priority Service

by G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 2 - Number 2
Year of Publication: 2010
Authors: G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar
10.5120/630-877

G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar . Retrial Queueing System with Single Working Vacation Under Pre-Emptive Priority Service. International Journal of Computer Applications. 2, 2 ( May 2010), 28-35. DOI=10.5120/630-877

@article{ 10.5120/630-877,
author = { G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar },
title = { Retrial Queueing System with Single Working Vacation Under Pre-Emptive Priority Service },
journal = { International Journal of Computer Applications },
issue_date = { May 2010 },
volume = { 2 },
number = { 2 },
month = { May },
year = { 2010 },
issn = { 0975-8887 },
pages = { 28-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume2/number2/630-877/ },
doi = { 10.5120/630-877 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:49:40.801994+05:30
%A G.Ayyappan
%A A.Muthu Ganapathi
%A Gopal Sekar
%T Retrial Queueing System with Single Working Vacation Under Pre-Emptive Priority Service
%J International Journal of Computer Applications
%@ 0975-8887
%V 2
%N 2
%P 28-35
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Consider a single server retrial queueing system with pre-emptive priority service and single working vacation in which two types of customers arrive in a Poisson process with arrival rates ?1 for low and ?2 for high priority customers. We assume that regular service times follow an exponential distribution with parameters µ1 and µ2 correspondingly. The retrial is introduced for low priority customers only. During working vacation the server serve’s the arriving customers with lesser service rates µ3 and µ4 respectively. These service rates µ3 and µ4 follow an exponential distribution. However at any time the server may return from the working vacation with a working vacation rate a which follows the exponential distribution. The access from orbit to the service facility follows the classical retrial policy and the high priority customers will be governed by the pre-emptive priority service. This model is solved by using Matrix geometric Technique. Numerical study have been done in elaborate manner for finding the Mean number of customers in the orbit, Probabilities that server is idle, busy during working vacation and normal period.

References
  1. Artalejo .J.R. A classified bibliography of research on retrial queues Progress in 1990-1999, Top 7, pp.187-211, 1999.
  2. Choi B.D and Y. Chang. Single server retrial queues with priority calls, Mathematical and Computer Modeling, 30, No. 3-4, pp.7-32, 1999.
  3. Falin G.I, Artalejo J.R, Martin. M .On the single server retrial queue with priority customers, Queueing systems 14, pp. 439-455, 1993.
  4. Gomez-Corral. A, Analysis of Single server retrial queue with quasi random input and non-pre-emptive priority, Computers and Mathematics with Applications, Vol 43,No.6-7, pp 767-882,2002
  5. G.Ayyappan, A. Muthu Ganapathi Subramanian and Gopal sekar. M/M/1 Retrial Queueing System with pre-emptive priority Service and Single Vacation – Exhaustive Service, Pacific Asian Journal of Mathematics,Vo1 3, No.1-2, pp.307-322, 2009 .
  6. Liu. W, Xu .X and Tian. N. Some results on the M/M/1 queue with working vacation, Operation Research Letters, Vol 35, No.5, pp 595-600, 2007.
  7. Servi L.D and S.G. Finn. M/M/1 queue with working vacation, Performance evaluations,Vol.50, No.1, pp 41-52, 2002.
  8. Tian. N, Zhao. X and Wang. K. The M/M/1 queue with single working vacation, International Journal of Information and Management Science, Vol.19, No.4, pp 621-634, 2008.
  9. Tien Van Do. M/M/1 retrial queue with working vacation, Acta Informatica, Vol 47, No.1, pp 67-75, 2009.
  10. Wu. D and Takagi. H. M/G/1 queue with Multiple working vacation, Performance Evaluation, Vol.63,issue 7, pp 654-681, 2006.
Index Terms

Computer Science
Information Sciences

Keywords

Single Server pre-emptive priority service working vacation Matrix Geometric Method classical retrial policy