DISCRETE-TIME WORKING VACATIONS QUEUE WITH IMPATIENT CLIENTS AND CONGESTION DEPENDENT SERVICE RATES

K. Jyothsna1'*, P. Vijaya Kumar2, Ch. Gopala Rao3,

•

1'* Department of Basic Sciences and Humanities, Vignan's Institute of Engineering for Women,

Visakhapatnam, Andhra Pradesh, India. mail2jyothsnak@yahoo.co.in, drjyothsnak1984@gmail.com 2Department of Mathematics, GITAM (Deemed to be University), Visakhapatnam, Andhra Pradesh, India. vprathi@gitam.edu 3Department of Mathematics, MVGR College of Engineering, Vizianagaram, Andhra Pradesh, India. gopalchalumuri83@gmail.com

Abstract

The current research article explores a finite capacity discrete-time multiple working vacations queue with impatient clients and congestion dependent service rates. An arriving client can choose either to enter the queue or balk with a certain probability. Due to impatience, he may renege after joining the queue as per geometric distribution. Rather than totally shutting down the service throughout the vacation period, the server functions with a different service rate. The times of services during regular service and during working vacation periods are considered to be geometrically distributed. The vacation periods are also presumed to be geometrically distributed. In addition, the service rates are considered to be dependent on the number of clients in the system during regular service period and during working vacation period. The model's steady-state probabilities are calculated using matrix approach and a recursive solution is also provided. The recursive solution is used for obtaining the corresponding continuous-time results. Various system performance metrics are presented. Finally, the numerical representation of the consequences of the model parameters on the performance metrics is furnished.

Keywords: Queue, discrete-time, working vacations, balking, reneging, congestion dependent service rates

1. Introduction

A discrete-time queueing model is one in which the time between two arrivals and the service times are discrete random variables. Such queueing models are more relevant than the continuous-time queuing models for designing and monitoring the efficacy of computer systems, communications network systems, industrial and production systems, traffic systems and healthcare systems. Furthermore, discrete-time analysis can be used to approximate a continuous-time system but this is not the case in reverse. Shizhong Zhou et al. [13] investigated a discrete-time queue with preferred customers and partial buffer sharing. Michiel De Muynck et al. [9] analysed a discrete-time queue with general service demands and phase-type service capacities. A discrete-time queue with three different strategies has been studied by Ivan Atencia et al. [7].

Individuals are always concerned while waiting for service, hence dissatisfaction is a most noteworthy characteristic in queueing systems. In reality, queues with impatient clients frequently occur where clients become irritated owing to lengthy waiting lines. Due to which, clients either balk (i.e., refuse to join the queue) or renege (i.e., abandon the queue without being served). In real-world congestion situations, performance examination of queueing systems with balking and reneging is advantageous since fresh managerial insights are gained. The importance of the aforementioned queueing systems can be seen in telecom companies, networking and telecommunication systems, production system, machinery operating systems, health emergency rooms, inventory management systems, etc. The amount of lost revenues can be estimated using the balking and reneging probabilities when deciding on the service rate of servers required in the service system to satisfy the needs that change over time. The concept of balking and reneging has been introduced by Haight [5] and Haight [6], respectively. Customers' balking and reneging behaviour in queueing theory were compared by Amit and Sonja [1]. Rakesh Kumar [10] conducted an economic analysis of a finite buffer multi server queuing model including balking, reneging and customer retention. The busy period study of a queuing model with balking and reneging was presented by Wang and Zhang [17]. G. S. Kuaban et al. [8] investigated a multi-server queuing model with balking and correlated reneging.

Working vacation (WV) models are the ones in which the server stays available and serves clients at a lower rate throughout the vacation period. If the queue is not empty at the vacation termination epoch, the server enters a regular service period with regular service rates; otherwise, the server returns to WV. Such type of working vacation policy is termed as multiple working vacations (MWV). This type of working vacation policy was introduced by Servi and Finn [12]. The discrete-time multiple working vacation queue with balking has been studied by Vijaya Laxmi et al. [14]. Vijaya Laxmi and Jyothsna [15] analyzed a finite buffer discrete-time batch service queue with multiple working vacations. A survey on working vacation queueing models has been presented by Chandrsekaran et al. [2]. Rama Devi et al. [11] analyzed an M/M/1 queue with working vacation, server failure and customer's impatience.

Queues with single server whose service rates are proportional to the queue size are accurate models for systems where the server's performance must be adjusted in accordance to the quantity of clients in the queue. In congestion dependent queueing systems, the server's service rate may be influenced by the availability of work in the system. The service rate for each client can be dynamically updated as a function of the number of clients in the system using congestion dependent services. Furthermore, queueing networks get benefited from queueing models with finite capacity and congestion dependent services, which often add to the complexity of these systems' solutions. For literature on congestion dependent queues, see [4, 16, 3] and the references therein.

The current paper considers a finite buffer discrete-time MWV queue with impatient clients and congestion dependent service rates. Service times are supposed to be geometrically distributed and congestion dependent throughout regular service and during working vacations. The inter-arrival times of clients and vacation times are both presumed to be geometrically distributed. The queue is analyzed under the late arrival system with delayed access (LAS-DA) and the steady-state system length distributions are obtained using matrix approach and a recursive solution is also provided. The results of the corresponding continuous-time queue are obatined from the recursive solution of the discrete-time queue. A few model performance metrics are developed using the steady-state probabilities. Finally, the parameter effect on the performance indices of the system is exhibited through some numerical results.

The remaining part of the paper is laid out in the following manner. In Section 2, the description of the model and steady-state probabilities are presented. The performance metrics of the model are displayed in Section 3. Section 4 depicts the impact of the model parameters on the performance metrics in the form of a table and graphs. The paper is concluded in Section 5.

A

A (Potential arrival)

+-Û I » I

I 9 I-

(f+1)- ((+1) (f+1)+

D (Potential departure)

t-

t+

D

O: Potential arrival epoch

• : Potential departure epoch

* : Outside observer's epoch

(/+,(f + 1)-) : Outside observer's interval

f+ : Epoch after a potential departure t- : Epoch prior to a potential arrival

Figure 1: Different time instants in late arrival system with delayed access (LAS-DA)

2. Description of the model and steady-state probabilities

Under the late arrival system with delayed access (LAS-DA), we study a finite buffer discrete-time balking and reneging single server queue with multiple working vacations and congestion dependent service rates. Suppose that the time axis is divided into equal-length intervals with the duration of a slot being equal to one and are labeled as 0,1,2,..., t, — A possible arrival of a client occurs in (t-, t) while a potential departure of the client occurs in (t, t+). The different time instants in LAS-DA are displayed in Figure 1.

The system is presumed to have a finite capacity N. The inter-arrival times A of clients are independent and geometrically distributed with probability mass function (p.m.f.) P(A = i) = Ai—1 A, i > 1,0 < A < 1 where for xe[0,1], we denote x = 1 — x. If a client arrives and discovers the system is busy, the client can choose to join the queue or balk. When the system size is n, let bn indicate the probability that a client will join the queue for service or will balk with probability bn. Furthermore, we assume that b0 = 1,0 < bn < bn+\ < 1,1 < n < N — 1, bN = 0.

Each client will wait a specified amount of time T for service to commence after joining the queue. If it hasn't started by then, he'll become frustrated and exits the queue without being served. The impatient time T is geometrically distributed and independent with common p.m.f. P(T = i) = a1—1 a, i > 0,0 < a < 1. As an impatient client's arrival and departure without service are unrelated, r(n) = (n — 1)a,1 < n < N can be used as the function of the average reneging rate of the client.

The clients are served on a first-come first-served (FCFS) discipline. The service times of clients S are geometrically distributed and independent with p.m.f. P(S = i) = ff1 fn, i > 1,0 < fn < 1 when there are n clients in the system. The durations of service during a working vacation period Sv are geometrically distributed and independent with p.m.f. P(Sv = i) = fjln—1 Vn, i > 1,0 < nn < 1. When the server detects that the system is vacant, it follows multiple working vacation policy. Upon return of the server after a working vacation discovers that the system is vacant, another working vacation commences. Or else, the server initiates a regular service period. The vacation times V are geometrically distributed and independent with p.m.f. P(V = i) = (f>i—1$, i > 0,0 < $ < 1.

Let Pn,0 < n < N be the probability that the system has n clients when the server is on WV at steady-state and when the server is in regular service period Qn, 1 < n < N represents the probability that there are n clients in the system. The steady-state equations can be expressed as

follows based on the one-step transition analysis.

Po = APq + hi (m )Pi + i2 (n2 )P2 + hi(ui)Qi +12 (U2 )Qi,

(1)

Pn

Pn-1 Pn Qi

Qn

$ (gn (Vn)Pn + fn-1 (Vn-l )Pn-i + hn+i(Vn+i)Pn+i + tn+2(nn+2)Pn+2) ,

1 < n < N - 2, (2)

$ (gN-i(nN-i )Pn-1 + fN-2 (nN-2)PN-2 + h-N (VN )Pn ) , (3)

$ (gN(VN)Pn + fN-i(VN-i)Pn-1 ), (4)

gi(Ui )Qi + h-2(U2 )Q2 +13 (U3 )Q3 + $(gl (ni )Pi + APo + h2 (V2 )P2 +13 (n()P3)), (5)

gn (Un )Qn + hn+i(pn+i )Qn+i + tn+2(^n+2 )Qn+2 + fn-l(Un-l )Qn-i + $(gn (Vn )Pn

+fn-i(Vn-i )Pn-i + hn+1 (Vn+i)Pn+i + tn+2 (Vn+2)Pn+2 ), 2 < n < N - 2, (6)

Qn-1 = gN-l(U N-l)QN-l + h-N (UN )Qn + fN-2 (UN-2)Qn-2 + $(gN-l (nN-l)PN-l

QN

where

fn(x) -

gn(x) -

hn (x) --tn (x) --

+fN-2 (VN-2 )Pn-2 + hN (VN )Pn ),

gN (UN )Qn + fN-l(UN-l )Qn-1 + $( gN (VN )Pn + fN-l (nN-l)PN-l),

A, n = 0,

AbnX (l - (n - l)a)), l < n < N - l, (l - Abl)X + Ablx : n = l,

(l - Abn)x(l - (n - l)a) + Abn (x(l - (n - l)a) + x(n - l)a) ,2 < n < N, (l - Abl)x, n = l,

(l - Abn) (x(l - (n - l)a) + x(n - l)a) + Abnx(n - l)a, 2 < n < N, (l - Abn)x(n - l)a, 2 < n < N.

(7)

(8)

Matrix Solution

To determine the steady-state probabilities, we propose a matrix solution. The infinitesimal generator of the Markov process can be represented as below using the lexicographical sequence for the states.

Q

/ Ao Do

Bi Ai Di

C2 B2 A2 D2

C3 B3 A3

\

D3

C

N2

BN-2 CN i

AN-2 DN-2 BN-i AN-i DN-i CN BN AN

where

Ao Bi

An

Bn

Cn

( -A ); Do = ( $fo(vo) A$ ).

hi(Vi) \ . hi (Ui) ) ;

C2

ti (V2 )\ .

ti(U2)

$gn(Vn) - 1 $gn (VnM

o gn(Un) J '

$hn(nn) $hn(Vn)

o hn(Un)

$tn (Vn ) $tn (Vn ) o tn(Un)

l < n < N; ,2 < n < N; , 3 < n < N.

Let n = (no, ni,..., n^-i, n«) be the vector of steady-state probabilities, where no = (Po), nn (Pn, Qn), for 1 < n < N. The equations at steady-state nQ = 0 can be expressed as

noAo + ni Bi + n2C2 = 0, noDo + niAi + n2 B2 + nsCs = 0,

nn-1 Dn-i + nn An + nn+i Bn+i + nn+2 Cn+2

nN-2 DN-2

+ n

N-iAN-i

+ nN B

NBN =

0, 2 < n < N - 2, 0,

*i*Не можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

nN-iDN-i + nN An = 0. After recursive substitutions, equations (ii) to (i3) yields

n„

nNMnD-i,i < n < N - i,

(9)

(10)

(11) (i2) (i3)

(i4)

where

Mn-i

MN-2 MN-3 Mn

-AN,

-Mn-iD

i

N- i

B

N,

MN-2DN-2AN-2 - MN-iDN-iBN-i - CN, i

-Mn+iDn+LiAn+i - M„+7D„ i2B

i

n+2Dn+2Bn+2

- Mn+3D-i3Cn+3, i < n < N - 4.

Assuming PN to be known, equation (10) and(14) yields QN in PN. From equations (14), Pn (0 < n < N — 1) and Qn, (1 < n < N — 1) can be evaluated in terms of PN. Finally, PN is computed from the normalization condition P0 + ^N=i nne = 1, where e is a column vector with each component equal to one. The steady-state probabilities are calculated using a computer code.

Recursive Solution

In order to approximate the corresponding continuous-time results we have obtained the expressions of the steady-state probabilities using recursive method though the matrix method is easy to program and implement. Solving the equations (2) to (8) recursively and utilizing the normalization condition ^N=0 Pn + ^N=1 Qn = 1, the explicit expressions of the steady-state probabilities are obtained as

/ N N \ —1

Pn = ^ + ^ (Wn + kfn) ,0 < n < N,

n=0 n=1

/ N N \ —1

Qn = (Wn + kfn) ^ + ^ (Wn + kfn) '1 < n < N,

n=0 n=1

where

$N = 1,

$N-1 = (1 - <gN (VN ))/<fN-1 (VN-1),

$N-2 = ((1 - <f>gN-1(VN-1)) $N-1 - #N (VN )) /<fN-2(nN-2 ),

$n = ((1 - <<gn+1(Vn+1)) $n+1 - < hn+2 (Vn+2)$n+2 - < tn+3(Vn+3 )$n+3) /<fn (Vn ),

n = N - 3,...,0, fN = 1, <N = 0, fN-1 = (1 - gN(UN)) /fN-1 (UN-1),

WN-1 = -< (gN (nN)+ fN-1 (tfN-1 )$N-1) /fN-1 (UN-1), fN-2 = ((1 - gN-1 (UN-1)) fN-1 - hN (UN )) / fN-2 (UN-2),

fn = (1 - gn+1 (Un+1)) fn+1 - hn+2 (Un+2) fn+2 - tn+3(Un+3) fn+3) / fn (Un ),

n = N - 3,...,1,

<¿N-2 = (((1 - gN-1 (UN-1 ))<N-1 - hN (UN )<N ) - <(gN-1(VN-1 )$N-1 +fN-2(nN-2 )$N-2 + hN (nN )$n)) / fN-2(UN-2 ), <n = ( ((1 - gn+1 (Un+1))<n+1 - hn+2 (Un+2)<n+2 - tn+3(Un+3 )<n+3) - <(gn+1 (nn+1 )$n+1 +fn (nn)$n + hn+2(nn+2)$n+2 + tn+3(nn+3)$n+^)/ fn (Un), n = N - 3,. . ., 1,

k = <g1 (m)$1 + A$0 + h2 (n2)$2 + t3 (n3 )$3) - ((1 - g1(U1))<1 - h2(U2)<2 -t3(U3)<3))/((1 - g1(U1)) f1 - h2 (U2) f2 - t3(U3) f3).

Remark: In continuous-time context, let j8, vn, Qn and q represent the arrival rate, service rates during regular busy period, during WV period and vacation rate, respectively. Further, let the time axis be divided into equal length slots of length A > 0, so that A = fiA, Un = vnA, nn = QnA and < = qA where A is small enough. Now, the results of the corresponding continuous-time M/M(n)/1/N/MWV queue with balking and reneging are obtained by substituting A, Un,nn and < in the recursive solution.

3. Performance metrics

Let Ls denote the mean of the number of clients in the system and is expressed as

N

Ls = E n(Pn + Qn).

n=1

During regular service and during WV, the busy probability of the server are denoted as pb and pv, respectively. The probabilities pb and pv are given by

NN

pb = E Qn, pv = E Pn.

n=1 n=0

The average balking rate (br), average reneging rate (rr) and the average rate of client loss due to impatience (lr) are given as

N

br = E A(1 - bn)(Pn + Qn),

n=1 N

rr = E (n - 1)a(Pn + Qn),

n=1

lr = br + rr.

Table 1: Performance metrics for different ym

nm o.o54i67 o.2i6667 o.4874999 o.866667 i.354i7

Ls 2.o7544i 2.o74633 2.o73842 2.o73o65 2.o723o3

Ir o.545ii9 o.544945 o.544773 o.5446o3 o.544436

Pb o.965786 o.965623 o.96546o o.965297 o.965i34

Pv o.o342i4 o.o34376 o.o34539 o.o347o2 o.o34866

o t (D CL

Figure 2: A versus performance metrics

0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 2.2

Figure 3: Impact of ^m on Ir and Ls

m

1 -

(D

o

g 0.5-

o 04 " t (D

Q_ 0.3 -

0 *-

0

pb

pv

Figure 4: pm versus pb and pv

4. Numerical results

The influence of the system parameters on the model's various performance metrics is presented in this section. The capacity of the system is assumed as N = 12. The balking function is taken as bn = 1/(n + 1), 1 < n < N - 1 with the assumption that b0 = 1 and bN = 0. The model parameters are arbitrarily chosen to be A = 0.7, $ = 0.6, a = 0.09. The congestion-dependent service rates of the system are taken to be pn = 0.8n/N, yn = 0.6n/N with means pm = 0.433333 and nm = 0.325, respectively.

The values of the performance metrics for various mean service rates during WV are presented in Table 1. The average number of clients in the system (Ls), average rate of losing a client (Ir) and the probability of the server in regular service (pb) - all show a diminishing trend as the mean service rate during WV grows. With an increase in ym, the probability of the server being in WV ( pv ) increases.

The arrival rate's impact on the different performance metrics of the model is displayed in Figure 2. From the figure it is evident that the performance metrics Ir, Ls and pb increase with the increase of A while the performance metric pv decreases with the increase of A.

The influence of mean service rate during regular busy period pm on the performance measures Ls and Ir is depicted in Figure 3. It is clearly apparent from the graph that both Ls and Ir decrease with the increase of pm as intuitively expected.

Figure 4 presents the changes in pb and pv with the the increase of pm. With the increase of pm, the probability of the service being busy with regular service (pb) falls but the probability of the server being busy in WV ( pv) increases.

5. Conclusions

The study of a finite buffer discrete-time congestion dependent queue with balking, reneging and multiple working vacations is presented in this paper. The stationary probabilities of the model are obtained using matrix method as well as recursive method. Different performance characteristics of the model such as average number of clients in the system, busy probability of the server during regular service, busy probability of the server during working vacations, average balking rate, average reneging rate and average rate of loosing a client are presented. A variety of numerical findings in the form of tables and graphs are used to demonstrate com-

putational experiences. Future research can be focussed on the extension our findings to a

GI/Geo(n)/1/N queue with WV and impatient clients.

References

[1] Amit I. Pazgal and Sonja Rasdas (2008). Comparison of customer balking and reneging behavior to queueing theory predictions: An experimental study. Computers & Operations Research, 35(8):2537-2548.

[2] Chandrasekaran, V. M., Indhira, K., Saravanarajan, M. C. and Rajadurai, P. (2016). A survey on working vacation queueing models. International Journal of Pure and Applied Mathematics, 106(6): 33-41.

[3] Doo Il Choi and Dae-Eun Lim (2020). Analysis of the state-dependent queueing model and its application to battery swapping and charging stations. Sustainability, 12(6) issue.2343:1-15.

[4] Goswami, V., Vijaya Laxmi, P. and Jyothsna, K. (2013). Analysis of GI/M(n)/1/N queue with state-dependent multiple working vacations. OPSEARCH, 50(1):106-124.

[5] Haight, F. A. (1957). Queueing with balking. Biometrika, 44:360-369.

[6] Haight, F. A. (1959). Queueing with reneging. Metrika, 2:86-197.

[7] Ivan Atencia, Garcia, J. L. G., Venegas, G. A. B, Cielos, P. R., Garcia, M. A. G. and Dominguez Y. P. (2021). A discrete-time queueing system with three different strategies. Journal of Computational and Applied Mathematics, 393(113486):1-9.

[8] Kuaban, G. S., Rakesh Kumar, Bhavneet Singh Soodan and Piotr Czekalski (2020). A multiserver queuing model with balking and correlated reneging with application in health care management. IEEE Access, 8:169623-169639.

[9] Michiel De Muynck, Herwig Bruneel and Sabine Wittevrongel (2017). Analysis of a discrete-time queue with general service demands and phase-type service capacities. Journal of Industrial and Management Optimization, 13(4):1901-1926.

*i*Не можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

[10] Rakesh Kumar (2013). Economic analysis of an M/M/c/N queuing model with balking, reneging and retention of reneged customers. OPSEARCH, 50:383-403.

[11] Rama Devi, V. N., Ankamma Rao, A. and Chandan K. (2019). M/M/1 queue with working vacation, server failure and customer's impatience, International Journal of Scientific & Technology Research, 8(9):2262-2268.

[12] Servi, L. D. and Finn, S. G. (2002). M/M/1 queue with working vacations (M/M/1/WV). Performance Evaluation, 50:41-52.

[13] Shizhong Zhou, Liwei Liu, Jianjun Li (2015). A discrete-time queue with preferred customers and partial buffer sharing, Mathematical Problems in Engineering, Volume 2015, Article ID 173938,12 pages, http://dx.doi.org/10.1155/2015/173938

[14] Vijaya Laxmi. P., Goswami, V. and Jyothsna, K. (2013). Analysis of discrete-time single server queue with balking and multiple working vacations. Quality Technology & Qualitatitive Management, 10(4):443-456.

[15] Vijaya Laxmi, P. and Jyothsna, K. (2014). Finite buffer GI/Geo/1 batch servicing queue with multiple working vacations. RAIRO Operations Research, 48:521-543.

[16] Vijaya Laxmi, P. and Jyothsna, K. (2015). On renewal input state dependent working vacations queue with impatient customers. International Journal of Mathematics in Operational Research, 7(6):661-680.

[17] Wang Qiangqiang, Zhang Bin (2018). Analysis of a busy period queuing system with balking, reneging and motivating. Applied Mathematical Modelling. 64:480-488.