ANALYSIS OF M[X1],M[X2]/G1, G2/1 RETRIAL QUEUE WITH PRIORITY SERVICES, DIFFERENTIATE BREAKDOWN,REPAIR, SYNCHRONIZED RENEGING AND OPTIONAL VACATION Текст научной статьи по специальности «Медицинские технологии»

ANALYSIS OF M[X11, M[X 1 /G1, G2/1 RETRIAL QUEUE

WITH PRIORITY SERVICES, DIFFERENTIATE BREAKDOWN,REPAIR, SYNCHRONIZED RENEGING AND OPTIONAL VACATION

G. Ayyappan, S. Nithya •

Department of Mathematics Puducherry Technological University Puducherry-605014, India [email protected], [email protected]

Abstract

This study deals with the steady-state analysis of single-server retrial non-preemptive priority queue with differentiate breakdown, repair, synchronized reneging and optional vacation. For this purpose, two categories of customers are considered, priority and ordinary customers, who arrive as per Poisson arrival process. The server consistently affords single service for these customers based on general distribution. The server randomly fails while providing service to the customer Hard failure and soft failure are the two kinds of system failure. Hard failure is defined as an equipment failure that requires a repairman with specialized knowledge to be physically present, which is a time-consuming process. Whereas soft failure is defined as failure caused by events rather than physical condition and is usually resolved rebooting the system. Ordinary customers may renege the orbit if the server is engaged or unavailable. Furthermore, once the service of all priority customers is completed by the server, the server goes for a vacation or becomes idle. In this study, we used probability generating function and supplementary variable technique to solve the Laplace transforms of time-dependent probabilities of system states. Finally, we evaluated performance measures and expressed the results in numerical values.

Keywords: Batch arrivals; Priority queues; Differentiate Breakdown; Optional Vacation; Synchronized Reneging

AMS Subject Classification (2010): 60K25, 68M30, 90B22.

1. Introduction

A significant feature of a queuing situation (e.g., telecommunication system) is that when all servers are busy, an arriving customer is forced to exit the area of service and return to the retrial group after a particular period. These scenarios can be overcome by using retrial queues; for example if a server is found unavailable by the customers who arrives, then they will join the orbit to try their requests in random orders and at random moments. In real word, retrial queues are widely utilized as models for stochastic phenomena such as telecommunication networks, telephone switching systems, and computer systems so as to gain service from central processing unit. Recently, the literature on retrial queues has grown rapidly. Many researchers have investigated single-server retrial queues with two classes of customers. Wua and Lian [16] analyzed an M[11, M[21 /G/1 G-queueing system with retrial customers and a server subject to breakdown and repair. Choudhury et al. [10] extensively analyzed an M[X1 /G/1 retrial queue with service interruption and optional service . Ammar and Rajadurai [2] studied a preemptive priority queueing system with disaster and the server working at the lower speed. Ayyappan and Udayageetha [4] discussed a priority retrial queueing system with collisions, working

breakdown, reneging, two-way communication and immediate feedback . Arivudainambi and Godhandaraman [3] investigated single-server retrial queueing system with second optional service, balking and single vacation.

In the history of queueing analysis, priority queueing system has gained crucial attention. Preemptive and non-preemptive disciplines are the two types of priority disciplines. Priority customers, in case of non-preemptive discipline, have to wait until the service to ordinary customers completed. However, in case of preemptive discipline, priority customers will always interrupt the service provided to ordinary customers. Dhas et al. [11] described a preemptive priority queue with general bulk service and heterogeneous arrivals. Brandwajn and Begin [8] examined preemptive priority system with general inter arrival and service times. Kim et al. [17] explained a non-preemptive priority queue with two classes of customers and multiple vacations. Krishnamoorthy et al. [18] analyzed non-preemptive priority queue with priorities and service time that are self generated and follows PH-distribution. Dimitriou [12] investigated a retrial queue with mixed priorities, unreliable server, negative arrivals and multiple vacations.

A server in a queuing system would be unavailable for some time due to different reasons, for example, being under maintenance work, busy at another queue, or simply taking a break. Baruah et al. [7] explained a two-stage of service with reneging during breakdown and vacation periods. Choudhury and Kalita [9] analyzed the steady-state behaviour of a M/G/1 queue with optional repeated service and two types of general heterogeneous service subject to server breakdown that randomly occurs at any point in time while serving the customers and during delayed repair. Maragathasundari and Srinivasan [20] investigated a non-Markovian queueing model with multistage of services, in which the authors considered reneging to prevail in case of unavailability of the server during system breakdown or vacation periods. Jain et al. [14] studied a general retrial M[X1 /G/1 queue with Bernoulli vacation and second optional service. In this model, breakdowns are observed at random intervals at any point in time during the provision of service to the customers. Janani [15] described transient analysis of single-server queueing model with differentiated breakdown.

The server is assumes to take vacations at random intervals. However, even if the system has a single priority customer, no vacation is allowed. Therefore, the server may take an optional random length vacation after the last service of the last priority customer is served. Gupta et al. [22] generalized impatient customers in queueing system with optional vacation policies. Madan and Rawwash [19] determined M[X] / G/1 queueing system with feedback and optional server vacations based on single vacation. Laxmi et al. [24] investigated M/M/1 queueing system with second optional service, correlated reneging and working vacations. Ayyappan et al. [5] analysed M[X1 / G/1 queueing system with optional server vacation and two phases of service. Ordinary customers become impatient if the server is busy or unavailable. However, they execute synchronized abandonments motivated by remote systems. Adan et al. [1] have performed a detailed analysis of queueing models with impatient customers and vacations. Economou and Kapodistria [13] explained single-server queueing system with synchronized reneging customers. A single server queueing model with reneging, feedback and balking was examined by Rakesh Kumar and Soodam [23]

Two different types of customers, priority and ordinary customers are to be considered in this work with differentiate breakdown, repair, synchronized reneging optional vacation and followed by non preemptive priority discipline. The server provide service to the customer but randomly fails. Hard failure is defined as an equipment failure that usually necessitates the physical presence of a repairman with specialized knowledge, which is a time-consuming process. Soft failure, on the other hand, is defined as failure caused by events rather than physical condition and usually resolved rebooting the system. Ordinary customers may go back from the orbit if the server is unavailable. Furthermore, the server becomes idle or goes for a vacation on completing the service of all priority customers.

Figure 1: Schematic representation

This article is organized as follows. Mathematical model is described in Section 2 and queue size distribution is analyzed in Section 3. An explicit expression for governing equation is enlisted in Section 4. Steady state analysis is discussed in Section 5. Particular cases are obtained in Section 6. The effect of system performance measures is illustrated in Section 7. Numerical and graphical results are derived and conclusion is obtained in Section 8 and 9.

2. Description of the Model

• Arrival Process : Two different types of units arrive in batches with independent Poisson compound process. Let A1, A2 > 0 be the arrival rate for priority and ordinary customers, respectively. Assume that the first order probabilities for priority and ordinary units \1cidt (i = 1,2,3,...) and \2Cjdt (j = 1,2,3,...) with batch size i and j units arrive at the system

during a short interval of time (t, t + dt). Here, 0 < Ci < 1, Ci = 1,0 < Cj < 1,

j ^ =1

• Retrial Service Process : Ordinary customers are known as retrial customers. These customers will go back to the orbit and will request repeatedly for their service after some time if the server is busy or unavailable.

• Regular Service Process : Ordinary and priority customers ordinate in batches with distinct queues. Service rate follows general distribution and server renders single service for priority customers and ordinary customers with service rate ^i (v), i = 1,2 respectively. The service for ordinary customers starts when the priority queue is empty.

• Differentiate Breakdown and repair : The rates of hard and soft failure are exponentially distributed with rate a\ & a2 respectively. For soft failure, the repair time follows exponential distribution with rate n1 and for hard failure, the repair time follows general distribution with rate n2(v).

• synchronized Reneging : If the server is not available in the system, ordinary customer either exit the orbit with probability £ or join the orbit with probability 1 — £.

• Vacation: The server may take a vacation with probability 9 or it may remain idle with

probability 1 — 9 after serving all priority customers. The random variable for vacation time

G. Ayyappan, S. Nithya

ANALYSIS OF M^ 1,M^l/Gi,G2/1 RETRIAL QUEUE WITH RT&A, No 2 (73) PRIORITY SERVICES, DIFFERENTIATE BREAKDOWN,REPAIR,..._Volume 18, June 2023

V, with rate y(v) follows general distribution.

3. Analysis of queue size distribution

This section deals with the derivation of governing equations. On account of non-Markovian queueing system, probability generating function and supplementary variable have been used to solve this model. Let,

N1(t) = Number of priority customers in the queue at time t, N2(t) = Number of ordinary customers in the queue at time t, Y(t) = State of the server at time t.

Here M0(t), B?(t) for i = 1,2., V0(t), R0(t), indicates elapsed service time for retrial, service for priority and ordinary customers, vacation and repair at time t.

To obtain a bivariate Markov process {N1 (t), N2(t), Y(t), t > 0}, Y(t) denotes the server state. Here Y(t) = (0,1,2,3,4,5), which mean as follows: 0, the server is idle; 1, server is in retrial state; 2, busy with priority customers; 3, busy with ordinary customers; 4, on vacation and 5, repair.

Let us assume that, M(0) = 0, M(to) = 1, Bi(0) = 0, Bi(to) = 1, V(0) = 0, V(to) = 1 and R(2)(0) = 0, R(2) (to) = 1 be continuous at v = 0 for i = 1,2.

The functions ß(v), m1(v), m2(v), j(v) and y2(v) be the hazard rate for retrial, priority and ordinary customers service rate, vacation and repair.

dM(v) , N dBi(v) . „ , , dV(v) , , dR(2)(v)

ß(v) = i-¿¿r; m(v) = 1 'g( A, i = 1,2 Y(v) = 1 ¿A; n2(v) = ( )

1 - M(v)' 1 - Bi(v)' ' 1K ' 1 - V(v)' /2W 1 - R(2)(v)'

The probability I0,n (v, t) = PrN(t) = 0, N2(t) = 0, Y(t) = 0 and probability densities are as follows:

I0,n(v, t)dv = Pr{N1(t) = 0,N2(t) = n, Y(t) = 1; v < I0(t) < v + dv},n > 1 Pm,n(v, t)dv = Pr{N1 (t) = m,N2(t) = n, Y(t) = 2; v < B0(t) < v + dv}, Qm,n(v, t)dv = Pr{N1 (t) = m,N2(t) = n, Y(t) = 3; v < B0(t) < v + dv}, Vm,n(v, t)dv = Pr{N1 (t) = m,N2(t) = n, Y(t) = 4; v < V0(t) < v + dv}, Rm,n(v, t)dv = Pr{N1(t) = m, N2(t) = n, Y(t) = 5; v < R0(t) < v + dv},

for v > 0, t > 0, m > 0 and n > 0. 4. Equation Governing the System

d rM

dtl0,0(t) = - (A1 + A2)I0,0(t) + (1 - 0) y P0,0(v, t)^(v)dv

+ (1 - 0) Q0,0(v, t)^2(v)dv + r020(v, t)n2(v)dv (1)

+ R010(t)n1 + V0,0(v, t)7(v)dv.

-I0,n (v, t) + 510,n (v, t)= - (A1 + A2 + 0(v))I0,n (v, t) for n > 1. (2)

5t 5v

d d

d Pm,n (v, t) + — Pm,n (v, t) = — (A1 + A2 + «1 + «2 + f1(v))Pm,n (v, t) dt dv

m

+ A1 (1 — 5om ) Y C(Pm—i,n (v, t) i=1 n

+ A2 (1 — 5on) Y CjPm,n—j (v, t) for m, n > 1.

j=1

d d

d~t Qm,n (v, t) + djv Qm,n (v, t) = — (A1 + A2 + «1 + «2 + f2(v)) Qm,n (v, t)

+ A1(1 — 80m) Y CiQm—i,n (v, t) i=1 n

+ A2(1 — 80n) Y CjQm,n—i(v, t) for m, n > 1.

j=1

d d

d~tVm,n (v, t) + dv Vm,n (v, t) = — (A1 + A2 + £ + j(v))Vm,n (v, t) + £Vm,n+1(v, t)

m

+ A1(1 — 80m) Y CiVm—i,n (v, t) i=1 n

+ A2(1 — 80n) Y CjVm,n—i (v, t) for m, n > 1.

j=1

ddtRnln(v, t) + dRmn(v, t) = — (A1 + A2 + £ + n1 )R(m!n (t) + £Rmi+1 (t)

p TO

a 1 (Pm,n(v, t) + Qm,n(v, t))dv 0

m,n

m

CR

m

j=1

d-Rlmi(v, t) + dvRmn(v, t) = — (A1 + A2 + £ + rn(y))RV (v, t) + £R®n+1 (v, t)

m (2)

+A1(1 — 80m) y CiRm—i,n (v, t)

i=1

n

+ A2(1 — 80n) Y CjR^n-i(v, t) for m, n > 1.

j=1 —

Define, the boundary conditions at v = 0

!• TO !• TO

Pm,n (0, t) = J^ Pm+1,n (v, t)U1 (v)dv + J Qm+1,n (v, t)f2 (v)dv

+ 1°° RS 1,n (v, -)V (v)dv + ¿m 1,n (0m + A1Cm+1 ¡0,n (t),

p TO

Q0,0(0, t) = A2C1 ¡0,0 (t) + J ¡0,1 (v, t)p(v)dv (9)

l- TO n

Q0,n (0, t) = A2Cn+1 ¡0,0(t) + yo ¡0,n+1 (v, t)P(v)dv + Y A2Ci (v, t)

p TO

+ ¡0,n+1—i(v, t)dv for n > 1.

0

(3)

(4)

(5)

+ A1 (1 — 80m) Y CrR^n (t) (6)

i=1

+ A2(1 — 80n) YCjR^(t) for m, n > 1.

(7)

(8)

prn pœ

Vo,n(0, t) = Qj Po,n(V, (v)dv + Qj Qo,n(v, (v)dv, for n > 0. (11)

(2) tœ tœ Rm,n (0,t) = a2 Pm-1,n (v, (v)dv + «2/ Qm,n(v, t)^(v)dv, for m, n > 0. (12)

Jo Jo

7o,n(o, t) = (1 - e) Po,n(v, t)^(v)dv + R02n (v, t)n2(v)dv + «S (t)ni

/• œ /• œ

+ (1 - eW Qo,n (v, t)^(v)dv + / Vo,n (v, fb(v)dv, oo

(13)

(14)

Pm,n(o) = Qm,n (o) = R2,(0) = Rm2)n(0) = Vm,n(0) = 0, for m, n > 0 and Io,0 = 1, 70,n (0) = 0, for n > 1 are the initial conditions. Now, we define the Probability Generating Function (PGF),

œ œ œ

I(v,t,zo) = £ zmIo,n(v, t); A(v, t,zx,z2) = £ £ zî^Am^(v, t);

n=1 m=0n=0

œœ

A(v, t,Z1) = £ zîAm(v, t); A(v, t,Z2) = £ znAn(v, t); (15)

m=0 n=0

here A = P, Q, V, R(1), R(2).

By applying Laplace transforms to equations (1) to (13) and by using (14) and (15), we obtain the following equations:

1o (v, s, Z2) = 7o(0, s, Z2)e-(s+À1+À2)v-/0^(f)df, (16)

P(v, s, zi, z2 ) = P(0, s, zi, z2 )e-^1 (s,z) v-/ovF1(t)dt, (17)

Q(v, s, z1, z2 ) = Q(0, s, z1, z2 )e-i1 (s,z) v-/ov ^2(t)dt, (18)

V(v, s, z1, z2 ) = V (0, s, z1, z2 )e-^2(s,z) v-/ov7(f)df, (19)

R(2) (v, s, z1, z2) = R(2)( 0, s, z1, z2 )e-^2 (s,z) v-/ov n2(t)dt. (20)

where,

<£1 (s,z) = s + À1(1 - C(z1 )) + A2(1 - C(z2)) + «1 + k2, (21)

<£2(s,z) = s + A1(1 - C(z1 )) + A2(1 - C(z2)). (22)

'1 - (s + A1 + A2)70,0(s)E1(s,z) + C(z2)A27o,o(s)

1 _ _ — [A(s, z)D(s, z) + B(s, z)E1 (s, z)]F(s, z) + C(z2 )A2 loo (s)

Q(0, s, z2) = -., M ^ ^ , , A (23)

z2[E1(s,z) - A(s,z)C(g(z2))A1[1 - f+sA++1A+ A2);

- [A(s,z)D(s,z) + B(s,z)E1 (s,z)]F(s,z)

'1 - (s + A1 + A2)To,o(s)E1 (s,z) + C(z2)A27o,o(s)' 1

_ — [A(s, z)D(s, z) + B(s, z)E1 (s, z)]

7o (0, s, z2) = ^^-=-.-(24)

) z2[E1 (s,z) - A(s,z)C(g(z2))A1 [1 - f+sA++1A+ A2) ;

I - [A(s,z)D(s,z) + B(s,z)E1 (s,z)] ' 1 - M(s + A1 + A2)

A1

s + A1 + A2

7o(0,s,z2)[E1(s,z)C(z1 ) - C(g(z2))E(s,z)]

Q(0,s,z2)[E1 (s,z)(d1 (s,z) - d2(s,z)) - E(s,z)(dj(s,z) - d^(s,z))] ,

P(0, s, z2) = --^-—;-T—--(25)

{(z1 - C(s,z))E1 (s,z) }

9 B1$1 (s, z)C(g(z2))A1

1 — M(s + A1 + A2)

¡0(0,s,Z2)

V0(0, s, Z2 )

s + A1 + A2

+ 9[E1 (s, z)B2$1(s, z) + (d'l (s, z) — d'2 (s, z))B1^1(s, z)]Q(0, s, z2)

{E1 (s, z) }

R(1)(0, s, z1, z2 )= a1

z)

P(0, s, z1, z2)

1 — B1 (fa (s, z))

_(2) _

R (0, s, z1, z2) = a2z1 P(0, s, z1, z2)

fa(s, z) 1 — B1(fa1 (s, z))

+ Q(0, s, z2)

1 — B2(fa1(s, z))

fa(s, z)

+ a2 Q(0, s, z2)

fa (s, z) 1 — B2 fa (s, z))

fa(s, z)

(26)

(27)

(28)

Theorem.1 When the system is in regular service, breakdown, repair and vacation by using the Laplace transforms the probability generating function of the number of customers in the respective queue is given by

¡0(s,z2) = ¡0(0,s,z2)

P(s, z1, z2) = P(0, s, z1, z2) Q(s, z1, z2) = Q(0, s, z2)

1 — M(s + A1 + A2)

s + A1 + A2 1 — B1(fa1(s, z))

fa1(s, z) 1 — B2 (fa1 (s, z))

V (s, z1, z2) = V (0, s, z1, z2)

fa1(s, z) 1 — V (fa2 (s, z))

R(2)(s, z1, z2) = R(2)(0, s, z1, z2 )

fa2 (s, z) r1 — R(2\fa2 (s, z))

fa(s, z)

(29)

(30)

(31)

(32)

(33)

Proof: Integrating the preceding equations (29) to (33) with respect to v and applying the solution of renewal theory we obtain the following

f TO

yo [1 — H(v)]e—sv dv

1 — h(s)

(34)

Here, the LST of the distribution function of a random variable H(v) is denoted as h(s) . The absolute outcomes of the probability generating functions for the successive states, P(s, z1, z2),

Q(s,z1,z2), V(s,z1,z2), and R(2)(s,z1,z2) are obtained by using equation (29) to (33).

5. Steady State Analysis

According to Tauberian property,

lim sf (s)= lim f (t).

s—>■ 0 -^to

Despite of the state of the system, the probability generating function of the queue size is as follows:

Wq (z1-z2) = DtD,

(35)

s

where

Nr(z1, Z2 ) = N2 (z)D3(z)^1 (z)

1 - M(s + A1 + A2)

s + A1 + A2

02 +

0B1 ft (z)C(g(z2))A1 (1 - V02)

+ N4D2(1 - B0 (z)) [(1 + 0^)02 + a2Z1 (1 - R(2)02(z))

(1 + ^)02 + «2(1 - R2^2(z))l (1 - B201(z))

+ N3 D3

+ (1 - V02 )

0(z) _ _

0E1 (z)B201 (z) + B101 (z)(d* (z) - d* (z))

Dr(Z1, z2) = D2(z)D3 (z)01(z)02 (z),

where,

N2 = z2(-A1 + A2)I0,0E1 (s,z) + C(z2)A2/0,0 [A(s,z)(d*(s,z) - d*(s,z)) + B(s,z)E1(s,z)]

- 1 -N3 = [(-A1 + A2)I0,0E1(s,z) + — C(z2)A210,0[A(s,z)(d*(s,z) - d*(s,z))

z2

1 _ + B(s,z)E1 (s,z)]]F(s,z) + - C(z2)A2/0,0

z2

N4 = N2 A1

1 - M(s + A1 + A2)

[E1(s,z)C(z1) - C(g(z2))E(s,z)]

s + A1 + A2

+ N3[E1 (s,z)(d1 (s,z) - d2(s,z)) - E(s,z)(d*(s,z) - d*(s,z))]

1 - M(s + A1 + A2)-

D2 = z2[E1(s,z) - A(s,z)C(g(z2)AH s + ^ + ^

- [A(s,z)(d*(s,z) - d*(s,z)) + B(s,z)E1(s,z)]F(s,z) D3 = (z1 - C(s,z))E1 (s,z)D2(s,z)

A(s,z) = (1 - 0 + 0V02(z))B101(z) + B(s, z) = (1 - 0 + 0V02(z))B201 (z) + C(s, z) = B101 (z) +

+ R(2) 02(z)

1 - B101 (z)

«1 n1

L0(z)

+ «2 z1 R(2) 02(z)

01 (z)

1 - ^201 (z)

01 (z)

^ + a2 z1 R(2) 02 (z)

0(z)

1 - B101 (z)

d1(s, z) = B2 01 (z) +

0(z)

+ «2z1 R 02(z)

01 (z) 1 - B01 (z)

01 (z)

d2(s,z) = (1 + 0V02(z) - 0V02(z))B201 (z) + d* (s, z) = B2C1(z) +

a1 n1 + R(2) ^(z)

L0(z) 1 - £2^1 (z)

+ R 02 (z)

1 - B201 (z)

L<r(z)

d* (s,z) = (1 + 0V02(z) - 0V02(z))B201 (z) + E(s,z) = (1 + 0V02(z) - 0V02(z))B101(z) + E* (s, z) = (1 + 0V02(z) - 0V^2(z))B101(z) +

(z)

«1 n1

L0(z)

«1 n1

L0(z)

_2 '

+ «2z1 R 02 (z)

_2

+ R 02(z)

01 (z)

1 - B201(z)

■ 01 (z) 1 - B01 (z)

L0(z)

+ R 02(z)

01 (z)

1 - B01 (z)

01 (z)

E

1

E

1

F(z) = M(Ai + À2) + c(Z2)À2 fi (zi, Z2) = fo(z) +

l - M(s + A1 + A2) s + Al + A2 9 Bi fa (z)C(g(z2))Ai (1 - V $2 (z))

E* (zi, z2 )

f2(zi,z2) = (i + ^$2(z)+ «2zi(i - R(2)$2)

f3 (zi, z2 ) = [(i + $2 (z)+ Wi (i - R(2) $2 )](i - B2 $i(z))

+

$(z) _ _

9(E*(z)B2fa(z) + Bi fa(z)(d*(z) - d*(z)))

E* (z)

(i - V$2 (z))

1

$(z) = Al(1 - C(zi) + A2(1 - C(Z2) + ni + £(1 - -)

z2

1

o(z) = A1 (1 - C(g(z2)) + A2(1 - C(z2) + n1 +£(1 - -)

z2

01 (z) = A1 (1 - C(g(z2)) + A2(1 - C(z2) + a1 + a2

1

02(z) = A1 (1 - C(g(z2)) + A2(1 - C(z2) + £(1 - -)

z2

1

fa(z) = A1 + A2 (1 - C(z2) + n1 +£(1 - - )

z2

fa (z) = A1 + A2(1 - C(z2) + U1 + U2

1

fa(z) = A1 + A2(1 - C(z2) + £(1 - -).

z2

Using normalization condition Wq (1,1) + I0,0 = 1, we get

>2(1,1)d3(1,1)(«1 + *2)(Ç- (A1 + A2))] [ N3 (1, 1)d3 (1,f (1,1) + n2 (1, 1)d3 (1,1)f1 (1,1)(«1 + «2) - M(A1 + A2)-

Ioo

Ai + A2

+ N4(i,i)D2(i,i)f2(i,i)(i - Bi(ai + «2))]

D2(i, i)D3(i, i)(ai + a2)(£ - (Ai + A2

and the utilization factor is given by

' [ N3 (1, 1)d3 (1,1)f '3(1,1) + N2(1, 1)d3 (1,1)f1(1,1)(*1 + *2 )

p

i - M(Ai + A2)

Ai + A2

+ N4 (i,i)D2(i,i)f2 (i,i)(i - Bi (ai + *2 ))]

{d2(1, 1)d3(1, 1)(«1 + a2)(£ - (A1 + A2))}

The stability condition for the model under which steady state exists is p < 1

(36)

(37)

6. Performance Measures

The expected queue size for priority customer is as follows:

Lq1 = W (z1,1)\z1 =1

The expected orbit size for ordinary customer is as follows:

Lq2 = dt^q(1, z2 )\z2=1

(38)

(39)

then

Dr''(1)Nr(''')(1) - Dr''')(1}Nr"(1) qi = 3(Dr'' (1))2 ,

Dr'''(1)Nr(iv)(1) - Dr(iv)(1)Nr'''(1)

jq2 4(Dr''' (1))2

The expected waiting time for priority queue is as follows:

wq = ^

W1 A1

The expected waiting time for orbit is as follows:

= Af.

(40)

(41)

(42)

(43)

7. Particular Cases

Case 1:

In the absence of priority queue, when there is no breakdown, no reneging, no vacation and no retrial then the above model becomes

Wq (Z)

-(1 - Bf)(A - AC(Z2)) 10,0 Z2 - B2(A2 - A2C (Z2))

which is the PGF of Medhi [21]. Case 2:

In the absence of priority queue, when there is no breakdown, no reneging and no retrial then

the above model becomes

[-01 (z,s) 1o,o(1 - 9V(01 (z,s)) + 9V(01 (z,s)))(1 - B1 (0(z,s))) + 9A1C(g(zf)) 1o,o1 - ev(01 (z,s))z1 - B1(0(z,s))] + [Qo(0,z2)[e(Bi(^(z,s)) - Bf(0(z,s)))(1 - V(0(z,s))) (z1 - B1 (0(z,s))) - (zf - Bf (01 (z,s)))(1 - ev(0(z,s)) + 9V(01 (z,s)))(1 - BT(0(z,s))) + (z1 - B1(0(z,s))) [(1 -Bf(0(z,s)))(1 - V(p-(z,s))) + 9V(0(z,s)))]]

Wq (z)

{[zi - Bi(0(z,s))(1 - 9V(^(z,s)) + 9V(0(z,s)))0(z,s)] } which is the PGF of Ayyappan and Thamizhselvi [6].

8. Numerical Results

This section deals with the numerical and graphical studies of this model. We assume that the service time, breakdown, repair and vacation time are distributed exponentially.

Table 1: Effect ofpn'on'ty arn'va/ rate (Ai)

Ai ^0,0 P Lqi Wqi Lq2 CN sr

0.1 0.2806 0.7194 0.2082 2.0816 0.2463 0.1231

0.2 0.2776 0.7224 0.4758 2.3789 0.3580 0.1790

0.3 0.2754 0.7246 0.7650 2.5501 0.4246 0.2123

0.4 0.2743 0.7257 1.0720 2.6801 0.4554 0.2277

0.5 0.2742 0.7258 1.3930 2.7859 0.4616 0.2308

Table 1 shows that when the arrival rate (A1) of priority customers for priority queue increases, then the probability of the server being idle decreases. However, average queue lengths busy period and average waiting time for customers in the queues all increase: we assume the values as A2 = 2, a1 = 0.1, a2 = 0.1 p = 5, ^ = 10,n2 = 15, 7 = 10, 9 = 0.9, $ = 20, £ = 0.9 and A1 = 0.1 to 0.5.

Table 2: Effect of service rate (y)

y h,o P Lqi Wqi Lq2 Oi sr

5 0.3058 0.6942 0.4275 1.4250 0.6219 0.3110

6 0.4823 0.5177 0.4270 1.4233 0.5472 0.2736

7 0.5950 0.4050 0.4200 1.4001 0.4856 0.2428

8 0.6728 0.3272 0.4109 1.3695 0.4348 0.2174

9 0.7296 0.2704 0.4012 1.3374 0.3926 0.1963

10 0.7727 0.2273 0.3918 1.3060 0.3576 0.1788

Table 2 shows that when the service rate (p) increases then the probability of the server being idle increases. However, average queue lengths, busy period, and average waiting time for customers in the queues all decrease: we assume the values as A1 = 0.3, A2 = 2, a\ = 0.2, a2 = 0.5, n2 = 10,m = 15, 7 = 10, 9 = 0.8, $ = 20, £ = 0.9 and p = 5 to 10.

Table 3: Effect of ordinary customers arrival rate (A2

A2 h,0 P Lqi Wqi CN sr

1.5 0.6275 0.3275 0.4029 0.8058 0.0409 0.0273

1.6 0.6406 0.3594 0.4347 0.8694 0.2939 0.1837

1.7 0.6073 0.3927 0.4663 0.9326 0.4609 0.2711

1.8 0.5725 0.4275 0.4974 0.9949 0.5752 0.3196

1.9 0.5361 0.4639 0.5279 1.0557 0.6556 0.3451

2.0 0.4981 0.5019 0.5573 1.1145 0.7133 0.3567

Table 3 shows that when the arrival rate (A2) of ordinary customers increases, then the probability server being idle decreases. Busy period, average queue lengths, and average waiting time for customers in the queues all increase: we assume the values as A1 = 0.5, p = 6, a1 = 0.3, a2 = 0.5, p = 5, ni = 6, n2 = 15, 7 = 10, 9 = 0.8, $ = 18, £ = 0.9 and A2 = 1.5 to 2.

In graphical representations, we assume that the service time, breakdown, repair, and vacation time are follows Erlang-2 distribution. The two-dimensional graphs are shown in Figure 2-4. Figure 2 exhibits that the expected length of the queue (Lq1, Lq2)rises, the expected length of the queue extends together with the priority arrival rate (A1). The behaviour of the queue sizes (Lq1, Lq2), which depends on the service rate (a), is shown in Figure 3, the length of the queue as the service rate rises. Figure 4 shows the expected queue length (Lq1, Lq2), which depends on the ordinary customers arrival rate (A2), the expected queue length grows together with the repair rate.

g

n le

e u e

u

q

d te ct

e p

x

w

0.5

II -»- Lqi

-■- Lq2

—^0,0

//_______■ -■

V III

0.1

0.2

0.3 Ai

0.4

0.5

Figure 2: Expected queue length vs pr/or/ty arrival rate Ai 0.8

g

n le

e u e

u

q

d te ct

e p

x

w

0.7 0.6 0.5 0.4 0.3

-♦- Lqi

-■- Lq2

—^0,0

♦-T^»-__ -

II

5 6 7 8 ¥

9 10

Figure 3: Expected queue length vs serv/ce rate ¥

0.6

0.4

g

n le

e u e

u

q

d e

pec 0.2 x

w

-♦- Lqi

-■- Lq2

—^0,0

1.5 1.6 1.7 1.8 1.9 2 A2

Figure 4: Expected queue length vs ord/nary arrival rate A2

1

0

17 0.3

High priority arrival (A )

Low priority arrival (A.)

Figure 5: Lq1 Vs A1 and A2

17 0.3

High priority arrival (A,.)

Low priority arrival (A2)

Figure 6: Lq2 Vs A1 and A2

Figure 7: Lq1 Vs 7 and A1

ANALYSIS OF M[Xi],M[X2]/GT,G2/1 RETRIAL QUEUE WITH RT&A, No 2 (73)

PRIORITY SERVICES, DIFFERENTIATE BREAKDOWN,REPAIR,... Volume 18, June 2023

8 0.3

High priority arrival (A1)

Vacation rate (7)

Figure 8: Lq2 Vs 7 and Aj

Figure 10: Lq2 Vs ni and p

Graphs in three dimensions can be found in Figures 5 - 10. Figures 5 and 6 in the reference indicate that as the priority arrival rate (A1) and ordinary arrival rate (A2) increase, the expected queue size (Lq1) and orbit size (Lq2) increase as well. The behaviour of queue size (Lq1) and orbit size (Lq2) rises for increasing priority arrival rate(A1) and vacation rate (7) as shown in Figure 7 and 8. The behaviour of queue size (Lq1) and orbit size (Lq2) increases with lowering repair rate (n2) and service rate (p) in Figure 9 and 10 .

In this study, we examined a non-preemptive priority retrial queue on a single server with distinct breakdown, repair, synchronised reneging, and optional server vacation. Random failures of servers are common. The breakdown of the model proposed in this study differs from traditional breakdown, which can be either a long breakdown (hard failure) or a short breakdown (soft failure). For example, if a computer system fails, a simple rebooting of the system (soft failure) or repair by a skilled personnel ( hard failure) can fix the problem. Ordinary customers may exit the orbit if the server is either down or busy with priority queue. Furthermore, on completing the priority service, the server may become idle or may go for a vacation. Probability generating functions for the system size and its orbit were found by using supplementary variable technique. System characteristics such as steady-state probabilities and mean system size were also obtained. The results obtained analytically were confirmed with numerical illustrations. The model proposed in this study finds significant practical applications in computer processing systems.

[1] Adan, I., Economou, A. and Kapodistria, S. (2009). Synchronized reneging in queueing systems with vacations, Queueing Syst, Queueing Syst, 62:1-33.

[2] Ammar, S.I. and Rajadurai, P. (2019). Performance Analysis of Preemptive Priority Retrial Queueing System with Disaster under Working Breakdown Services, Symmetry, 419(11):1-15.

[3] Arivudainambi, D. and Godhandaraman, P. (2015). Retrial queueing system with balking, optional service and vacation, Symmetry, 229(5):67-84.

[4] Ayyappan, G. and Udayageetha, J. (2018). Transient Analysis of M[X1 ], M[X1 /Gi, G2/1 retrial queueing system with priority services, Collisions, Orbital Search,Working Breakdown, Startup/Close down time, Feedback, modified Bernoulli vacation and Balking, Symmetry, 13(11):8783-8795.

[5] Ayyappan, G., Muthu Ganapathi Subramanian, A. and Sathiya, K. (2013). M[X] /G/1 Queue with Two Phase of Service and Optional Server Vacation, International Journal of Computer Applications, 66(6):4-10.

[6] Ayyappan, G. and Thamizhselvi, P. (2016). riority queueing System with a Single Server Serving Two Queues M\x1\M\x2 /G1, G2/1 with and Optional Server Vacation, Applications of Applied Mathematics, 11(1):61-82.

[7] Baruah, M., Madan, K.C. and Eldabi, T. (2013). A Two Stage Batch Arrival Queue with Reneging during Vacation and Breakdown Periods, American Journal of Operations Research, 3(6):570-580.

[8] Brandwajn, A. and Begin, T. (2017). Multi-server preemptive priority queue with general arrivals and service times, European Journal of Operational Research, 115(1):150-164.

[9] Choudhury, G. and Kalita, C.R. (2017). An M/G/1 queue with two types of general heterogeneous service and optional repeated service subject to server breakdown and delayed repair, Quality Technology & Quantitative Management, 15(5):622-654.

[10] Choudhury, G., Tadj, L. and Deka, K. (2010). A batch arrival retrial queueing system with two phases of service and service interruption, Computers and Mathematics with Applications, 126(59):437-450.

9. Conclusion

References

[11] Dhas, D., Nadarajan, R. and Lee, H.W. (1992). A preemptive priority queue with general bulk service and heterogeneous arrivals, Performance Evaluation, 18(3):327-333.

[12] Dimitriou, I. (2013). A mixed priority retrial queue with negative arrivals, unreliable server and multiple vacations, Applied Mathematical Modelling, 37(3):1295-1309.

[13] Economou, A. and Kapodistria, S. (2010). Synchronized abandonments in a single server unreliable queue, European Journal of Operational Research, 203:143-155.

[14] Jain, M., Sharma. G.C. and Sharma, R. (2012). A batch arrival retrial queuing system for essential and optional services with server breakdown and Bernoulli vacation, international Journal of Internet and Enterprise Management, 8(1):16-45.

[15] Janani, B. (2022). Transient Analysis of Differentiated Breakdown Model, Applied Mathematics and Computation, 417(3):131-140 .

[16] Wua, J. and Lian, Z. (2013). Analysis of the M[1], M[2]/G/1 G-queueing system with retrial customers, Nonlinear Analysis Real World Applications Journal, 69(14):365-382.

[17] Kim, B., Kim, J. and Bueker, O. (2021). Non-preemptive priority M/M/m queue with servers' vacations, Computers & Industrial Engineering, 160:171-179.

[18] Krishnamoorthy, A., Babu, S. and Narayanan, V.C. (2009). The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service, European Journal of Operational Research, 195(1):174-185.

[19] Madan, K.C. and Rawwash, M. (2005). On the M[X]/G/1 queue with feedback and optional server vacations based on a single vacation policy, Applied Mathematics and Computation, 160(3):909-919.

[20] Maragathasundari, S. and Srinivasan, S. (2014). A Non-Markovian multistage batch arrival queue with breakdown and reneging, Hindawi Publishing Corporation, 14:1-16.

[21] Medhi, J. (2002). A single server Poisson input queue with second optional channel, Queueing Systems, Theory Applications, 42:239-242.

[22] Gupta, P., Gupta, R. and Malik, S. (2022). Impatient Customers in Queueing System with Optional Vacation Policies and Power Saving Mode, Applications and Applied Mathematics, 17(1):1-17.

[23] Rakesh Kumar and Soodam, B.S. (2019). Transient numerical ananlysis of a queueing model with correlated reneging, balking and feedback, Reliability Theory and Applications, 14(4):46-54.

[24] Laxmi, P.V. Bhavani, E.G. and Kumar, R. (2022). Correlated reneging in an optional service Markovian queue with working vacations , Reliability Theory and Applications, 17(2):507-518.