M/M/1 Retrial queueing system with negative arrival under non-preemptive priority service
DOI:
https://doi.org/10.11113/mjfas.v5n2.295Keywords:
Queues, Repeated attempts, Negative arrival, Priority service, Matrix Geometric MethodAbstract
Consider a single server retrial queueing system with negative arrival under non-pre-emptive priority service in which three types of customers arrive in a poisson process with arrival rate λ1 for low priority customers and λ2 for high priority customers and λ3 for negative arrival. Low and high priority customers are identified as primary calls. The service times follow an exponential distribution with parameters μ1 and μ2 for low and high priority customers. The retrial and negative arrivals are introduced for low priority customers only. Gelenbe (1991) has introduced a new class of queueing processes in which customers are either positive or negative. Positive means a regular customer who is treated in the usual way by a server. Negative customers have the effect of deleting some customer in the queue. In the simplest version, a negative arrival removes an ordinary positive customer or a random batch of positive customers according to some strategy. It is noted that the existence of a flow of negative arrivals provides a control mechanismto control excessive congestion at the retrial group and also assume that the negative customers only act when the server is busy. 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 Non-preemptive priority service. 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 and high priority customers for various values of λ1 , λ2 , λ3 , μ1 , μ2 ,σ and k in elaborate manner and also various particular cases of this model have been discussed.
References
Altman. E and A.A. Borovkov, Queueing Systems, 26 (1997) 343-363.
Anisimov. V.V and Artalejo. J.R., Queueing Systems 39 (2001) 157-182.
Aleksandrovs A.M., Engineering Cybernetics, 12 (1974) No.3, 1- 4.
Artalejo J.R., Operations Research Letters, 17 (1995) 191-199.
Artalejo J.R., Proceedings of the International Conferences on Stochastic Processes, (1998) 159-167.
Artalejo J.R. and A. Gomez Corral, OR SpeKtrum, 20 (1998) 5-14.
Artalejo J.R., Progress in 1990-1999 Top, 7 (1999) 187-211.
Artalejo J.R. and A. Gomez Corral, Journal of Applied Probability, 36 (1999) 907-918.
Artalejo J.R. and S.R. Chakravarthy, TOP, Vol 14, 2 (2006) 293-332.
Ayyappan. G, A. Muthu Ganapathi Subramanian and Gopal sekar, Pacific Asian Journal of Mathematics (2009).
G.Ayyappan, A. Muthu Ganapathi Subramanian and Gopal sekar, Proceeding of International Conference of Mathematical and Computational
Models, PSGTECH ,Coimbatore, India (2009).
Choi B.D, Choi K.B, Lee Y.W., Queueing Systems, 19 (1995) 215-229.
Choi B.D and Y. Chang, Mathematical and Computer Modelling, 30 No. 3-4 (1999) 7-32.
Diamond J.E and Alfa A.S., Stochastic Models,11 No.3 (1995) 447-470.
Falin G.I., Ukrainian Math Journal, 41 No.5 (1989b) 559-562.
Falin G.I., Queueing Systems, 7 No.2 (1990) 127-167.
Falin G.I., Artalejo J.R, Martin.M., Queueing Systems, 14 (1993)439-455.
Falin G.I. and J.G.C. Templeton, Champman and Hall, London, 1997.
Farahmand .K., Queueing Systems, 6 No.2 (1990) 223-228.
Gomez-Corral. A., Annals of Operationas, 141 (2006) 163-191.
Gomez Corral. A., Computers and Mathematics with Applications, 43 No. 6-7 (2002) 767-882.
Kalyanaraman. R and B.Srinivasan, International Journal of Information and Management,14 No.4 (2003) 49-62.
Koba E.V., Cybernetics and System Analysis, 41 (2005) 100-104.
Krishnamoorthy A. and K.P. Jose, Journal Applied Mathematics and Statistics, Vol 2007 article ID (2007)37848
Kulkarni V.G., Journal of Applied Probability, 20 No.2 (1983a) 380-389
Kulkarni V.G. and H.M. Liang, Frontiers in Queueing, (1997)19-34,CRC press.
Lee. Y.W., Bulletin of the Koerean Mathematical Society, 42 (2005) 875-887.
Liang H.M. and Kulkarni V.G., Advances in Applied Probability, 25 No.3 (1993b) 690-701.
Neuts M.F., Rao B.M., Queueing Systems, 7 (1990) 169-190.
Templeton J.G.C. Retrial Queues, Queueing Systems, 7 No. 2, (1990) 125-227.
Templeton J.G.C. Retrial Queues, Top 7, (1999) 351-353.
Yang T and Templeton J.G.C., Queueing Systems, 2 (1987) 201-233.
Vladimir V. Anisimov and J.R. Artalejo, Queueing Systems, 39 (2001) 157-182.
Yang Woo Shine, Queueing Systems, 55 (2007) 223-237.
