CFP last date
20 May 2024
Reseach Article

Article:M/M/1 Retrial Queuing System with Loss and Feedback 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 6
Year of Publication: 2010
Authors: G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar
10.5120/672-945

G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar . Article:M/M/1 Retrial Queuing System with Loss and Feedback under Pre-Emptive Priority Service. International Journal of Computer Applications. 2, 6 ( June 2010), 27-34. DOI=10.5120/672-945

@article{ 10.5120/672-945,
author = { G.Ayyappan, A.Muthu Ganapathi, Gopal Sekar },
title = { Article:M/M/1 Retrial Queuing System with Loss and Feedback under Pre-Emptive Priority Service },
journal = { International Journal of Computer Applications },
issue_date = { June 2010 },
volume = { 2 },
number = { 6 },
month = { June },
year = { 2010 },
issn = { 0975-8887 },
pages = { 27-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume2/number6/672-945/ },
doi = { 10.5120/672-945 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:50:15.342232+05:30
%A G.Ayyappan
%A A.Muthu Ganapathi
%A Gopal Sekar
%T Article:M/M/1 Retrial Queuing System with Loss and Feedback under Pre-Emptive Priority Service
%J International Journal of Computer Applications
%@ 0975-8887
%V 2
%N 6
%P 27-34
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Consider a single server retrial queueing system with loss and feedback under Pre-emptive priority service in which two types of customers arrive in a Poisson process with arrival rate λ1 for low priority customers and λ2 for high priority customers. These customers are identified as primary calls. The service times follow an exponential distribution with parameters μ1 and μ2 for both types of customers respectively. The retrial, loss and feedback are introduced for low priority customers only. Let k be the maximum number of waiting spaces for high priority customers in front of the service station. The high priorities customers will be governed by the Pre-emptive priority principle. The access from the orbit to the service facility is governed by the classical retrial policy. This model is solved by using Matrix geometric Technique. Numerical study have been done for Analysis of Mean number of low priority customers in the orbit (MNCO), Mean number of high priority customers in the queue (MPQL), Truncation level (OCUT), probability of server free and probabilities of server busy with low, high priority customers for various values of λ1 , λ2, μ1 , μ2, p, q, σ and k in elaborate manner and also various particular cases of this model have been discussed.

References
Index Terms

Computer Science
Information Sciences

Keywords

Retrial queues pre-emptive priority service loss and feedback Matrix Geometric Method classical retrial policy